pub struct DiscreteQuantumWalk { /* private fields */ }Expand description
Discrete-time quantum walk
Implementations§
Source§impl DiscreteQuantumWalk
impl DiscreteQuantumWalk
Sourcepub fn new(graph: Graph, coin_operator: CoinOperator) -> Self
pub fn new(graph: Graph, coin_operator: CoinOperator) -> Self
Create a new discrete quantum walk with specified coin operator
Sourcepub fn initialize_position(&mut self, position: usize)
pub fn initialize_position(&mut self, position: usize)
Initialize walker at a specific position
Sourcepub fn position_probabilities(&self) -> Vec<f64>
pub fn position_probabilities(&self) -> Vec<f64>
Get position probabilities
Auto Trait Implementations§
impl Freeze for DiscreteQuantumWalk
impl RefUnwindSafe for DiscreteQuantumWalk
impl Send for DiscreteQuantumWalk
impl Sync for DiscreteQuantumWalk
impl Unpin for DiscreteQuantumWalk
impl UnwindSafe for DiscreteQuantumWalk
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.