pub struct ClassicalResolution {
pub measurements: BTreeSet<InstanceMeasurement>,
pub sign: bool,
pub decoder_observables: BTreeSet<u32>,
}Expand description
What a classical node’s value is made of, under one fixed path.
measurements and the named decoder flips XORed together, then negated when
sign is set, reproduce the node’s per-shot bit.
Fields§
§measurements: BTreeSet<InstanceMeasurement>The measurement sites whose parity the node’s value is.
sign: boolThe constant the parity is XORed with: true inverts.
decoder_observables: BTreeSet<u32>Decoder-flip observables XORed into this value, in ascending order. Repeated occurrences cancel like repeated measurements.
Trait Implementations§
Source§impl Clone for ClassicalResolution
impl Clone for ClassicalResolution
Source§fn clone(&self) -> ClassicalResolution
fn clone(&self) -> ClassicalResolution
Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moreSource§impl Debug for ClassicalResolution
impl Debug for ClassicalResolution
impl Eq for ClassicalResolution
Source§impl PartialEq for ClassicalResolution
impl PartialEq for ClassicalResolution
impl StructuralPartialEq for ClassicalResolution
Auto Trait Implementations§
impl Freeze for ClassicalResolution
impl RefUnwindSafe for ClassicalResolution
impl Send for ClassicalResolution
impl Sync for ClassicalResolution
impl Unpin for ClassicalResolution
impl UnsafeUnpin for ClassicalResolution
impl UnwindSafe for ClassicalResolution
Blanket Implementations§
§impl<T, BorrowedSelf> BitwiseMutViaBorrow<BorrowedSelf> for T
impl<T, BorrowedSelf> BitwiseMutViaBorrow<BorrowedSelf> for T
fn assign_index(&mut self, index: usize, to: bool)
fn negate_index(&mut self, index: usize)
fn clear_bits(&mut self)
fn assign_random(
&mut self,
bit_count: usize,
random_number_generator: &mut impl RngExt,
)where
BorrowedSelf: BitLength,
§impl<Bits, Other, BorrowedSelf, BorrowedOther> BitwisePairMutViaBorrow<Other, BorrowedSelf, BorrowedOther> for Bits
impl<Bits, Other, BorrowedSelf, BorrowedOther> BitwisePairMutViaBorrow<Other, BorrowedSelf, BorrowedOther> for Bits
fn assign(&mut self, other: &Other)
fn bitxor_assign(&mut self, other: &Other)
fn bitand_assign(&mut self, other: &Other)
fn bitor_assign(&mut self, other: &Other)
§impl<T, Other, BorrowedSelf, BorrowedOther> BitwisePairViaBorrow<Other, BorrowedSelf, BorrowedOther> for T
impl<T, Other, BorrowedSelf, BorrowedOther> BitwisePairViaBorrow<Other, BorrowedSelf, BorrowedOther> for T
§impl<T, BorrowedSelf> BitwiseViaBorrow<BorrowedSelf> for T
impl<T, BorrowedSelf> BitwiseViaBorrow<BorrowedSelf> for T
fn index(&self, index: usize) -> bool
fn weight(&self) -> usize
fn parity(&self) -> bool
fn is_zero(&self) -> bool
fn is_unit(&self, index: usize) -> bool
fn support<'a>(&'a self) -> impl SortedIteratorwhere
BorrowedSelf: 'a,
fn max_support(&self) -> Option<usize>
fn min_support(&self) -> Option<usize>
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,
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Checks if this value is equivalent to the given key. Read more
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key and return true if they are equal.