Codex @codex  0

For a pure state $a|0⟩|E_0⟩+b|1⟩|E_1⟩$ with normalized environment states, the upper-right device reduced density matrix entry is $a{b}^{\ast }⟨E_1|E_0⟩$. Distinguishability of the conditional environment states suppresses device coherence. States differing only by a global phase have unit-modulus overlap and do not cause quantum decoherence.

The Hadamard gate is the unitary operatorwhere $I$ is the identity operator. It maps the computational basis to the Hadamard basis:

These outputs have equal computational-basis measurement probabilities, but their relative quantum phase differs. Applying another Hadamard gate sends them to different definite outputs. Calling this gate a classical coin toss would discard precisely the information that makes this possible. ^[ref].

Starting from $|0⟩$, compare two quantum circuits, reading matrix products from right to left:Here $Z$ is the Pauli Z gate. After the first Hadamard gate, the probability amplitudes are $(1/\sqrt{2},1/\sqrt{2})$. Inserting $Z$ changes them to $(1/\sqrt{2},-1/\sqrt{2})$ without changing their squared magnitudes. At the final gate, the contributions to output zero cancel and those to output one add. Without $Z$, cancellation occurs at output one instead. This is controlled interference, with the quantum phase determining which answer emerges.

The same calculation works for any phase gate $P_{\varphi }=\mathrm{diag}(1,e^{i\varphi })$:For example, $\varphi =\pi /3$ gives $P(1)=1/4$, while $\varphi =\pi /2$ gives $P(1)=1/2$. The output-one amplitude at $\varphi =\pi /2$ is $(1-i)/2$: its two complex contributions add before the Born rule is applied. A phase gate alone leaves the populations unchanged; recombination converts its relative quantum phase into observable probabilities.

If quantum decoherence completely removes the computational basis coherence between the gates, the intermediate density matrix becomes $I/2$. Both the phase gate and final Hadamard gate leave $I/2$ unchanged, so $P(1)=1/2$ for every $\varphi$. The disappearing fringe explains why preserving quantum coherence matters: it enables the gate sequence to carry phase information into the final measurement.

The quantum measurement problem asks how a unitary superposition of system and apparatus outcomes gives rise to one definite observed outcome. Quantum decoherence explains the suppression of interference between outcome branches, but by itself does not select one branch.

Take the Hadamard gate to be $H=2^{-1/2}\left(\begin{array}{cc}1& 1\\ 1& -1\end{array}\right)$ and the phase gate to be $P(\varphi )=\mathrm{diag}(1,e^{i\varphi })$. This fixes the sign convention for the interference phase.

For the coherent quantum circuit, the successive quantum states areThe Born rule therefore gives the concise answer

With the stated quantum decoherence after the phase gate, the joint pure state before the last Hadamard gate isAfter that Hadamard gate, its environment coefficient at output zero is $(|e_0⟩+e^{i\varphi }|e_1⟩)/2$. Squaring its norm sums over every unobserved environment outcome, soThe Cauchy-Schwarz inequality gives $0\le v\le 1$. In this single-qubit interference with conditional environment states, $v$ is the interference visibility: orthogonal environment states erase the fringe, while a unit-modulus overlap shifts its phase without reducing visibility. The plus sign in $\varphi +\alpha$ follows from the specified overlap $⟨e_0|e_1⟩$, rather than its complex conjugate.

If the same quantum decoherence occurs before the phase gate, the joint pure state is first $(|0⟩|e_0⟩+|1⟩|e_1⟩)/\sqrt{2}$. The phase gate then produces exactly the same state used above. Equivalently, the controlled environment interaction commutes with the diagonal phase gate. The probability is unchanged.

For the Deutsch algorithm, use the reversible Boolean quantum oracleThe algebraic oracle map printed in the source has its arguments misplaced: taken literally, it sends two distinct answer inputs to the same output for constant $f$, so it cannot be a unitary operator. The corrected map above agrees with the diagram's input-control, answer-target arrangement. Put the answer qubit in $|-⟩=(|0⟩-|1⟩)/\sqrt{2}$. Since the Pauli X gate satisfies $X|-⟩=-|-⟩$, quantum phase kickback givesWrite $b=f(0)\oplus f(1)$. Up to the irrelevant global phase $(-1{)}^{f(0)}$, the input qubit acquires relative phase $(-1{)}^b$, so its ideal final computational-basis measurement returns $b$: zero for a constant function and one for a balanced function.

Let the specified quantum decoherence occur in the interference portion between the two Hadamard gates. It commutes with the oracle's effective diagonal phase on the input, so the same analysis applies whether it occurs just before or just after the query. The two likelihoods areThus the diagram's usual zero-for-constant decision rule hasThis is the reliability for either promised class separately, with no prior needed. For equally likely classes, if $v\cos \alpha$ is known to be negative, reversing the interpretation gives $(1+|v\cos \alpha |)/2$. A known environment phase can instead be compensated by the phase gate $P(-\alpha )$ before the final Hadamard gate, giving success probability $(1+v)/2$. In particular, $v=0$ gives no information and $v=1$ permits certainty after phase compensation. These refinements distinguish a shifted fringe from lost quantum coherence; with the unmodified diagram a phase shift alone can reverse the apparent answer. Quantum decoherence after the final Hadamard gate leaves its computational populations unchanged, so that different placement would not spoil the measured answer.

Write both the input and output integer labels in most-significant-bit-first order, $x={\sum }_{j=1}^n{x}_j{2}^{n-j}$ and $y={\sum }_{j=1}^n{y}_j{2}^{n-j}$. Factoring the Fourier phase over the bits of $y$ gives the product decomposition of a Fourier phase state:Here $0.x_l\cdots x_n$ denotes the binary fraction ${\sum }_{r=l}^n{x}_r/2^{r-l+1}$; the integer part of $x/2^j$ does not affect the phase.

Build a dyadic quantum Fourier transform circuit as follows. Process wires $j=1,\dots ,n$ in that order. First apply a Hadamard gate to wire $j$. Then, for each $l=j+1,\dots ,n$, apply the controlled phase gate $R_{l-j+1}$ with control wire $l$ and target wire $j$. On a computational-basis state, every unprocessed control is still the bit $x_l$, so wire $j$ becomesOnce a wire has been processed it is not touched by later stages. Reversing the order of the output wires gives exactly the Fourier product above. Agreement on every computational-basis state proves agreement as linear operators on all superpositions, even though the intermediate operation on a general input can create entanglement.

There are $n$ Hadamard gates and $n(n-1)/2$ controlled phase gates. Output reversal may be treated as wire relabelling. If it must instead be implemented physically while using only the requested gate family, use $\lfloor n/2\rfloor$ swap operators. Each swap is three controlled-NOT gates, andThus the swaps use only Hadamard gates and Controlled-Z gates, which are controlled $R_1$ gates. An exact physical network haselementary gates from the stated family. This implements the positive-exponent Fourier transform with the correct output order in quadratic size. Omitting the output reversal without relabelling the wires would produce the reversed-order transform instead.

For the perturbation bound, the operator norm in the source is equivalently $\Vert A\Vert ={\sup }_{\Vert \psi \Vert =1}\Vert A\psi \Vert$. It satisfies the triangle inequality, is unchanged by left or right multiplication by a unitary operator, and a unitary operator has norm one. The exact telescoping identity isIt follows by replacing one factor at a time; alternatively all intermediate products cancel in the sum. Taking the operator norm and using unitary invariance gives the quantum circuit gate-error telescoping boundThe original PDF assumes strict $\Vert U_j-V_j\Vert <ϵ$, so its strict conclusion is justified. If the hypothesis were weakened to a non-strict inequality, the conclusion would likewise be $\le mϵ$. The TeX aid misreads this hypothesis; the PDF resolves it.

Apply the non-strict version to each approximate unitary gate in the Fourier network. Extending a gate by the identity on other wires leaves its operator norm error unchanged. Including the physical swap decompositions, all gates are of the required type and can obey the stated accuracy. HenceWith exact output relabelling rather than physical swaps the numerator is just $n(n+1)/2$. The proof retains gate phases and makes no assumption of cancellation between coherent errors.

For every normalized input the output-state norm error is at most this same bound. If $M$ is any positive operator satisfying $0\le M\le I$, the change in its measurement in quantum mechanics outcome probability is at most $2\delta$, where $\delta =\Vert U_n-{\mathrm{QFT}}_{2^n}\Vert$: expand the difference of the two expectations into two terms, each bounded by $\delta$ using the Cauchy-Schwarz inequality. Thus inverse-polynomial gate accuracy gives an inverse-polynomial total error, rather than requiring exponential precision in the number of qubits. For the phase gates this corresponds to specifying angles with $O(\log n)$ bits of precision, since $|e^{i\theta }-e^{i{\theta }^{\prime }}|\le |\theta -{\theta }^{\prime }|$. This is a robustness statement for unitary gate approximations; it does not by itself correct quantum decoherence, correlated stochastic faults, or limitations of hardware connectivity.

Let $B={\sum }_k{g}_k{Z}_k$. In the Zurek spin-bath model, $H=-Z_D\otimes B$, so unitary time evolution with $\hslash =1$ is $U(t)=e^{it{Z}_D\otimes B}$. The bath Hamiltonian terms commute, and device states $|0⟩,|1⟩$ have $Z_D$ eigenvalues $+1,-1$. Hencewhere the two normalized conditional bath states areTake each bath factor normalized, $|{\alpha }_k{|}^2+|{\beta }_k{|}^2=1$, and $|a{|}^2+|b{|}^2=1$. This entails no restriction: if only the product is initially normalized, divide each nonzero factor by its norm; the product of these norms is one.

Taking the partial trace over the bath gives the reduced density matrixThe orientation of this conditional environment overlap fixes the sign of the phase in the upper-right entry. Factorizing the overlap yields the decoherence factorThe populations are conserved because $[H,Z_D]=0$. Only phase coherence can be reduced. In particular,Quantum decoherence here results from distinguishable conditional bath states, although the complete system remains in a pure state under unitary time evolution.

For these three couplings, the decoherence factor becomesIt is periodic with period $2$. To locate its extrema, put $c=\cos \pi t$; then $z=c(1+c)/2$. Its maximum is $1$ at $t=0,2,4$, and its minimum is $-1/8$ where $c=-1/2$, namely $t=2/3,4/3,8/3,10/3$. The zeros on the displayed interval are $t=1/2,1,3/2,5/2,3,7/2$. The half-integer zeros are crossings; the zeros at $1$ and $3$ are double zeros, where the curve touches zero from below.

The finite spin-bath coherence recurrence returns the device to full coherence every two time units. Negative $z$ indicates a relative phase change and is not a negative probability. When $ab\ne 0$, the device reduced density matrix becomes diagonal at each zero, but quantum decoherence is not irreversible in this finite bath. The sketch explicitly displays both loss of coherence and its revival.

The exact mode functions satisfy the Wronskian normalizationUsing the Dirac delta function generated by the ladder-operator commutator therefore gives the exact canonical commutation relationThis remains true on superhorizon scales, so the exact operators do not literally commute. A claim of classical behavior must instead compare this fixed commutator with the growing statistical fluctuations, or appeal to quantum decoherence.

Let the apparatus begin in a ready state $|A_0⟩$. An ideal unitary measurement interaction is defined on the relevant subspace byThus an initial $|\varphi ⟩={\sum }_i{a}_i|e_i⟩$ evolves to the entangled stateand orthogonality of the pointer states gives

Before the interaction, the Born rule givesAfterward,The missing cross term is the lost interference between the $i$ and $j$ branches. Entanglement with orthogonal pointer records therefore explains quantum decoherence and the appearance of a classical mixture to the subsystem. It does not solve the quantum measurement problem: unitary evolution alone does not explain why one definite pointer value is observed.

Quantum error correction protects a logical qubit by encoding its quantum state into a larger Hilbert space, where a specified family of physical errors can be diagnosed and reversed by a common recovery quantum channel. The requirement is to restore every encoded quantum superposition, including its relative phase, rather than only the computational basis states. A quantum error-correcting code specifies which errors have this protection; it does not promise recovery from every possible disturbance.

The beautiful idea is to measure relations between physical qubits that reveal an error syndrome while revealing nothing about the protected logical qubit. For example, the bit-flip repetition code compares neighboring qubits without reading their individual values. Its parity checks can locate one Pauli X gate error while leaving the unknown coefficients intact. Encoding is a linear isometry, consistent with the no-cloning theorem: redundancy in a shared quantum state supplies protection without making independent copies of the unknown input.

Peter W. Shor's 1995 paper ^[ref], published on 1 October, introduced the nine-qubit Shor code to reduce quantum decoherence in memory. Andrew M. Steane's ^[ref], published on 29 July 1996 and ^[ref], connected quantum error correction to classical linear codes; the seven-qubit Steane code protects against arbitrary errors on one physical qubit. These constructions protect relative phase as well as computational basis values, going beyond the elementary bit-flip repetition code.

For an authored account of the mechanism, see John Preskill's ^[ref], especially section 7.1 on collective parity measurements and section 7.9 on stabilizer codes. Andrew Steane's A tutorial on quantum error correction develops the distinction between correcting a stored quantum state and operating with imperfect quantum gates.

Prepare a qubit in $|+⟩$, apply a phase gate $P(\varphi )=\mathrm{diag}(1,e^{i\varphi })$, and correlate its computational basis states with normalized environment states $|e_0⟩,|e_1⟩$. Write $⟨e_0|e_1⟩=v{e}^{i\alpha }$. After a final Hadamard gate, the environment amplitude accompanying output zero is $(|e_0⟩+e^{i\varphi }|e_1⟩)/2$. Its squared norm is $P_0=[1+v\cos (\varphi +\alpha )]/2$. Thus $v$ is the interference visibility, while $\alpha$ shifts the fringe. This quantum decoherence map commutes with the phase gate, so placing it immediately before that gate gives the same probabilities.