pub struct VqeOptimizer {
pub hamiltonian: PauliHamiltonian,
pub ansatz: HardwareEfficientAnsatz,
pub init_params: Vec<f64>,
pub max_iter: usize,
pub tol: f64,
pub learning_rate: f64,
}Expand description
VQE optimizer: minimizes ⟨ψ(θ)|H|ψ(θ)⟩ over ansatz parameters θ.
Fields§
§hamiltonian: PauliHamiltonianThe Hamiltonian to minimize
ansatz: HardwareEfficientAnsatzThe variational ansatz
init_params: Vec<f64>Initial parameters
max_iter: usizeMaximum gradient-descent iterations
tol: f64Convergence tolerance
learning_rate: f64Learning rate for gradient descent
Implementations§
Source§impl VqeOptimizer
impl VqeOptimizer
Sourcepub fn new(
hamiltonian: PauliHamiltonian,
ansatz: HardwareEfficientAnsatz,
init_params: Vec<f64>,
) -> Self
pub fn new( hamiltonian: PauliHamiltonian, ansatz: HardwareEfficientAnsatz, init_params: Vec<f64>, ) -> Self
Create a new VQE optimizer.
Sourcepub fn energy(&self, params: &[f64]) -> QcResult<f64>
pub fn energy(&self, params: &[f64]) -> QcResult<f64>
Evaluate the energy ⟨H⟩ at the given parameters.
Trait Implementations§
Source§impl Clone for VqeOptimizer
impl Clone for VqeOptimizer
Source§fn clone(&self) -> VqeOptimizer
fn clone(&self) -> VqeOptimizer
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 VqeOptimizer
impl RefUnwindSafe for VqeOptimizer
impl Send for VqeOptimizer
impl Sync for VqeOptimizer
impl Unpin for VqeOptimizer
impl UnsafeUnpin for VqeOptimizer
impl UnwindSafe for VqeOptimizer
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.