pub struct EfficientStateVector { /* private fields */ }
Expand description
A memory-efficient storage for large quantum state vectors
This provides memory-efficient storage and operations for quantum states, with support for chunk-based processing of large state vectors.
Implementations§
Source§impl EfficientStateVector
impl EfficientStateVector
Sourcepub fn new(num_qubits: usize) -> QuantRS2Result<Self>
pub fn new(num_qubits: usize) -> QuantRS2Result<Self>
Create a new efficient state vector for the given number of qubits
Sourcepub fn num_qubits(&self) -> usize
pub fn num_qubits(&self) -> usize
Get the number of qubits
Sourcepub fn normalize(&mut self) -> QuantRS2Result<()>
pub fn normalize(&mut self) -> QuantRS2Result<()>
Normalize the state vector
Sourcepub fn get_probability(&self, basis_state: usize) -> QuantRS2Result<f64>
pub fn get_probability(&self, basis_state: usize) -> QuantRS2Result<f64>
Calculate the probability of measuring a specific basis state
Sourcepub fn process_chunks<F>(
&mut self,
chunk_size: usize,
f: F,
) -> QuantRS2Result<()>
pub fn process_chunks<F>( &mut self, chunk_size: usize, f: F, ) -> QuantRS2Result<()>
Apply a function to chunks of the state vector
This is useful for operations that can be parallelized or when working with states too large to fit in cache.
Source§impl EfficientStateVector
impl EfficientStateVector
Sourcepub fn memory_stats(&self) -> StateMemoryStats
pub fn memory_stats(&self) -> StateMemoryStats
Get memory usage statistics
Auto Trait Implementations§
impl Freeze for EfficientStateVector
impl RefUnwindSafe for EfficientStateVector
impl Send for EfficientStateVector
impl Sync for EfficientStateVector
impl Unpin for EfficientStateVector
impl UnwindSafe for EfficientStateVector
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.