pub struct AdiabaticConfig {
pub total_time: f64,
pub time_steps: usize,
pub schedule_type: ScheduleType,
pub initial_hamiltonian: Hamiltonian,
pub final_hamiltonian: Hamiltonian,
pub gap_tracking: GapTrackingConfig,
pub energy_tolerance: f64,
pub max_iterations: usize,
pub adaptive_stepping: bool,
pub monitor_diabatic_transitions: bool,
}
Expand description
Adiabatic quantum computing configuration
Fields§
§total_time: f64
Total evolution time
time_steps: usize
Number of time steps
schedule_type: ScheduleType
Adiabatic schedule function type
initial_hamiltonian: Hamiltonian
Initial Hamiltonian
final_hamiltonian: Hamiltonian
Final Hamiltonian (problem Hamiltonian)
gap_tracking: GapTrackingConfig
Gap tracking configuration
energy_tolerance: f64
Energy convergence tolerance
max_iterations: usize
Maximum iterations for eigenvalue solving
adaptive_stepping: bool
Enable adaptive time stepping
monitor_diabatic_transitions: bool
Diabatic transition monitoring
Trait Implementations§
Source§impl Clone for AdiabaticConfig
impl Clone for AdiabaticConfig
Source§fn clone(&self) -> AdiabaticConfig
fn clone(&self) -> AdiabaticConfig
Returns a duplicate of the value. Read more
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source
. Read moreSource§impl Debug for AdiabaticConfig
impl Debug for AdiabaticConfig
Auto Trait Implementations§
impl Freeze for AdiabaticConfig
impl RefUnwindSafe for AdiabaticConfig
impl Send for AdiabaticConfig
impl Sync for AdiabaticConfig
impl Unpin for AdiabaticConfig
impl UnwindSafe for AdiabaticConfig
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> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
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.