Struct PauliSet 

pub struct PauliSet {
    pub n: usize,
    /* private fields */
}

A set of Pauli operators (module global phase) Conjugation by Clifford gates are vectorized

Fields

n: usize

Implementations

impl PauliSet

pub fn new(n: usize) -> Self

Allocate an empty set of n-qubit Pauli operators

pub fn new_empty(n: usize, m: usize) -> Self

Allocate a set of m n-qubit Pauli operators set to the identity

pub fn from_slice(data: &[String]) -> Self

pub fn len(&self) -> usize

Returns the number of operators stored in the set

pub fn is_empty(&self) -> bool

pub fn insert(&mut self, axis: &str, phase: bool) -> usize

Inserts a new Pauli operator in the set and returns its index

pub fn insert_vec_bool(&mut self, axis: &[bool], phase: bool) -> usize

Inserts a new Pauli operator described as a vector of bool in the set and returns its index

pub fn insert_pauli(&mut self, pauli: &Pauli) -> usize

pub fn set_phase(&mut self, col: usize, phase: bool)

pub fn set_entry( &mut self, operator_index: usize, qbit: usize, x_part: bool, z_part: bool, )

pub fn set_raw_entry(&mut self, row: usize, col: usize, value: bool)

pub fn clear(&mut self)

Clears the data of the Pauli set

pub fn pop(&mut self)

Pops the first rotation in the set

pub fn pop_last(&mut self)

Pops the last rotation in the set

pub fn set_to_identity(&mut self, operator_index: usize)

Set some operator to identity (because popping in the middle is expensive :O)

pub fn get(&self, operator_index: usize) -> (bool, String)

Get the operator at index operator_index as a pair (phase, string)

pub fn get_as_vec_bool(&self, operator_index: usize) -> (bool, Vec<bool>)

Get the operator at index operator_index as a pair (bool, Vec<bool>)

pub fn get_as_pauli(&self, operator_index: usize) -> Pauli

Get the operator at index operator_index as a Pauli object

pub fn get_entry(&self, row: usize, col: usize) -> bool

Get a single entry of the PauliSet

pub fn get_phase(&self, col: usize) -> bool

pub fn get_i_factors(&self) -> Vec<u8>

pub fn get_i_factors_single_col(&self, col: usize) -> u8

pub fn get_inverse_z(&self, qbit: usize) -> (bool, String)

Get the inverse Z output of the tableau (assuming the PauliSet is a Tableau, i.e. has exactly 2n operators storing X1…Xn Z1…Zn images)

pub fn get_inverse_x(&self, qbit: usize) -> (bool, String)

Get the inverse X output of the tableau (assuming the PauliSet is a Tableau, i.e. has exactly 2n operators storing X1…Xn Z1…Zn images)

pub fn and_row_acc(&self, row: usize, vec: &[bool]) -> bool

Returns the sum mod 2 of the logical AND of a row with an external vector of booleans

pub fn equals(&self, i: usize, j: usize) -> bool

Check equality between two operators

pub fn commute(&self, i: usize, j: usize) -> bool

Checks if two operators in the set commute

pub fn get_support(&self, index: usize) -> Vec<usize>

pub fn support_size(&self, index: usize) -> usize

Returns the support size of the operator (i.e. the number of non-I Pauli term in the operator)

pub fn swap_qbits(&mut self, i: usize, j: usize)

pub fn count_id(&self, qbit: usize) -> usize

pub fn is_i(&self, qbit: usize, col: usize) -> bool

Returns true if pauli col for qubit q is I

pub fn count_leading_i(&self, qbit: usize, order: &[usize]) -> usize

pub fn pauli_pair_index(&self, i: usize, j: usize, col: usize) -> usize

Returns (the index of) the Pauli pair over the qubits i and j for the Pauli operator in column col.

pub fn count_leading_i_conjugation( &self, i: usize, j: usize, q: usize, c: usize, order: &[usize], ) -> usize

Computes the score of conjugating the Pauli pair over the qubits i and j by chunk c. This is equivalent to the scoring function described in the paper but uses the precomputed table lookup instead of performing conjugation.

pub fn support_size_sort(&mut self)

Sorts the set by support size

Trait Implementations

impl Clone for PauliSet

fn clone(&self) -> PauliSet

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for PauliSet

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

Formats the value using the given formatter.

impl Display for PauliSet

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

Formats the value using the given formatter.

impl PartialEq for PauliSet

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

Tests for self and other values to be equal, and is used by ==.

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

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl PauliLike for PauliSet

fn h(&mut self, i: usize)

Conjugate the set of rotations via a H gate

fn s(&mut self, i: usize)

Conjugate the set of rotations via a S gate

fn sd(&mut self, i: usize)

Conjugate the set of rotations via a S dagger gate

fn sqrt_x(&mut self, i: usize)

Conjugate the set of rotations via a SQRT_X gate

fn sqrt_xd(&mut self, i: usize)

Conjugate the set of rotations via a SQRT_X dagger gate

fn cnot(&mut self, i: usize, j: usize)

Conjugate the set of rotations via a CNOT gate

fn cz(&mut self, i: usize, j: usize)

fn conjugate_with_gate(&mut self, gate: &CliffordGate)

Conjugate the PauliLike object via a Gate

fn conjugate_with_circuit(&mut self, circuit: &CliffordCircuit)

Conjugate the PauliLike object via a Circuit

impl StructuralPartialEq for PauliSet