pub struct ToricCode {
pub rows: usize,
pub cols: usize,
pub qubit_map: HashMap<(usize, usize), usize>,
}Expand description
Toric code (generalization of surface code on torus)
Fields§
§rows: usizeNumber of rows in the torus
cols: usizeNumber of columns in the torus
qubit_map: HashMap<(usize, usize), usize>Qubit mapping
Implementations§
Source§impl ToricCode
impl ToricCode
Sourcepub fn logical_qubits(&self) -> usize
pub fn logical_qubits(&self) -> usize
Get number of logical qubits
Sourcepub fn to_stabilizer_code(&self) -> StabilizerCode
pub fn to_stabilizer_code(&self) -> StabilizerCode
Convert to stabilizer code representation
Trait Implementations§
Auto Trait Implementations§
impl Freeze for ToricCode
impl RefUnwindSafe for ToricCode
impl Send for ToricCode
impl Sync for ToricCode
impl Unpin for ToricCode
impl UnwindSafe for ToricCode
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> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
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.