pub struct AdiabaticQuantumComputer { /* private fields */ }Expand description
Adiabatic quantum computer simulator
Implementations§
Source§impl AdiabaticQuantumComputer
impl AdiabaticQuantumComputer
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 adiabatic quantum computer
Sourcepub fn current_hamiltonian(&self) -> Array2<Complex64>
pub fn current_hamiltonian(&self) -> Array2<Complex64>
Get the current Hamiltonian H(t) = (1-s(t))H_0 + s(t)H_P
Sourcepub fn step(&mut self) -> QuantRS2Result<()>
pub fn step(&mut self) -> QuantRS2Result<()>
Perform one time step of adiabatic evolution
Sourcepub fn run(&mut self) -> QuantRS2Result<()>
pub fn run(&mut self) -> QuantRS2Result<()>
Run the complete adiabatic evolution
Sourcepub fn measurement_probabilities(&self) -> Vec<f64>
pub fn measurement_probabilities(&self) -> Vec<f64>
Get measurement probabilities in computational basis
Sourcepub fn energy_gap(&self) -> QuantRS2Result<f64>
pub fn energy_gap(&self) -> QuantRS2Result<f64>
Get the instantaneous energy gap
Sourcepub fn adiabatic_condition_satisfied(&self) -> QuantRS2Result<bool>
pub fn adiabatic_condition_satisfied(&self) -> QuantRS2Result<bool>
Check if adiabatic condition is satisfied
Sourcepub fn annealing_parameter(&self) -> f64
pub fn annealing_parameter(&self) -> f64
Get current annealing parameter s(t)
Auto Trait Implementations§
impl Freeze for AdiabaticQuantumComputer
impl RefUnwindSafe for AdiabaticQuantumComputer
impl Send for AdiabaticQuantumComputer
impl Sync for AdiabaticQuantumComputer
impl Unpin for AdiabaticQuantumComputer
impl UnwindSafe for AdiabaticQuantumComputer
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.