pub struct ClusterState {
pub graph: Graph,
pub state: Array1<Complex64>,
pub measurements: HashMap<usize, bool>,
}Expand description
Cluster state for MBQC
Fields§
§graph: GraphUnderlying graph structure
state: Array1<Complex64>State vector (2^n complex amplitudes)
measurements: HashMap<usize, bool>Measured qubits and their outcomes
Implementations§
Source§impl ClusterState
impl ClusterState
Sourcepub fn from_graph(graph: Graph) -> QuantRS2Result<Self>
pub fn from_graph(graph: Graph) -> QuantRS2Result<Self>
Create a cluster state from a graph
Sourcepub fn measure(
&mut self,
qubit: usize,
basis: MeasurementBasis,
) -> QuantRS2Result<bool>
pub fn measure( &mut self, qubit: usize, basis: MeasurementBasis, ) -> QuantRS2Result<bool>
Measure a qubit in a given basis
Sourcepub fn apply_corrections(
&mut self,
x_corrections: &HashMap<usize, Vec<(usize, bool)>>,
z_corrections: &HashMap<usize, Vec<(usize, bool)>>,
) -> QuantRS2Result<()>
pub fn apply_corrections( &mut self, x_corrections: &HashMap<usize, Vec<(usize, bool)>>, z_corrections: &HashMap<usize, Vec<(usize, bool)>>, ) -> QuantRS2Result<()>
Apply Pauli corrections based on measurement outcomes
Sourcepub fn get_output_state(
&self,
output_qubits: &[usize],
) -> QuantRS2Result<Array1<Complex64>>
pub fn get_output_state( &self, output_qubits: &[usize], ) -> QuantRS2Result<Array1<Complex64>>
Get the reduced state of unmeasured qubits
Auto Trait Implementations§
impl Freeze for ClusterState
impl RefUnwindSafe for ClusterState
impl Send for ClusterState
impl Sync for ClusterState
impl Unpin for ClusterState
impl UnwindSafe for ClusterState
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.