pub struct QuantumCellularAutomaton2D {
pub width: usize,
pub height: usize,
pub state: Array3<Complex64>,
pub time_step: usize,
/* private fields */
}Expand description
2D Quantum cellular automaton
Fields§
§width: usizeWidth of the lattice
height: usizeHeight of the lattice
state: Array3<Complex64>Current state (width × height × 2 for qubit amplitudes)
time_step: usizeCurrent time step
Implementations§
Source§impl QuantumCellularAutomaton2D
impl QuantumCellularAutomaton2D
Sourcepub fn new(
width: usize,
height: usize,
rule: Box<dyn QCARule + Send + Sync>,
boundary: BoundaryCondition,
qca_type: QCAType,
) -> Self
pub fn new( width: usize, height: usize, rule: Box<dyn QCARule + Send + Sync>, boundary: BoundaryCondition, qca_type: QCAType, ) -> Self
Create a new 2D quantum cellular automaton
Sourcepub fn set_site_state(
&mut self,
x: usize,
y: usize,
amplitudes: [Complex64; 2],
) -> QuantRS2Result<()>
pub fn set_site_state( &mut self, x: usize, y: usize, amplitudes: [Complex64; 2], ) -> QuantRS2Result<()>
Set the state of a specific site
Sourcepub fn get_site_state(
&self,
x: usize,
y: usize,
) -> QuantRS2Result<[Complex64; 2]>
pub fn get_site_state( &self, x: usize, y: usize, ) -> QuantRS2Result<[Complex64; 2]>
Get the state of a specific site
Sourcepub fn step(&mut self) -> QuantRS2Result<()>
pub fn step(&mut self) -> QuantRS2Result<()>
Perform one evolution step
Sourcepub fn probability_distribution(&self) -> Array3<f64>
pub fn probability_distribution(&self) -> Array3<f64>
Get total probability distribution across the lattice
Sourcepub fn magnetization(&self) -> f64
pub fn magnetization(&self) -> f64
Calculate magnetization of the lattice
Trait Implementations§
Auto Trait Implementations§
impl Freeze for QuantumCellularAutomaton2D
impl !RefUnwindSafe for QuantumCellularAutomaton2D
impl Send for QuantumCellularAutomaton2D
impl Sync for QuantumCellularAutomaton2D
impl Unpin for QuantumCellularAutomaton2D
impl !UnwindSafe for QuantumCellularAutomaton2D
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.