pub struct QuantumMLExecutor<const N: usize> { /* private fields */ }Expand description
Quantum circuit executor for ML applications
Implementations§
Source§impl<const N: usize> QuantumMLExecutor<N>
impl<const N: usize> QuantumMLExecutor<N>
Sourcepub fn with_simulator(self, simulator: StateVectorSimulator) -> Self
pub fn with_simulator(self, simulator: StateVectorSimulator) -> Self
Set simulator backend
Sourcepub fn with_device(self, device: impl Into<String>) -> Self
pub fn with_device(self, device: impl Into<String>) -> Self
Set device backend
Sourcepub fn add_layer(&mut self, layer: &dyn QuantumLayer<N>) -> Result<()>
pub fn add_layer(&mut self, layer: &dyn QuantumLayer<N>) -> Result<()>
Add a quantum layer to the circuit
Sourcepub fn register_parameter(&mut self, name: impl Into<String>, index: usize)
pub fn register_parameter(&mut self, name: impl Into<String>, index: usize)
Register a parameter
Sourcepub fn execute(&self, parameters: &[f64]) -> Result<Array1<f64>>
pub fn execute(&self, parameters: &[f64]) -> Result<Array1<f64>>
Execute circuit with given parameters
Sourcepub fn expectation_value(
&self,
parameters: &[f64],
observable: &PauliString,
) -> Result<f64>
pub fn expectation_value( &self, parameters: &[f64], observable: &PauliString, ) -> Result<f64>
Execute circuit and compute expectation value
Sourcepub fn compute_gradients(
&self,
parameters: &[f64],
observable: &PauliString,
) -> Result<Array1<f64>>
pub fn compute_gradients( &self, parameters: &[f64], observable: &PauliString, ) -> Result<Array1<f64>>
Compute gradients using parameter shift rule
Auto Trait Implementations§
impl<const N: usize> !Freeze for QuantumMLExecutor<N>
impl<const N: usize> !RefUnwindSafe for QuantumMLExecutor<N>
impl<const N: usize> Send for QuantumMLExecutor<N>
impl<const N: usize> Sync for QuantumMLExecutor<N>
impl<const N: usize> Unpin for QuantumMLExecutor<N>
impl<const N: usize> !UnwindSafe for QuantumMLExecutor<N>
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§impl<T> Pointable for T
impl<T> Pointable for T
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self is actually part of its subset T (and can be converted to it).Source§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.