Skip to main content

Gate1Q

Enum Gate1Q 

pub enum Gate1Q {
Show 23 variants X, Y, Z, H, S, SDag, SqrtX, SqrtXDag, SqrtY, SqrtYDag, Hxy, Hyz, Hnxy, Hnxz, Hnyz, Cxyz, Czyx, Cnxyz, Cxnyz, Cxynz, Cnzyx, Cznyx, Czynx,
}
Expand description

A named single-qubit Clifford, identified by the signed Pauli images (X → …, Z → …) of Gate1Q::images.

The names and the tableaux are stim’s. Variants that stim spells with underscores and negation markers (H_XY, C_NZYX) are spelled here in camel case with the same letters in the same order (Hxy, Cnzyx).

Variants§

§

X

X → +X, Z → −Z.

§

Y

X → −X, Z → −Z.

§

Z

X → −X, Z → +Z.

§

H

Hadamard: X → +Z, Z → +X.

§

S

Phase gate S = √Z: X → +Y, Z → +Z.

§

SDag

S† = √Z†: X → −Y, Z → +Z.

§

SqrtX

√X: X → +X, Z → −Y.

§

SqrtXDag

√X†: X → +X, Z → +Y.

§

SqrtY

√Y: X → −Z, Z → +X.

§

SqrtYDag

√Y†: X → +Z, Z → −X.

§

Hxy

H_XY: X → +Y, Z → −Z.

§

Hyz

H_YZ: X → −X, Z → +Y.

§

Hnxy

H_NXY: X → −Y, Z → −Z.

§

Hnxz

H_NXZ: X → −Z, Z → −X.

§

Hnyz

H_NYZ: X → −X, Z → −Y.

§

Cxyz

C_XYZ, the order-three cycle X → Y → Z → X.

§

Czyx

C_ZYX, the inverse cycle X → Z → Y → X.

§

Cnxyz

C_NXYZ: X → −Y, Z → −X.

§

Cxnyz

C_XNYZ: X → −Y, Z → +X.

§

Cxynz

C_XYNZ: X → +Y, Z → −X.

§

Cnzyx

C_NZYX: X → −Z, Z → −Y.

§

Cznyx

C_ZNYX: X → +Z, Z → −Y.

§

Czynx

C_ZYNX: X → −Z, Z → +Y.

Implementations§

§

impl Gate1Q

pub const fn images(self) -> ((PauliBasis, bool), (PauliBasis, bool))

The gate’s signed Pauli tableau as (X → image, Z → image), each image an axis and whether it is negated.

This is the gate’s definition: TableauSimulator::gate1 realizes each variant as a composition of primitive frame updates, and the pairing of composition to tableau is what the unit tests pin.

§Examples
use ticit::PauliBasis;
use ticit::Gate1Q;

// The Hadamard exchanges X and Z without a sign.
assert_eq!(
    Gate1Q::H.images(),
    ((PauliBasis::Z, false), (PauliBasis::X, false))
);

Trait Implementations§

§

impl Clone for Gate1Q

§

fn clone(&self) -> Gate1Q

Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source. Read more
§

impl Copy for Gate1Q

§

impl Debug for Gate1Q

§

fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>

Formats the value using the given formatter. Read more
§

impl Eq for Gate1Q

§

impl Hash for Gate1Q

§

fn hash<__H>(&self, state: &mut __H)
where __H: Hasher,

Feeds this value into the given Hasher. Read more
1.3.0 · Source§

fn hash_slice<H>(data: &[Self], state: &mut H)
where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher. Read more
§

impl PartialEq for Gate1Q

§

fn eq(&self, other: &Gate1Q) -> bool

Equality operator ==. Read more
1.0.0 (const: unstable) · Source§

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=. Read more
§

impl StructuralPartialEq for Gate1Q

Auto Trait Implementations§

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
§

impl<T, BorrowedSelf> BitwiseMutViaBorrow<BorrowedSelf> for T
where T: BorrowMut<BorrowedSelf>, BorrowedSelf: BitwiseMut + ?Sized,

§

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
where Bits: BorrowMut<BorrowedSelf> + ?Sized, Other: Borrow<BorrowedOther> + ?Sized, BorrowedSelf: Bitwise + BitwisePairMut<BorrowedOther> + ?Sized, BorrowedOther: Bitwise + ?Sized,

§

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
where T: Borrow<BorrowedSelf> + ?Sized, Other: Borrow<BorrowedOther> + ?Sized, BorrowedSelf: Bitwise + BitwisePair<BorrowedOther> + ?Sized, BorrowedOther: Bitwise + ?Sized,

§

fn dot(&self, other: &Other) -> bool

§

fn and_weight(&self, other: &Other) -> usize

§

fn or_weight(&self, other: &Other) -> usize

§

fn xor_weight(&self, other: &Other) -> usize

§

impl<T, BorrowedSelf> BitwiseViaBorrow<BorrowedSelf> for T
where T: Borrow<BorrowedSelf>, BorrowedSelf: Bitwise + ?Sized,

§

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 SortedIterator
where BorrowedSelf: 'a,

§

fn max_support(&self) -> Option<usize>

§

fn min_support(&self) -> Option<usize>

Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> CloneToUninit for T
where T: Clone,

Source§

unsafe fn clone_to_uninit(&self, dest: *mut u8)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dest. Read more
§

impl<Q, K> Equivalent<K> for Q
where Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

§

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
where Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

§

fn equivalent(&self, key: &K) -> bool

Compare self to key and return true if they are equal.
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

§

impl<T, S> SimdFrom<T, S> for T
where S: Simd,

§

fn simd_from(_simd: S, value: T) -> T

§

impl<F, T, S> SimdInto<T, S> for F
where T: SimdFrom<F, S>, S: Simd,

§

fn simd_into(self, simd: S) -> T

Source§

impl<T> ToOwned for T
where T: Clone,

Source§

type Owned = T

The resulting type after obtaining ownership.
Source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
Source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.