pub struct QuantumMetricsComputer<F: Float> { /* private fields */ }Expand description
Quantum-inspired metrics computer using quantum algorithmic principles
Implementations§
Source§impl<F: Float + SimdUnifiedOps + Send + Sync + Sum> QuantumMetricsComputer<F>
impl<F: Float + SimdUnifiedOps + Send + Sync + Sum> QuantumMetricsComputer<F>
Sourcepub fn new(config: QuantumConfig) -> Result<Self>
pub fn new(config: QuantumConfig) -> Result<Self>
Create new quantum metrics computer
Sourcepub fn quantum_correlation(
&mut self,
x: &ArrayView1<'_, F>,
y: &ArrayView1<'_, F>,
) -> Result<F>
pub fn quantum_correlation( &mut self, x: &ArrayView1<'_, F>, y: &ArrayView1<'_, F>, ) -> Result<F>
Quantum-accelerated correlation computation using entanglement
Sourcepub fn quantum_eigenvalues(
&mut self,
matrix: &ArrayView2<'_, F>,
) -> Result<Vec<F>>
pub fn quantum_eigenvalues( &mut self, matrix: &ArrayView2<'_, F>, ) -> Result<Vec<F>>
Quantum-accelerated eigenvalue computation for covariance matrices
Sourcepub fn qaoa_optimize(
&mut self,
objective_function: &dyn Fn(&[F]) -> F,
numvariables: usize,
) -> Result<Vec<F>>
pub fn qaoa_optimize( &mut self, objective_function: &dyn Fn(&[F]) -> F, numvariables: usize, ) -> Result<Vec<F>>
Quantum Approximate Optimization Algorithm (QAOA) for metric optimization
Sourcepub fn adiabatic_optimization(
&mut self,
hamiltonian: &Array2<Complex<f64>>,
target_hamiltonian: &Array2<Complex<f64>>,
) -> Result<Vec<F>>
pub fn adiabatic_optimization( &mut self, hamiltonian: &Array2<Complex<f64>>, target_hamiltonian: &Array2<Complex<f64>>, ) -> Result<Vec<F>>
Adiabatic quantum computation for optimization problems
Sourcepub fn quantum_ml_enhanced_metrics(
&mut self,
data: &ArrayView2<'_, F>,
metric_type: &str,
) -> Result<F>
pub fn quantum_ml_enhanced_metrics( &mut self, data: &ArrayView2<'_, F>, metric_type: &str, ) -> Result<F>
Quantum machine learning-enhanced metrics computation
Sourcepub fn benchmark_quantum_advantage(
&mut self,
data_sizes: &[usize],
iterations: usize,
) -> Result<QuantumBenchmarkResults>
pub fn benchmark_quantum_advantage( &mut self, data_sizes: &[usize], iterations: usize, ) -> Result<QuantumBenchmarkResults>
Benchmark quantum vs classical performance
Trait Implementations§
Source§impl<F: Clone + Float> Clone for QuantumMetricsComputer<F>
impl<F: Clone + Float> Clone for QuantumMetricsComputer<F>
Source§fn clone(&self) -> QuantumMetricsComputer<F>
fn clone(&self) -> QuantumMetricsComputer<F>
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<F> Freeze for QuantumMetricsComputer<F>
impl<F> RefUnwindSafe for QuantumMetricsComputer<F>where
F: RefUnwindSafe,
impl<F> Send for QuantumMetricsComputer<F>where
F: Send,
impl<F> Sync for QuantumMetricsComputer<F>where
F: Sync,
impl<F> Unpin for QuantumMetricsComputer<F>where
F: Unpin,
impl<F> UnwindSafe for QuantumMetricsComputer<F>where
F: UnwindSafe,
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.