pub struct CacheOptimizedStateVector { /* private fields */ }Expand description
Cache-optimized state vector with advanced layout management
Implementations§
Source§impl CacheOptimizedStateVector
impl CacheOptimizedStateVector
Sourcepub fn new(
num_qubits: usize,
layout: CacheOptimizedLayout,
cache_config: CacheHierarchyConfig,
memory_config: MemoryOptimizationConfig,
) -> Result<Self>
pub fn new( num_qubits: usize, layout: CacheOptimizedLayout, cache_config: CacheHierarchyConfig, memory_config: MemoryOptimizationConfig, ) -> Result<Self>
Create a new cache-optimized state vector
Sourcepub fn apply_single_qubit_gate_cache_optimized(
&mut self,
target: usize,
gate_matrix: &Array2<Complex64>,
) -> Result<()>
pub fn apply_single_qubit_gate_cache_optimized( &mut self, target: usize, gate_matrix: &Array2<Complex64>, ) -> Result<()>
Apply single-qubit gate with cache-optimized access pattern
Sourcepub fn get_cache_stats(&self) -> Result<CachePerformanceStats>
pub fn get_cache_stats(&self) -> Result<CachePerformanceStats>
Get cache performance statistics
Sourcepub fn adapt_cache_layout(&mut self) -> Result<CacheLayoutAdaptationResult>
pub fn adapt_cache_layout(&mut self) -> Result<CacheLayoutAdaptationResult>
Adapt layout based on access patterns
Sourcepub fn layout(&self) -> CacheOptimizedLayout
pub fn layout(&self) -> CacheOptimizedLayout
Get the current layout
Sourcepub fn num_qubits(&self) -> usize
pub fn num_qubits(&self) -> usize
Get the number of qubits
Trait Implementations§
Auto Trait Implementations§
impl Freeze for CacheOptimizedStateVector
impl RefUnwindSafe for CacheOptimizedStateVector
impl Send for CacheOptimizedStateVector
impl Sync for CacheOptimizedStateVector
impl Unpin for CacheOptimizedStateVector
impl UnwindSafe for CacheOptimizedStateVector
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.