pub struct GrapeOptimizer {
pub control_hamiltonians: Vec<Array2<Complex64>>,
pub drift_hamiltonian: Array2<Complex64>,
pub target_unitary: Array2<Complex64>,
pub pulse_amplitudes: Array2<f64>,
pub time_steps: usize,
pub total_time: f64,
pub convergence_threshold: f64,
}Expand description
GRAPE (Gradient Ascent Pulse Engineering) integration
Fields§
§control_hamiltonians: Vec<Array2<Complex64>>§drift_hamiltonian: Array2<Complex64>§target_unitary: Array2<Complex64>§pulse_amplitudes: Array2<f64>§time_steps: usize§total_time: f64§convergence_threshold: f64Implementations§
Source§impl GrapeOptimizer
impl GrapeOptimizer
Sourcepub fn new(
control_hamiltonians: Vec<Array2<Complex64>>,
drift_hamiltonian: Array2<Complex64>,
target_unitary: Array2<Complex64>,
time_steps: usize,
total_time: f64,
) -> Self
pub fn new( control_hamiltonians: Vec<Array2<Complex64>>, drift_hamiltonian: Array2<Complex64>, target_unitary: Array2<Complex64>, time_steps: usize, total_time: f64, ) -> Self
Create a new GRAPE optimizer
Sourcepub fn optimize(
&mut self,
max_iterations: usize,
learning_rate: f64,
) -> Result<GrapeResult, QuantRS2Error>
pub fn optimize( &mut self, max_iterations: usize, learning_rate: f64, ) -> Result<GrapeResult, QuantRS2Error>
Optimize control pulses using GRAPE algorithm
Trait Implementations§
Source§impl Clone for GrapeOptimizer
impl Clone for GrapeOptimizer
Source§fn clone(&self) -> GrapeOptimizer
fn clone(&self) -> GrapeOptimizer
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 moreAuto Trait Implementations§
impl Freeze for GrapeOptimizer
impl RefUnwindSafe for GrapeOptimizer
impl Send for GrapeOptimizer
impl Sync for GrapeOptimizer
impl Unpin for GrapeOptimizer
impl UnwindSafe for GrapeOptimizer
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.