pub struct QuantumAnnealer { /* private fields */ }Expand description
Quantum annealing optimizer for solving optimization problems
Implementations§
Source§impl QuantumAnnealer
impl QuantumAnnealer
Sourcepub fn new(
problem: IsingProblem,
total_time: f64,
time_step: f64,
schedule: AnnealingSchedule,
) -> Self
pub fn new( problem: IsingProblem, total_time: f64, time_step: f64, schedule: AnnealingSchedule, ) -> Self
Create a new quantum annealer
Sourcepub fn optimize(&mut self) -> QuantRS2Result<(Vec<i8>, f64)>
pub fn optimize(&mut self) -> QuantRS2Result<(Vec<i8>, f64)>
Run quantum annealing optimization
Sourcepub fn optimize_multiple_runs(
&mut self,
num_runs: usize,
) -> QuantRS2Result<(Vec<i8>, f64)>
pub fn optimize_multiple_runs( &mut self, num_runs: usize, ) -> QuantRS2Result<(Vec<i8>, f64)>
Run multiple annealing runs and return the best solution
Sourcepub fn history(&self) -> &[QuantumAnnealingSnapshot]
pub fn history(&self) -> &[QuantumAnnealingSnapshot]
Get annealing history
Sourcepub fn minimum_gap(&self) -> f64
pub fn minimum_gap(&self) -> f64
Get minimum energy gap during annealing
Sourcepub fn success_probability(&self) -> f64
pub fn success_probability(&self) -> f64
Calculate success probability (probability of finding ground state)
Auto Trait Implementations§
impl Freeze for QuantumAnnealer
impl RefUnwindSafe for QuantumAnnealer
impl Send for QuantumAnnealer
impl Sync for QuantumAnnealer
impl Unpin for QuantumAnnealer
impl UnwindSafe for QuantumAnnealer
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.