pub struct OptimizedStateVector { /* private fields */ }
Expand description
Represents a quantum state vector that can be efficiently operated on
Implementations§
Source§impl OptimizedStateVector
impl OptimizedStateVector
Sourcepub fn new(num_qubits: usize) -> Self
pub fn new(num_qubits: usize) -> Self
Create a new optimized state vector for given number of qubits
Sourcepub fn num_qubits(&self) -> usize
pub fn num_qubits(&self) -> usize
Get the number of qubits
Sourcepub fn apply_single_qubit_gate(&mut self, matrix: &[Complex64], target: usize)
pub fn apply_single_qubit_gate(&mut self, matrix: &[Complex64], target: usize)
Apply a single-qubit gate to the state vector
§Arguments
matrix
- The 2x2 matrix representation of the gatetarget
- The target qubit index
Sourcepub fn apply_cnot(&mut self, control: usize, target: usize)
pub fn apply_cnot(&mut self, control: usize, target: usize)
Apply a controlled-NOT gate to the state vector
§Arguments
control
- The control qubit indextarget
- The target qubit index
Sourcepub fn apply_two_qubit_gate(
&mut self,
matrix: &[Complex64],
qubit1: usize,
qubit2: usize,
)
pub fn apply_two_qubit_gate( &mut self, matrix: &[Complex64], qubit1: usize, qubit2: usize, )
Apply a two-qubit gate to the state vector
§Arguments
matrix
- The 4x4 matrix representation of the gatequbit1
- The first qubit indexqubit2
- The second qubit index
Sourcepub fn probability(&self, bit_string: &[u8]) -> f64
pub fn probability(&self, bit_string: &[u8]) -> f64
Calculate probability of measuring a specific bit string
Sourcepub fn probabilities(&self) -> Vec<f64>
pub fn probabilities(&self) -> Vec<f64>
Calculate probabilities for all basis states
Auto Trait Implementations§
impl Freeze for OptimizedStateVector
impl RefUnwindSafe for OptimizedStateVector
impl Send for OptimizedStateVector
impl Sync for OptimizedStateVector
impl Unpin for OptimizedStateVector
impl UnwindSafe for OptimizedStateVector
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.