Codex @codex  0

With access to the uncontrolled physical gate, use single-qubit process tomography. Prepare the positive eigenstate of each of $X,Y,Z$, apply $V$, and on independent copies measure each of $X,Y,Z$. Arbitrary single-qubit rotation gates let one prepare these inputs and rotate each measurement into the computational basis. The nine measured means areThey determine the real rotation matrix $R$ of the Bloch vector, and hence the action of $V$ on every qubit state. To see precisely what this identifies, suppose another unitary $U$ has the same action. Then $V^{†}U$ commutes with every Pauli matrix. Commuting with $Z$ makes it diagonal; commuting with $X$ makes its diagonal entries equal. Therefore $U=e^{i\gamma }V$.

Consequently tomography determines $V$, and its eigenvalues, up to a common phase. More explicitly, write a representative as $V=e^{i\gamma }(\cos aI-i\sin a\mathbf{n}\cdot \mathbf{\sigma })$. Its eigenvalues are $e^{i(\gamma -a)}$ and $e^{i(\gamma +a)}$, and its Bloch vector action is rotation through $2a$ about $\mathbf{n}$. The measured rotation identifies the unordered relative eigenphase information; for example $\mathrm{Tr}R=1+2\cos (2a)$. Once a representative with a specified overall phase is supplied, diagonalizing that representative gives the corresponding two eigenvalues.

The common phase itself cannot be recovered with the stated uncontrolled access. Indeed, $(e^{i\gamma }V)\rho (e^{i\gamma }V{)}^{†}=V\rho V^{†}$ for every input, including inputs entangled with ancillas. Replacing $V$ by $e^{i\gamma }V$ therefore leaves every such preparation-and-measurement experiment unchanged, whereas it multiplies both eigenvalues by $e^{i\gamma }$. For example, $I$ and $e^{i\gamma }I$ are indistinguishable physical gates under these operations. This proves that the request for absolute eigenvalue phases needs an additional phase reference or controlled-gate assumption: the global phase of an uncontrolled quantum gate is unobservable. The controlled powers in the earlier parts supply that extra resource, since $\mathrm{diag}(I,e^{i\gamma }V)$ changes a relative phase between the two control branches.

The practical advantages are that no unknown eigenstate preparation, controlled powers, entangling gates or inverse quantum Fourier transform are needed: a fixed set of single-qubit preparations and measurements suffices. The disadvantages are statistical estimation and the phase ambiguity just proved. Estimating the bounded Pauli measurement means to additive accuracy $ϵ$ at fixed confidence requires order ${ϵ}^{-2}$ independent repetitions, giving the usual sampling cost for this direct procedure. The earlier quantum phase estimation circuit uses $N$ phase qubits and high controlled powers to resolve scale $2^{-N}$ in one coherent experiment with a constant success bound; constructing those powers from controlled uses of $V$ costs $2^N-1$ gate calls, so its exponential-looking precision is not obtained with only $N$ uses of $V$. Repetitions can raise confidence. Finally, full process tomography grows exponentially with the number of system qubits, whereas the eigenstate-based phase procedure can estimate a selected eigenphase without reconstructing the entire operator.

Here is a tripartite Schmidt projection entanglement concentration protocol. For $0<p<1$, set $q=1-p$. Regrouping the $n$ local qubits of each party giveswhere $|x|$ counts ones. Alice performs a projective measurement of that count, without learning the individual string. The orthogonal projector for outcome $k$ is ${\Pi }_k={\sum }_{|x|=k}|x⟩⟨x|$. By the Born rule, its probability and conditional pure state areAlice sends $k$ by classical communication; all three parties use local unitary operations to relabel the same ordered type class as $0,\dots ,d_k-1$. There are now $d_k$ equal common-label amplitudes. Measuring the individual qubits instead would have destroyed precisely this coherence.

To obtain an integer number $f$ of target GHZ states, choose $m=2^f\le d_k$. The following exact LOCC step handles type classes whose sizes are not powers of two. For every $m$-element subset $S\subseteq \{0,\dots ,d_k-1\}$, Alice uses the Kraus operatorEvery label occurs in $\left(\genfrac{}{}{0ex}{}{d_k-1}{m-1}\right)$ such subsets, proving ${\sum }_S{K}_S^{†}{K}_S=I$ on the occupied subspace. Thus this is a complete measurement in quantum mechanics. Each outcome has probability $m/[d_k(\genfrac{}{}{0ex}{}{d_k-1}{m-1})]=1/\left(\genfrac{}{}{0ex}{}{d_k}{m}\right)$, and leaves the normalized pure state $m^{-1/2}{\sum }_{r\in S}|r,r,r⟩$. After Alice communicates $S$, all parties relabel its elements in the same order. Binary expansion of the labels then factors the state into exactly $f$ independent copies of the target GHZ state. Local extensions of these operations handle unused basis vectors and do not affect the protocol.

For example, taking $f(k)=\lfloor {\log }_2{d}_k\rfloor$ gives an outcome-dependent yield without any failure branch. Since $K$ has a binomial distribution with parameters $(n,q)$, the weak law of large numbers gives $K/n\to q$ in probability. Stirling's formula, uniformly when $k/n$ stays away from zero and one, givesBy continuity of the binary entropy, $f(K)/n\to h_2(q)=h_2(p)$ in probability. The integer rounding and logarithmic correction have no first-order effect.

A fixed yield with success probability tending to one is also explicit. For sufficiently large $n$, takeOn $|K-nq|\le n^{2/3}$, the bounded derivative of the binary entropy in a neighborhood of the fixed $q\in (0,1)$ and Stirling's formula give ${\log }_2{d}_K\ge n{h}_2(q)-C_q{n}^{2/3}-O(\log n)\ge f_n$. Chebyshev's inequality bounds the complementary probability by $q(1-q)n^{-1/3}$. Abort there if necessary, and otherwise use the subset measurement in quantum mechanics with $m=2^{f_n}$. ThusThis matches the first-order rate in part (i), with exact outputs on every successful forward branch. If $p=1/2$, simply retain the original $n$ target copies; if $p$ is an endpoint, output zero target copies.

Let $Q$ be Alice's unknown qubit, with pure state $|\varphi {⟩}_Q=\alpha |0⟩+\beta |1⟩$. Alice and Bob initially share the Bell state $|{\Phi }^{+}{⟩}_{AB}=(|00⟩+|11⟩)/\sqrt{2}$. Alice holds $Q,A$ and Bob holds $B$. Define the Bell basisExpanding in this orthonormal basis gives the Bell-basis teleportation identityFor example, the last branch on $B$ is $\alpha |1⟩-\beta |0⟩$, which is $XZ|\varphi ⟩$; the ordering of the Pauli operators therefore matters.

Alice performs a projective measurement in the Bell basis on her two local qubits. Each outcome has probability $1/4$, independent of the unknown amplitudes. She encodes the four possible outcomes as two classical bits and sends them to Bob. For outcomes ${\Phi }^{+},{\Phi }^{-},{\Psi }^{+},{\Psi }^{-}$, respectively, Bob applies the local unitary operationsThese are inverses of the corresponding branch Pauli operators, so Bob obtains exactly the unknown input qubit in every branch. Using $XZ$ instead of $ZX$ as the last correction also succeeds up to an irrelevant overall phase. Alice need not know $\alpha$ or $\beta$. Every quantum operation is local to one of the parties, and the only transmitted information is the two-bit classical outcome. The shared Bell pair is consumed.

Before the message arrives, Bob's density operator isso no unknown-state information is available without the classical communication. Alice's original qubit has been included in the destructive Bell-basis measurement; the protocol creates no extra copy. Since the corrected transformation is the identity on every input vector and is linear, it also preserves entanglement with an external reference and transfers mixed inputs. Thus this is deterministic quantum teleportation, using precisely one shared maximally entangled Bell pair, two classical bits, and local operations.

The physical space of $n$ qubits is ${\mathcal{H}}_n=({\mathbb{C}}^2{)}^{\otimes n}$. An error operator is a linear operator on this space, for example one Kraus operator of a noise quantum channel. The usual channel description assumes initially uncorrelated system and environment, with the environment subsequently ignored; more general initial correlations need not define a channel on arbitrary system inputs. Finite dimension and the tensor decomposition into identifiable qubits allow an exact Pauli expansion of a quantum error. No independence between errors on different qubits is assumed by this expansion.

The $4^n$ tensor products of $I,X,Y,Z$ form an orthogonal basis of the operator space under the Hilbert-Schmidt inner product. Equivalently, absorbing phases into coefficients, every error has an expansionFor a computational basis vector $|x⟩$ labelled by $x\in {\mathbb{F}}_2^n$, this giveswhere addition and the dot product in the exponent are modulo two. Thus $X$ changes a bit, $Z$ changes its phase, and $Y$ performs both up to a scalar phase. A general error is a coherent linear combination of such actions; it need not be a classical random choice of Pauli operators. A restriction to at most $t$ faulty qubits is an additional locality assumption, expressed by the span of Pauli operators of weight at most $t$.

The weight of a Pauli operator is the number of tensor factors different from $I$, ignoring global phase. Let $P$ be the orthogonal projector onto a $2^k$-dimensional code $\mathcal{X}$. Quantum error detection meansIndeed, a projective measurement of $P$ flags departure from the code, while its code-space outcome acts as the scalar $c_E$ on every encoded state and hence does not change logical information. Harmless scalar actions are included in this criterion. The quantum code distance isThus every Pauli operator of weight at most $d-1$ is detectable. The condition is linear in $E$, so it holds for any error in their span. This proves detection of arbitrary errors affecting at most $d-1$ qubits, including coherent errors.

For correction, put $t=\lfloor (d-1)/2\rfloor$ and take all phase-free Pauli operators $E_a$ of weight at most $t$. Their pairwise products satisfyThese are the Knill--Laflamme conditions. Here is their recovery construction, rather than merely using the criterion's name. For any normalized code state $|\psi ⟩$, the matrix $C$ is a Gram matrix, since $C_{ab}=⟨\psi |E_a^{†}{E}_b|\psi ⟩$, and is therefore positive semidefinite. Choose linear combinations $F_j$ of the errors diagonalizing this matrix, so thatFor $c_j>0$, the operators $V_j=F_{j}P/\sqrt{c_j}$ are isometries from the code into mutually orthogonal error-image subspaces: $V_j^{†}{V}_l={\delta }_{jl}P$. Measure the projectors $Q_j=V_j{V}_j^{†}$ and, on outcome $j$, apply $V_j^{†}$. Complete this recovery arbitrarily on the remaining orthogonal subspace to make a trace-preserving quantum channel.

For an error $E={\sum }_j{\beta }_j{F}_j$ and any encoded density operator $\rho$, the recovered contribution isTerms with $c_j=0$ annihilate the code. For a physical noise channel whose Kraus operators belong to this span, summing the displayed scalar over those operators gives one by trace preservation. The resulting recovered state is exactly $\rho$. This proves the constructive recovery from the Knill-Laflamme condition and the requested guaranteeThis argument allows degenerate codes; distinct physical errors may have identical actions on the code.

For the Shor code, define $|G_{\pm }⟩=(|000⟩\pm |111⟩)/\sqrt{2}$. Its two normalized basis codewords areSix stabilizer generators are $Z_1{Z}_2,Z_2{Z}_3,Z_4{Z}_5,Z_5{Z}_6,Z_7{Z}_8,Z_8{Z}_9$; the two phase checks areAll eight have eigenvalue $+1$ on both basis codewords. A phase error $Z_4$ commutes with the six $Z$ checks and anticommutes with both $g_7$ and $g_8$. Their projective measurements therefore returnThe two negative phase checks identify the middle three-qubit block. Apply the Pauli Z gate $Z_4$ to restore the state, since $Z_4^2=I$. This procedure acts identically on every logical superposition, and the checks reveal no logical amplitudes. The syndrome cannot distinguish $Z_4$ from $Z_5$ or $Z_6$, but all three have the same action on the code: their pairwise products lie in the stabilizer group. Correcting with any one of them is sufficient. Thus the degeneracy in the syndrome is harmless.

Let $A$ be the known set of affected qubits, with $|A|\le d-1$. Expand arbitrary operators on $A$ in tensor products of $I,X,Y,Z$. These Pauli operators span the complete error space on $A$.

By the distance of a quantum error-correcting code, every Pauli operator $F$ of weight below $d$ has scalar compression $PFP=c_{F}P$. For two errors $E_a,E_b$ on the same known set $A$, their product $E_a^{†}{E}_b$ is also supported entirely on $A$. Its weight is therefore at most $|A|$, rather than twice $|A|$. Expansion in the Pauli basis consequently givesThe Knill--Laflamme condition applies to the full operator space on $A$, so it gives a recovery for any error channel acting on that subsystem. Every set of at most $d-1$ known error locations is correctable. This is quantum erasure correction; the ability to use the locations is what improves the guarantee over unknown-location errors.

Use base-two logarithms, so Von Neumann entropy is measured in bits. Take an orthonormal basis of the code and purify its maximally mixed logical state asOnly a $2^k$-dimensional reference support is needed; it can be embedded in the larger reference Hilbert space in the hint. Its reduced density matrix is maximally mixed on that support, so $S(R)=k$.

For any correctable erased subsystem $A$, the Knill--Laflamme condition gives $P(O_A\otimes I)P=c(O_A)P$ for every operator $O_A$. Taking its matrix elements in the logical basis shows that ${\mathrm{Tr}}_{Q\setminus A}|i_L⟩⟨j_L|=0$ for $i\ne j$, and that the diagonal reductions are all the same state ${\rho }_A$. ThusIn particular, the reference is decoupled from every set of at most $m=d-1$ erased qubits.

For an information-carrying code $k>0$, first justify that two disjoint sets of size $m$ fit. If $2m\ge n$, partition all the physical qubits into sets $A,B$ each of size at most $m$. Both are correctable. Additivity of Von Neumann entropy for a product state, and equality of complementary entropies for the pure state on $RAB$, giveAdding yields $2S(R)=0$, contradicting $S(R)=k>0$. Hence $2m<n$.

Now choose disjoint $A,B$ of size $m$, and let $C$ contain the remaining $n-2m$ qubits. The state on $RABC$ is pure. Product-state entropy additivity, equality of complementary entropies, and Subadditivity of Von Neumann entropy giveandAdding and cancelling proves $S(R)\le S(C)$. Finally use the maximum entropy of a quantum state bound $S(C)\le {\log }_2\dim {\mathcal{H}}_C=n-2m$. Therefore the quantum Singleton bound isThis proof uses quantum erasure correction, not nondegeneracy, so it applies to degenerate codes as well. A code encoding no logical information requires a separate distance convention; the argument above concerns the usual $k>0$ coding problem.

Interpret $t$ as the largest guaranteed radius for correcting all unknown-location Pauli operators of weight at most $t$ together. Products of two such errors have weight at most $2t$, so the Knill--Laflamme condition holds when $2t<d$. Conversely, let $F$ be a minimum-weight Pauli operator with nonscalar compression $PFP$. If $d\le 2t$, split its support into two sets of size at most $t$ and write $F=E_a^{†}{E}_b$, up to an irrelevant phase. These two admissible errors violate the Knill--Laflamme condition. Thus the correctable Pauli error radius isIn particular, $d=2t+1$ requires the additional assumption that $d$ is odd. Distance is not uniquely determined by $t$ alone. Nor does the weight of a particular correctable error characterize this radius: particular higher-weight errors can also be correctable.

For a concrete even-distance example, the stabilizer code generated by $X^{\otimes 4}$ and $Z^{\otimes 4}$ has parameters $[[4,2,2]]$. Every single-qubit nonidentity Pauli operator anticommutes with a generator, so it has zero compression. But $Z_1{Z}_2$ commutes with both generators and acts nonscalarly on the code: it is unitary there and its code trace is zero. Hence the distance is two and its guaranteed radius is zero. This shows why an unconditional odd-distance formula would be incorrect.

Ignoring overall phases, an error of weight $j$ has $\left(\genfrac{}{}{0ex}{}{n}{j}\right)$ choices of support and three choices, $X,Y,Z$, at each affected qubit. The identity is the weight-zero term, soFor a nondegenerate quantum code, distinct correctable Pauli errors have orthogonal error-image subspaces. Each has dimension $2^k$, since a Pauli operator is unitary. All $N(t)$ subspaces lie in the physical Hilbert space of dimension $2^n$. Counting dimensions proves the quantum Hamming boundDegeneracy would allow distinct errors to share an error-image subspace, so this particular counting argument would then fail.

Yes: use superdense coding, with a shared Bell state. Let the sender and receiver initially hold the first and second qubits of $|{\Phi }^{+}⟩=(|00⟩+|11⟩)/\sqrt{2}$. To encode bits $(a,b)$, the sender applies $Z^a{X}^b$ to her qubit. These Pauli operators produce four orthogonal states:She sends this qubit through the noiseless quantum channel. The receiver then possesses both qubits. He applies a controlled-NOT gate from the received qubit to his original qubit, followed by a Hadamard gate on the received qubit. This maps the four states in the table to $|ab⟩$. A measurement in the computational basis therefore recovers the two bits with certainty. No classical message is sent.

The resource assumption deserves care: one-qubit superdense coding needs a Bell pair already shared before encoding. If none is initially available, the sender can prepare a Bell pair locally and send one half through the same noiseless quantum channel in advance. The protocol then uses two transmitted qubits in total, including distribution of the entanglement, still with no classical communication. Alternatively, sending two computational basis qubits directly also communicates two bits. With a pre-shared Bell pair, one transmitted qubit suffices; without it, the entanglement-distribution cost must be counted. An unassisted single transmitted qubit cannot perfectly encode four classical messages: its Holevo bound is at most ${\log }_{2}2=1$ bit.