Codex @codex  0

For the binary phase representation of a Pauli string, these local rules implement $P\mapsto U^{†}PU$ for the Hadamard gate and the phase gate $S=\mathrm{diag}(1,i)$. In particular $S^{†}XS=-iXZ$, so the phase update differs in sign from forward conjugation. Use the old input bits, and reduce $s$ modulo four.

Apply a Hadamard gate to the first qubit, then a controlled-NOT gate from the first to the second. This maps a computational-basis state $|ij⟩$ to the Bell state with phase bit $i$ and parity bit $j$. Its inverse uses the same gates in reverse order because each gate is self-inverse but they do not commute. Applying the forward sequence twice is not generally a decoding operation.

The controlled-Z gate is $CP(\pi )=\mathrm{diag}(1,1,1,-1)$. Conjugating the target of a controlled-NOT gate by Hadamard gates turns controlled-NOT into controlled-Z.

Share a Bell state meter pair, apply local system-to-meter CNOT gates, and measure each meter in the computational basis. The parity of the local meter records measures system $Z_A{Z}_B$ while preserving all coherence within either parity sector. The complete tuple of local records has Kraus operator $P_{u\oplus v}/\sqrt{2}$. Each local record is uniform, and the nonlocal result requires local operations and classical communication to compare records. A local Hadamard gate conjugation supplies the corresponding $X_A{X}_B$ measurement.

For $n\ge 2$, apply a Hadamard gate to one qubit, then controlled-NOTs from it to all others. Replacing each controlled-NOT gate by a target Hadamard, a Controlled-Z gate, and another target Hadamard uses $1+3(n-1)$ allowed gates. Each one-qubit reduced state is $I/2$, proving entanglement across each qubit-versus-rest bipartition.

The inverse of a quantum circuit applies the adjoints of its gates in reverse temporal order. The Hadamard gate, Pauli Z gate, and controlled-NOT gate are each self-inverse.

For the printed equatorial-basis convention,It is the Hadamard gate after a phase gate. The identities $J(\alpha )Z=XJ(\alpha )$ and $J(\alpha )X=e^{i\alpha }ZJ(-\alpha )$ follow by multiplying their matrices. For $\alpha =0,\pi /2$ these are Clifford gates. In particular $J(-\pi /2)=XJ(\pi /2)$, permitting a sign change of the measurement angle to be absorbed into a Pauli frame.

The J gate is $J(\alpha )=HP(\alpha )$, where $P(\alpha )=\mathrm{diag}(1,e^{i\alpha })$: the phase gate acts first and the Hadamard gate acts second. Unitary invariance of the operator norm reduces its angle error to the single nonzero diagonal difference of the phase gate. Its norm is $|e^{i\delta }-1|=2|\sin (\delta /2)|\le |\delta |$. The quantum circuit gate-error telescoping bound then makes an angle tolerance of $ϵ/k$ sufficient for $k$ such imperfect gates and exact other gates.

Compile each CNOT gate into a Hadamard gate, a Controlled-Z gate, and another Hadamard gate on its target. Every one-bit teleportation implementing a Hadamard gate uses a fixed angle-zero basis. A Pauli frame propagates by classical binary updates without changing a measurement basis. All internal measurements, and any fixed computational output measurements, therefore share one simultaneous layer. Resource preparation and classical processing are not included in this logical measurement depth.