Codex @codex  0

Prepare an ancilla in $|+⟩$, use it to control a Hermitian Pauli operator $P$, apply a Hadamard gate, and measure the ancilla. Outcome $s$ applies the projector $[I+(-1{)}^{s}P]/2$ to the data register.

The Bell basis diagonalizes the commuting Pauli operators $Z\otimes Z$ and $X\otimes X$. Two local anticommutations make the joint operators commute. Their signs encode parity and relative phase. The displayed projectors turn the signed eigenvalues into literal zero-or-one bit eigenvalues: even parity and plus phase have bit zero.

Store a Pauli group element with binary exponents $a_j,b_j$ and a phase exponent $s$ modulo four. This ordered $XZ$ convention uses $2n+2$ bits for $n$ qubits. Since $XZ=-iY$, phase factors are essential when converting to Hermitian Pauli operators and evaluating measurement probabilities.

The Pauli centralizer $C(S)$ consists of Pauli operators commuting with every stabilizer. Elements of $C(S)\setminus S$, modulo stabilizers and phases, are the nontrivial logical Pauli operators.

A Clifford circuit is composed entirely of Clifford gates. It maps Pauli operators to Pauli operators in the Heisenberg picture and stabilizer states to stabilizer states in the Schrödinger picture.

A Clifford gate is a unitary operation that normalizes the Pauli group: conjugating any Pauli operator by it produces another Pauli operator. Hadamard, phase, and controlled-$Z$ gates generate the Clifford operations.

The need for mutually exclusive experimental arrangements or incompatible observables to exhibit different aspects of a quantum system. For example, path discrimination and interference contrast obey a tradeoff, while sharp Pauli operator $X$ and $Z$ measurements have incompatible eigenbases. Which-path information is an operational record, rather than a requirement that a conscious observer reads it.

The guaranteed radius is the largest integer $t$ for which all unknown-location Pauli operators of weight at most $t$ can be corrected together. Pairwise products have weight at most $2t$, so $2t<d$ suffices by the Knill--Laflamme condition. Conversely, split a minimum-weight undetectable Pauli operator between two subsets of its support. If $d\le 2t$, this gives two errors of weight at most $t$ whose pairwise product violates that condition. Consequently $d$ is either $2t+1$ or $2t+2$; parity cannot be recovered from $t$ alone.

Split the support of a Pauli operator of weight at most $2t$ into two sets of size at most $t$. It is, up to a scalar phase, $E_a^{†}{E}_b$ for two errors in the correctable family. The Knill--Laflamme condition makes its compression to the code scalar, which is quantum error detection. Expansion in the Pauli basis extends the assertion to every operator supported on at most $2t$ qubits. The number $t$ counts affected qubits, not the cardinality of an arbitrary selected family of errors.

Daniel Gottesman developed a useful way to describe quantum circuits by following their Pauli operators instead of all their probability amplitudes. An $n$-qubit stabilizer state is specified by $n$ independent compatible commuting Pauli operators whose common $+1$ eigenspace is one-dimensional. A Clifford gate maps Pauli operators to Pauli operators by conjugation, so these generators can be updated efficiently on a computer. This explains why a large family of entangled computations is efficiently simulable, and supplies the language of stabilizer codes.^[ref]

Physicist whose work includes the stabilizer formalism for quantum error correction. His The Heisenberg Representation of Quantum Computers by Daniel Gottesman develops the Pauli group description of Clifford circuits. Verified institutional profile.

The displayed qubit quantum channel is completely positive for $0\le q\le 4/3$. Indeed its Pauli channel probabilities are $1-3q/4$ for the identity and $q/4$ for each nonidentity Pauli operator. In the range $q>1$ the coefficient $1-q$ is negative, so the displayed expression is not a convex mixture of the unchanged and maximally mixed states, even though the Pauli representation is a valid random unitary channel. Its Bloch vector is contracted and reversed by the factor $1-q$. The Holevo capacity of a qubit depolarizing channel remains $1-h_2(q/2)$ throughout this interval.

An $[[n,k,d]]$ quantum error correction code is a $2^k$-dimensional subspace of $n$ qubits. Its distance $d$ is the minimum weight of a Pauli operator $E$ for which $PEP$ is not a scalar multiple of the code projector $P$. Thus every operator supported on fewer than $d$ qubits has scalar compression to the code, by expansion in the Pauli basis. This definition includes degenerate codes; a low-weight operator acting as a scalar does not reduce the distance.

Suppose a quasi-adiabatic continuation maps a stabilizer code projector $P_0$ to a perturbed low-energy projector $P=U{P}_0{U}^{†}$. Each original stabilizer generator $S_i$ has a dressed operator ${\tilde{S}}_i=U{S}_i{U}^{†}$. Conjugation preserves mutual commutation and ${\tilde{S}}_{i}P=P$, so the dressed checks characterize the transported subspace.

They generally have spatial tails rather than finite Pauli operator support. They need not commute with the entire perturbed Hamiltonian operator; preserving its selected spectral subspace does not make them global conserved quantities. Likewise, a non-Pauli component alone does not destroy quantum error correction, since correctable error sets have a linear span. For bare local errors, accuracy instead depends on the spread of the corresponding conjugated errors, the original quantum code distance and the Knill--Laflamme condition. Bounds on spatial tails can control approximate local correction under the stated gap and locality assumptions.

For the quantum depolarizing channel applying the identity with probability $1-p$ and each nonidentity Pauli operator with probability $p/3$, the entanglement-assisted classical capacity is the displayed number of bits per use. Here $H_4$ is Shannon entropy of the four listed probabilities. Its unassisted product-state capacity is $1-h_2(2p/3)$. Both vanish at $p=3/4$. If $q$ instead denotes replacement by $I/2$, then $p=3q/4$ and complete depolarization is at $q=1$. The original entanglement-assisted capacity paper gives the depolarizing-channel formula.

The five-qubit code encodes one logical qubit into five physical qubits and corrects an arbitrary error on one physical qubit. In a nondegenerate realization, the identity and fifteen one-qubit Pauli operators take the two-dimensional code into sixteen mutually orthogonal syndrome subspaces, filling the 32-dimensional physical Hilbert space.

// Target: quantum-error-correction.bigb

The GHZ theorem contradicts predetermined local outcomes using perfect quantum correlations. For the GHZ state $(|000⟩+|111⟩)/\sqrt{2}$, the products of Pauli operators obeywith certainty, while $X_1{X}_2{X}_3=+1$ with certainty.

Suppose each site has predetermined outcomes $x_i,y_i\in \{-1,+1\}$, independent of which observable is chosen at the other sites. Multiplying the first three constraints cancels every $y_i^2$, forcing $x_1{x}_2{x}_3=-1$, in contradiction with the quantum measurement prediction. The Pauli operators evade that classical multiplication rule because $XY=-YX$ at the same site. The displayed signs use the plus-GHZ state; changing its relative sign changes the individual correlations consistently. ^[ref]

For $H=J(XX+YY+ZZ)/2$, $U=e^{-itH}$, and an individually applied Pauli Z gate $P=Z\otimes I$, conjugation gives $PHP=J(-XX-YY+ZZ)/2$. The paired Pauli operators $XX,YY,ZZ$ commute with one another, soTwo equal free-evolution intervals, each of duration $t$, therefore cancel exchange while retaining the Ising coupling. This spin echo is exact for instantaneous ideal gates; a finite pulse requires accounting for the interaction during the pulse. A simultaneous Pauli Z gate on each spin commutes with $H$ and cannot perform the same cancellation. The physical availability of the individual gate is a separate quantum control requirement.

Charlie measures his qubit of a GHZ state in the $X$ basis. The two equally likely outcomes leave Alice and Bob in the Bell states ${\Phi }^{+}$ or ${\Phi }^{-}$, respectively. Charlie sends the outcome bit $c$ to Bob, who applies the Pauli operator $X{Z}^c$, giving ${\Psi }^{+}$ in either case. This is deterministic LOCC entanglement localization. If Charlie's record is ignored, Alice and Bob instead have the separable mixture $(|00⟩⟨00|+|11⟩⟨11|)/2$. The classical outcome is necessary to turn the conditional entanglement into a known usable Bell pair.

With $|V⟩=|0⟩$ and $|H⟩=|1⟩$, an analyzer oriented at angle $\varphi$ from vertical has positive-outcome state $\cos \varphi |0⟩+\sin \varphi |1⟩$. Subtracting the two orthogonal rank-one projection operators gives $M(\varphi )=\cos 2\varphi Z+\sin 2\varphi X$, where $X,Z$ are Pauli operators. Physical polarization angles are therefore half their corresponding Bloch sphere angles.

For a specified correctable set of distinct Pauli operators modulo phase, a nondegenerate code has mutually orthogonal error images $E\mathcal{X}$. Equivalently, the matrix in the Knill--Laflamme condition is diagonal for that Pauli error set. Each error therefore requires a separate syndrome subspace of dimension equal to the logical code dimension. Degenerate codes can have distinct errors with the same action on the code and do not satisfy this orthogonality counting argument.