pub struct QuantumCellularAutomaton1D {
pub num_sites: usize,
pub state: Array2<Complex64>,
pub time_step: usize,
/* private fields */
}
Expand description
Quantum cellular automaton on a 1D lattice
Fields§
§num_sites: usize
Number of sites in the lattice
state: Array2<Complex64>
Current state of each site (amplitude for |0⟩ and |1⟩)
time_step: usize
Current time step
Implementations§
Source§impl QuantumCellularAutomaton1D
impl QuantumCellularAutomaton1D
Sourcepub fn new(
num_sites: usize,
rule: Box<dyn QCARule + Send + Sync>,
boundary: BoundaryCondition,
qca_type: QCAType,
) -> Self
pub fn new( num_sites: usize, rule: Box<dyn QCARule + Send + Sync>, boundary: BoundaryCondition, qca_type: QCAType, ) -> Self
Create a new 1D quantum cellular automaton
Sourcepub fn set_site_state(
&mut self,
site: usize,
amplitudes: [Complex64; 2],
) -> QuantRS2Result<()>
pub fn set_site_state( &mut self, site: usize, amplitudes: [Complex64; 2], ) -> QuantRS2Result<()>
Set the state of a specific site
Sourcepub fn get_site_state(&self, site: usize) -> QuantRS2Result<[Complex64; 2]>
pub fn get_site_state(&self, site: usize) -> QuantRS2Result<[Complex64; 2]>
Get the state of a specific site
Sourcepub fn initialize_random(&mut self, rng: &mut dyn RngCore) -> QuantRS2Result<()>
pub fn initialize_random(&mut self, rng: &mut dyn RngCore) -> QuantRS2Result<()>
Initialize with a random state
Sourcepub fn step(&mut self) -> QuantRS2Result<()>
pub fn step(&mut self) -> QuantRS2Result<()>
Perform one evolution step
Sourcepub fn entanglement_entropy(
&self,
region_start: usize,
region_size: usize,
) -> QuantRS2Result<f64>
pub fn entanglement_entropy( &self, region_start: usize, region_size: usize, ) -> QuantRS2Result<f64>
Calculate the entanglement entropy of a region
Sourcepub fn site_probabilities(&self) -> Vec<[f64; 2]>
pub fn site_probabilities(&self) -> Vec<[f64; 2]>
Get probability distribution at each site
Sourcepub fn correlation(
&self,
site1: usize,
site2: usize,
) -> QuantRS2Result<Complex64>
pub fn correlation( &self, site1: usize, site2: usize, ) -> QuantRS2Result<Complex64>
Compute correlation function between two sites
Trait Implementations§
Auto Trait Implementations§
impl Freeze for QuantumCellularAutomaton1D
impl !RefUnwindSafe for QuantumCellularAutomaton1D
impl Send for QuantumCellularAutomaton1D
impl Sync for QuantumCellularAutomaton1D
impl Unpin for QuantumCellularAutomaton1D
impl !UnwindSafe for QuantumCellularAutomaton1D
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.