pub struct VQAResult {
pub optimal_parameters: Vec<f64>,
pub optimal_cost: f64,
pub cost_history: Vec<f64>,
pub parameter_history: Vec<Vec<f64>>,
pub gradient_norms: Vec<f64>,
pub iterations: usize,
pub optimization_time: Duration,
pub converged: bool,
pub final_state: Option<Array1<Complex64>>,
pub expectation_values: HashMap<String, f64>,
}
Expand description
VQA optimization result
Fields§
§optimal_parameters: Vec<f64>
Optimal parameters found
optimal_cost: f64
Final cost function value
cost_history: Vec<f64>
Optimization history
parameter_history: Vec<Vec<f64>>
Parameter history
gradient_norms: Vec<f64>
Gradient norms history
iterations: usize
Number of iterations performed
optimization_time: Duration
Total optimization time
converged: bool
Convergence information
final_state: Option<Array1<Complex64>>
Final quantum state
expectation_values: HashMap<String, f64>
Expectation values of observables
Trait Implementations§
Source§impl<'de> Deserialize<'de> for VQAResult
impl<'de> Deserialize<'de> for VQAResult
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
Auto Trait Implementations§
impl Freeze for VQAResult
impl RefUnwindSafe for VQAResult
impl Send for VQAResult
impl Sync for VQAResult
impl Unpin for VQAResult
impl UnwindSafe for VQAResult
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.