pub struct QuantumGradientCalculator { /* private fields */ }Expand description
Quantum gradient calculator
Implementations§
Source§impl QuantumGradientCalculator
impl QuantumGradientCalculator
Sourcepub fn new(
device: Arc<RwLock<dyn QuantumDevice + Send + Sync>>,
config: GradientConfig,
) -> DeviceResult<Self>
pub fn new( device: Arc<RwLock<dyn QuantumDevice + Send + Sync>>, config: GradientConfig, ) -> DeviceResult<Self>
Create a new gradient calculator
Sourcepub async fn compute_gradients(
&self,
circuit: ParameterizedQuantumCircuit,
parameters: Vec<f64>,
) -> DeviceResult<Vec<f64>>
pub async fn compute_gradients( &self, circuit: ParameterizedQuantumCircuit, parameters: Vec<f64>, ) -> DeviceResult<Vec<f64>>
Compute gradients for a parameterized quantum circuit
Sourcepub async fn compute_observable_gradients(
&self,
circuit: ParameterizedQuantumCircuit,
parameters: Vec<f64>,
observable: Observable,
) -> DeviceResult<Vec<f64>>
pub async fn compute_observable_gradients( &self, circuit: ParameterizedQuantumCircuit, parameters: Vec<f64>, observable: Observable, ) -> DeviceResult<Vec<f64>>
Compute gradients with respect to a specific observable
Auto Trait Implementations§
impl Freeze for QuantumGradientCalculator
impl !RefUnwindSafe for QuantumGradientCalculator
impl Send for QuantumGradientCalculator
impl Sync for QuantumGradientCalculator
impl Unpin for QuantumGradientCalculator
impl !UnwindSafe for QuantumGradientCalculator
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> Instrument for T
impl<T> Instrument for T
Source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
Source§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
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<T> PolicyExt for Twhere
T: ?Sized,
impl<T> PolicyExt for Twhere
T: ?Sized,
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.