pub struct QAOAOptimizer { /* private fields */ }Expand description
QAOA optimizer using classical optimization
Implementations§
Source§impl QAOAOptimizer
impl QAOAOptimizer
Sourcepub fn new(circuit: QAOACircuit, max_iterations: usize, tolerance: f64) -> Self
pub fn new(circuit: QAOACircuit, max_iterations: usize, tolerance: f64) -> Self
Create a new QAOA optimizer
Sourcepub fn execute_circuit(&mut self) -> Vec<Complex64> ⓘ
pub fn execute_circuit(&mut self) -> Vec<Complex64> ⓘ
Execute the circuit with current parameters and return the state
Sourcepub fn get_solution(&self, state: &[Complex64]) -> Vec<bool>
pub fn get_solution(&self, state: &[Complex64]) -> Vec<bool>
Get the solution from a quantum state
Auto Trait Implementations§
impl Freeze for QAOAOptimizer
impl RefUnwindSafe for QAOAOptimizer
impl Send for QAOAOptimizer
impl Sync for QAOAOptimizer
impl Unpin for QAOAOptimizer
impl UnwindSafe for QAOAOptimizer
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.