pub struct SimdGateEngine { /* private fields */ }Expand description
Enhanced SIMD gate operations with hardware-adaptive dispatch
Implementations§
Source§impl SimdGateEngine
impl SimdGateEngine
Sourcepub fn capabilities(&self) -> &PlatformCapabilities
pub fn capabilities(&self) -> &PlatformCapabilities
Get the platform capabilities
Sourcepub fn simd_width(&self) -> usize
pub fn simd_width(&self) -> usize
Get the optimal SIMD width
Sourcepub fn apply_rotation_gate(
&self,
amplitudes: &mut [Complex64],
qubit: usize,
axis: RotationAxis,
angle: f64,
) -> QuantRS2Result<()>
pub fn apply_rotation_gate( &self, amplitudes: &mut [Complex64], qubit: usize, axis: RotationAxis, angle: f64, ) -> QuantRS2Result<()>
Apply a rotation gate (RX, RY, RZ) with SIMD optimization
This applies rotation matrices to pairs of amplitudes efficiently.
Sourcepub fn apply_cnot(
&self,
amplitudes: &mut [Complex64],
control: usize,
target: usize,
) -> QuantRS2Result<()>
pub fn apply_cnot( &self, amplitudes: &mut [Complex64], control: usize, target: usize, ) -> QuantRS2Result<()>
Apply CNOT gate with SIMD optimization
Sourcepub fn batch_apply_single_qubit(
&self,
amplitudes: &mut [Complex64],
gates: &[(usize, RotationAxis, f64)],
) -> QuantRS2Result<()>
pub fn batch_apply_single_qubit( &self, amplitudes: &mut [Complex64], gates: &[(usize, RotationAxis, f64)], ) -> QuantRS2Result<()>
Batch apply multiple single-qubit gates
This is more efficient than applying gates one by one when multiple gates need to be applied to different qubits.
Trait Implementations§
Auto Trait Implementations§
impl Freeze for SimdGateEngine
impl RefUnwindSafe for SimdGateEngine
impl Send for SimdGateEngine
impl Sync for SimdGateEngine
impl Unpin for SimdGateEngine
impl UnwindSafe for SimdGateEngine
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.