pub struct Optimization {
pub space: Space,
pub dissipation_mode: Option<Dissipation>,
pub h0_snapshots: usize,
pub omega_r_snapshots: usize,
pub algorithm: String,
pub max_iter: usize,
pub targ_fid: f64,
}Expand description
Optimiser settings.
Fields§
§space: SpaceState space.
dissipation_mode: Option<Dissipation>Whether T1/T2 relaxation is included. Absent means non-dissipative.
h0_snapshots: usizeNumber of sampled drift Hamiltonians (offsets and couplings).
omega_r_snapshots: usizeNumber of sampled Rabi frequencies.
algorithm: StringOptimiser name; see optimizer_names.
max_iter: usizeIteration limit. For derivative-free optimisers an iteration is one function evaluation.
targ_fid: f64Target fidelity; the run stops once fidelity minus penalty reaches it.
Trait Implementations§
Source§impl Clone for Optimization
impl Clone for Optimization
Source§impl Debug for Optimization
impl Debug for Optimization
Source§impl<'de> Deserialize<'de> for Optimization
impl<'de> Deserialize<'de> for Optimization
Source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
Source§impl PartialEq for Optimization
impl PartialEq for Optimization
Source§impl Serialize for Optimization
impl Serialize for Optimization
impl StructuralPartialEq for Optimization
Auto Trait Implementations§
impl Forget for Optimization
impl Freeze for Optimization
impl Move for Optimization
impl RefUnwindSafe for Optimization
impl Send for Optimization
impl Sync for Optimization
impl Unpin for Optimization
impl UnsafeUnpin for Optimization
impl UnwindSafe for Optimization
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
impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> DeserializeOwned for Twhere
T: for<'de> Deserialize<'de>,
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
impl<T> Read<Exclusive, BecauseExclusive> for Twhere
T: ?Sized,
impl<T> Scalar for T
impl<T> SendAlias 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.