Pauli group explained

In physics, quantum information and group theory, the Pauli group is a group formed by tensor products of Pauli matrices, including the identity.[1] The single-qubit Pauli group is a 16-element matrix group, consisting of the 4 Pauli matrices each with 4 possible phase factors. The -qubit Pauli group is a

4n+1

-element group consisting of tensor products of single-qubit Paulis.[2]

In quantum information theory, Pauli groups are important because they are the basis for stabilizer formalism, a widely-used framework for constructing and describing quantum error correction codes using sets of commuting Pauli operators. Stabilizer codes are formed from commuting subgroups of the Pauli group.[3] [4]

Single-qubit Pauli group

I

and all of the Pauli matrices

X=\sigma1=\begin{pmatrix} 0&1\\ 1&0 \end{pmatrix},   Y=\sigma2=\begin{pmatrix} 0&-i\\ i&0 \end{pmatrix},   Z=\sigma3= \begin{pmatrix} 1&0\\ 0&-1 \end{pmatrix}

,together with the products of these matrices with the factors

\pm1

and

\pmi

:

G \stackrel{def

}\ \ \equiv \langle X, Y, Z \rangle.The Pauli group is generated by the Pauli matrices, and like them it is named after Wolfgang Pauli.

As an abstract group,

G \congC4\circD4

is the central product of a cyclic group of order 4 and the dihedral group of order 8.[5]

The Pauli group is a representation of the gamma group in three-dimensional Euclidean space. It is not isomorphic to the gamma group; it is less free, in that its chiral element is

\sigma1\sigma2\sigma3=iI

whereas there is no such relationship for the gamma group.

Pauli algebra

The Pauli algebra is the algebra of 2 x 2 complex matrices M(2, C) with matrix addition and matrix multiplication. It has a long history beginning with the biquaternions introduced by W. R. Hamilton in his Lectures on Quaternions (1853). The representation with matrices was noted by L. E. Dickson in 1914.[6] Publications by Pauli eventually led to the eponym now in use. Basis elements of the algebra generate the Pauli group.

Multi-qubit Pauli group

The Pauli group on

n

qubits,

Gn

, is the group generated by the operators described above applied to each of

n

qubits in the tensor product Hilbert space

(C2) ⊗

. That is,

G_n = \langle P_1 \otimes \cdots \otimes P_n : P_i \in \ \rangle = \.

The order of

Gn

is

4 ⋅ 4n

since a scalar

\pm1

or

\pmi

factor in any tensor position can be moved to any other position.

Notations

An

n

-qubit Pauli operator that only acts on a single qubit is often denoted as a single Pauli letter with an integer subscript. For example, in a system with 3 qubits,

X1\equivX ⊗ I ⊗ I,    Z2\equivI ⊗ Z ⊗ I.

Multi-qubit Pauli operators can be written as products of single-qubit Paulis on disjoint qubits. Alternatively, when it is clear from context, the tensor product symbol

⊗

can be omitted, i.e. unsubscripted Pauli matrices written consecutively represents tensor product rather than matrix product. For example:

XZI\equivX1Z2=X ⊗ Z ⊗ I.

Properties

Operators in

Gn

can also be represented as

2n x 2n

matrices. An operator

P=c ⋅ P1 ⊗ … ⊗ Pn

always has two distinct eigenvalues, either

\pm1

or

\pmi

depending on whether the scalar factor

c

is

\pm1

or

\pmi

. An operator with eigenvalues

\pm1

is Hermitian, and one with eigenvalues

\pmi

is anti-Hermitian. In either case, a set of

2n

eigenvectors of

P

can be constructed by taking tensor products of eigenvectors of each

Pi

, with the eigenvalue being

c

times the product of the eigenvalues of each factor.

Two operators in

Gn

either commute or anti-commute, depending on whether the number of anti-commuting pairs of single-qubit Pauli operators at the same location is even or odd. For example,

XXX

and

ZZX

commute with each other since there are exactly two anti-commuting pairs (on qubits 1 and 2), but

XXX

and

ZZZ

anti-commute since there are three such pairs.

Binary vector representation

A simple but useful mapping

N

exists between the binary vector space and the set of Pauli matrices :

This mapping allows a multi-qubit Pauli operator to be represented as a binary vectors with a phase factor, and operations on these operators to be defined as binary operations rather than matrix operations.

Some useful properties of this mapping becomes evident when the phaseless Pauli operators are regarded as representatives of equivalence classes in the quotient group (where is the single-qubit Pauli group). For, denote the equivalence class represented by as

Note that is a commutative group since two Pauli operators either commute or anti-commute, but .

The map now induces an isomorphism, i.e., addition of vectors in is equivalent to multiplication of Pauli operators up to a global phase:

Furthermore, let denote the symplectic product between two elements, where and (this notation represents binary string concatenation, e.g.,), :

Then the symplectic product gives the commutation relations of elements of :

The symplectic product and the mapping thus give a useful way to phrase Pauli relations in terms of binary algebra.

The above definitions can be straightforwardly extended to multiple qubits, defining a mapping such that

Similar to the single-qubit case, denoting the quotient group as, the map is an isomorphism:

Furthermore, for and, where, define the symplectic product as

where and . Then the symplectic product captures the commutation relations of any operators and :

The above binary representation and symplectic algebra are especially useful in making the relation between classical linear error correction and quantum stabilizer codes more explicit. In the language of symplectic vector spaces, a symplectic subspace corresponds to a direct sum of Pauli algebras (i.e., encoded qubits), while an isotropic subspace corresponds to a set of stabilizers.

References

Notes and References

  1. Book: Artur . Ekert . Timothy . Hosgood . Alastair . Kay . Chiara . Macchiavello . 7.1 Pauli groups Introduction to Quantum Information Science.
  2. Bagarello . Fabio . On the Pauli group on 2-qubits in dynamical systems with pseudofermions . 2024 . 2308.05185 . Bavuma . Yanga . Russo . Francesco G. . Forum Mathematicum . 36 . 3 . 585–597 . 10.1515/forum-2022-0370 .
  3. Book: Nielsen . Michael A. . Quantum computation and quantum information . Chuang . Isaac L. . 2010 . Cambridge University Press . 978-1-107-00217-3 . 10th anniversary . Cambridge ; New York.
  4. Gottesman. Daniel. The Heisenberg Representation of Quantum Computers. 1998. quant-ph/9807006.
  5. Pauli group on GroupNames
  6. [L. E. Dickson]