pub struct ConstrainedVariationalOptimizer { /* private fields */ }Expand description
Constrained optimization for variational circuits
Implementations§
Source§impl ConstrainedVariationalOptimizer
impl ConstrainedVariationalOptimizer
Sourcepub fn new(base_optimizer: VariationalQuantumOptimizer) -> Self
pub fn new(base_optimizer: VariationalQuantumOptimizer) -> Self
Create a new constrained optimizer
Sourcepub fn add_equality_constraint(
&mut self,
constraint_fn: impl Fn(&FxHashMap<String, f64>) -> f64 + Send + Sync + 'static,
value: f64,
)
pub fn add_equality_constraint( &mut self, constraint_fn: impl Fn(&FxHashMap<String, f64>) -> f64 + Send + Sync + 'static, value: f64, )
Add an equality constraint
Sourcepub fn add_inequality_constraint(
&mut self,
constraint_fn: impl Fn(&FxHashMap<String, f64>) -> f64 + Send + Sync + 'static,
value: f64,
)
pub fn add_inequality_constraint( &mut self, constraint_fn: impl Fn(&FxHashMap<String, f64>) -> f64 + Send + Sync + 'static, value: f64, )
Add an inequality constraint
Sourcepub fn optimize(
&mut self,
circuit: &mut VariationalCircuit,
cost_fn: impl Fn(&VariationalCircuit) -> QuantRS2Result<f64> + Send + Sync + 'static,
) -> QuantRS2Result<OptimizationResult>
pub fn optimize( &mut self, circuit: &mut VariationalCircuit, cost_fn: impl Fn(&VariationalCircuit) -> QuantRS2Result<f64> + Send + Sync + 'static, ) -> QuantRS2Result<OptimizationResult>
Optimize with constraints
Auto Trait Implementations§
impl Freeze for ConstrainedVariationalOptimizer
impl !RefUnwindSafe for ConstrainedVariationalOptimizer
impl Send for ConstrainedVariationalOptimizer
impl Sync for ConstrainedVariationalOptimizer
impl Unpin for ConstrainedVariationalOptimizer
impl !UnwindSafe for ConstrainedVariationalOptimizer
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.