pub struct QuantumInspiredUtils;Expand description
Utility functions for quantum-inspired algorithms
Implementations§
Source§impl QuantumInspiredUtils
impl QuantumInspiredUtils
Sourcepub fn generate_optimization_problem(
problem_type: ObjectiveFunction,
dimension: usize,
bounds: (f64, f64),
) -> (ObjectiveFunction, Vec<(f64, f64)>, Array1<f64>)
pub fn generate_optimization_problem( problem_type: ObjectiveFunction, dimension: usize, bounds: (f64, f64), ) -> (ObjectiveFunction, Vec<(f64, f64)>, Array1<f64>)
Generate synthetic optimization problems
Sourcepub fn analyze_convergence(convergence_history: &[f64]) -> ConvergenceAnalysis
pub fn analyze_convergence(convergence_history: &[f64]) -> ConvergenceAnalysis
Analyze convergence behavior
Sourcepub fn compare_algorithms(
results1: &[OptimizationResult],
results2: &[OptimizationResult],
) -> ComparisonStats
pub fn compare_algorithms( results1: &[OptimizationResult], results2: &[OptimizationResult], ) -> ComparisonStats
Compare algorithm performances
Sourcepub fn estimate_quantum_advantage(
problem_size: usize,
algorithm_type: OptimizationAlgorithm,
) -> QuantumAdvantageMetrics
pub fn estimate_quantum_advantage( problem_size: usize, algorithm_type: OptimizationAlgorithm, ) -> QuantumAdvantageMetrics
Estimate quantum advantage
Auto Trait Implementations§
impl Freeze for QuantumInspiredUtils
impl RefUnwindSafe for QuantumInspiredUtils
impl Send for QuantumInspiredUtils
impl Sync for QuantumInspiredUtils
impl Unpin for QuantumInspiredUtils
impl UnwindSafe for QuantumInspiredUtils
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> 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.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.