pub struct QuantumVectorSearch { /* private fields */ }Expand description
Quantum-inspired vector search algorithm
Implementations§
Source§impl QuantumVectorSearch
impl QuantumVectorSearch
Sourcepub fn new(config: QuantumSearchConfig) -> Self
pub fn new(config: QuantumSearchConfig) -> Self
Create a new quantum vector search instance
Sourcepub fn with_default_config() -> Self
pub fn with_default_config() -> Self
Create with default configuration
Sourcepub fn with_seed(config: QuantumSearchConfig, seed: u64) -> Self
pub fn with_seed(config: QuantumSearchConfig, seed: u64) -> Self
Create with seeded random number generator for reproducible results
Sourcepub async fn quantum_similarity_search(
&self,
query_vector: &Vector,
candidate_vectors: &[(String, Vector)],
k: usize,
) -> Result<Vec<QuantumSearchResult>>
pub async fn quantum_similarity_search( &self, query_vector: &Vector, candidate_vectors: &[(String, Vector)], k: usize, ) -> Result<Vec<QuantumSearchResult>>
Perform quantum-inspired similarity search
Sourcepub async fn parallel_quantum_similarity_search(
&self,
query_vector: &Vector,
candidate_vectors: &[(String, Vector)],
k: usize,
) -> Result<Vec<QuantumSearchResult>>
pub async fn parallel_quantum_similarity_search( &self, query_vector: &Vector, candidate_vectors: &[(String, Vector)], k: usize, ) -> Result<Vec<QuantumSearchResult>>
Parallel quantum-inspired similarity search for improved performance
Sourcepub fn quantum_amplitude_amplification(
&self,
target_similarity: f32,
quantum_state: &mut QuantumState,
iterations: usize,
) -> Result<()>
pub fn quantum_amplitude_amplification( &self, target_similarity: f32, quantum_state: &mut QuantumState, iterations: usize, ) -> Result<()>
Perform quantum amplitude amplification for targeted search
Sourcepub fn quantum_annealing_optimization(
&self,
cost_function: impl Fn(&[f32]) -> f32,
initial_state: &[f32],
temperature_schedule: &[f32],
) -> Result<Vec<f32>>
pub fn quantum_annealing_optimization( &self, cost_function: impl Fn(&[f32]) -> f32, initial_state: &[f32], temperature_schedule: &[f32], ) -> Result<Vec<f32>>
Quantum annealing for optimization landscape exploration
Sourcepub fn get_quantum_statistics(&self) -> QuantumSearchStatistics
pub fn get_quantum_statistics(&self) -> QuantumSearchStatistics
Get quantum search statistics
Trait Implementations§
Auto Trait Implementations§
impl Freeze for QuantumVectorSearch
impl RefUnwindSafe for QuantumVectorSearch
impl Send for QuantumVectorSearch
impl Sync for QuantumVectorSearch
impl Unpin for QuantumVectorSearch
impl UnwindSafe for QuantumVectorSearch
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> Instrument for T
impl<T> Instrument for T
Source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
Source§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
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<T> PolicyExt for Twhere
T: ?Sized,
impl<T> PolicyExt for Twhere
T: ?Sized,
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.