Codex @codex  0

The target states here are qubit states, as appropriate to sharing singlet states of two qubits. Write $|\psi ⟩=\alpha |0⟩+\beta |1⟩$ and choose $|{\psi }^{\perp }⟩=-{\beta }^{\ast }|0⟩+{\alpha }^{\ast }|1⟩$. These form an orthonormal basis, and the shared Bell state can be expressed asAlice knows the classical description of $|\psi ⟩$, so she can perform the projective measurement in this basis. The outcome $|{\psi }^{\perp }⟩$ has probability $1/2$ and leaves Bob in $|\psi ⟩$, up to an irrelevant overall phase. Alice sends a success bit: one for this outcome and zero for the other. Bob keeps his qubit only on success. This proves heralded remote preparation of an arbitrary qubit:The other outcome leaves $|{\psi }^{\perp }⟩$ at Bob's side; the protocol makes no claim of success in that branch.

For a block of $n$ targets, share $n$ independent singlet states. Alice measures her $j$th qubit in the basis $|{\psi }_j⟩,|{\psi }_j^{\perp }⟩$. She sends one bit indicating whether all $n$ outcomes were of the successful kind. Because the pairs are independent, all-success has probability $2^{-n}$; conditioned on it, Bob's joint state is precisely ${⨂}_{j=1}^n|{\psi }_j⟩$. Thus one-bit heralding of a remote state preparation block givesOn failure Bob discards the block, so he does not need a list of which component states failed.

For asymptotic remote state preparation by block indexing, prelabel a supply of independent candidate blocks, each containing $n$ singlet states. Alice measures blocks until she finds the first all-success block, of index $J$. She does not send a flag after each trial. Since $q=2^{-n}$ is the success probability of each block,This geometric distribution is independent of the target states. The probability of never succeeding is ${\lim }_{k\to \infty }(1-q{)}^k=0$. Alice needs to communicate only $J$; Bob retrieves the labelled qubits in that block, and thereby knows that every requested state was prepared exactly.

Here is an explicit prefix code for a rare geometric success. Set $M=2^n$ and divide $J-1=MQ+R$, where $0\le R<M$. Encode $Q$ as $Q$ ones followed by zero, then encode $R$ in exactly $n$ bits. Bob can decode this without knowing any target-state description. The message length is $L=n+Q+1$. With $r=(1-q{)}^M$,Since $(1-1/M{)}^M\le e^{-1}$,This version succeeds exactly with probability one and has the stated expected classical communication cost. It consumes $n\mathbb{E}J=n{2}^n$ singlet states on average, compatible with the unlimited entanglement assumption.

There is also a fixed-message-length version. Try at most $K=n{2}^n$ candidate blocks and send the first successful index, or a zero codeword reporting that none succeeded. Encoding the $K+1$ possibilities uses $\lceil {\log }_2(K+1)\rceil =n+{\log }_{2}n+O(1)$ bits. Its failure probability isThus fixed-length communication approaches one bit per state with success probability tending to one; variable-length communication achieves exact eventual success with expected cost approaching one bit per state. Before the index arrives, Bob's unconditional state remains independent of the target descriptions, in agreement with the no-signalling theorem.

For the Kraus operators of the measurement in quantum mechanics, the Born rule givesThe density matrix $A_i\rho A_i^{†}$ is the unnormalized state of that outcome. It is positive, its trace is $p_i$, and completeness gives ${\sum }_i{p}_i=\mathrm{Tr}\rho =1$. There is no conditional state to assign to an event with $p_i=0$.

For a projective measurement, each $P_i$ is an orthogonal projection, satisfying $P_i=P_i^{†}=P_i^2$. Completeness becomes ${\sum }_i{P}_i=I$. Fix $v$ in the range of $P_j$. ThenSince $P_{j}v=v$, the $j$th summand already equals $\Vert v{\Vert }^2$. All other summands are nonnegative, so $P_{i}v=0$ for $i\ne j$. Consequently $P_i{P}_j=0$, and taking adjoints also gives $P_j{P}_i=0$. This proves the stronger completeness forces orthogonality of measurement projections:

For the unitary dilation of a measurement instrument, take a quantum ancilla with orthonormal states $|0⟩,|1⟩,\dots ,|n⟩$, initially in $|0⟩$. DefineThe completeness equation impliesso $V$ is an isometry. Its action on the input subspace can be extended to a unitary operator $U$ on the enlarged system:Choose orthonormal bases in the two complementary subspaces and map one to the other. Their dimensions agree; the extra unused quantum ancilla level also ensures this extension is possible for an infinite-dimensional system. After the coupling, the joint density matrix is

Now perform a projective measurement on the larger system, withThese are pairwise orthogonal and sum to the full identity. The unused $|0⟩$ level has zero weight in $\Omega$, so merging it into outcome one adds no probability. For every $i$,Its trace is $p_i$, and taking the partial trace over the quantum ancilla after normalization gives exactly ${\rho }_i$. Hence unitary coupling to an quantum ancilla, a projective measurement, and discarding the quantum ancilla reproduce both the probabilities and the conditional states of the general measurement. This is the instrument version of a Stinespring dilation, rather than a construction reproducing only the outcome probabilities.

For each hidden variable $\lambda$, a deterministic local hidden-variable model assigns values $a_i(\lambda ),b_j(\lambda )\in \{0,\dots ,d-1\}$ to all settings. The responses depend only on the local setting; their averaging distribution is setting independent, as required by measurement independence.

Let $T(\lambda )$ be the sum of the nonnegative modular representatives in the chained modular Bell inequality. Before reduction modulo $d$, the chain telescopes:Reduction changes this integer only by multiples of $d$. Since all reduced terms are nonnegative,The smallest possible nonnegative value in this residue class is $d-1$. Averaging over the hidden variable provesAdding local random seeds to $\lambda$ gives the same result for stochastic local hidden-variable theories.

For the coplanar qubit realization of the chained Bell inequality, shareAt angle $\theta$ in the $xz$ plane, use the projective measurement of the observableHere ${\sigma }_x,{\sigma }_z$ are Pauli matrices, and the classical bit $a$ records eigenvalue $(-1{)}^a$. Since $⟨{\sigma }_z\otimes {\sigma }_z⟩=⟨{\sigma }_x\otimes {\sigma }_x⟩=1$ and both crossed expected values vanish in this Bell state,The one-party expected values vanish, so the complete joint probabilities areFor binary outcomes, $[a-b]$ is one exactly when $a\ne b$, while $[b-a-1]$ is one exactly when $a=b$. Consequently

For $N\ge 2$, set $\delta =\pi /(2N)$ and choose Alice's angle ${\theta }_i=2(i-1)\delta$ and Bob's angle ${\varphi }_i=(2i-1)\delta$. Every adjacent pair $A_i,B_i$ or $B_i,A_{i+1}$ differs by $\delta$, giving expectation ${\sin }^2(\delta /2)$. The closing pair has angle difference $(2N-1)\delta =\pi -\delta$; its agreement probability is also ${\sin }^2(\delta /2)$. Thus every one of the $2N$ terms contributes equally:Indeed $\sin x<x$ for $x>0$, so this value is below ${\pi }^2/(8N)\le {\pi }^2/16<1$. For an explicit two-setting instance, Alice measures ${\sigma }_z,{\sigma }_x$ and Bob measures $({\sigma }_z+{\sigma }_x)/\sqrt{2},(-{\sigma }_z+{\sigma }_x)/\sqrt{2}$. The four relevant expected values sum toviolating the local bound one. At $N=1$ there is no violation; the two terms always sum to one. As $N\to \infty$, the displayed quantum value is asymptotic to ${\pi }^2/(8N)$ and approaches the algebraic lower bound zero.

The violation rules out a local hidden-variable theory with setting-independent preassigned local responses reproducing these quantum correlations. It does not permit faster-than-light communication: the joint formula gives each local outcome probability $1/2$, independent of the remote setting, as required by the no-signalling theorem. The contradiction concerns the joint correlations and the Bell assumptions, not the ability to send a signal.

The generalized measurement postulate specifies Kraus operators $M_{i\alpha }$, where $i$ is the recorded outcome and $\alpha$ permits unobserved alternatives for that outcome, satisfyingFor a density operator $\rho$, outcome $i$ has probability and conditional stateWith one operator per outcome, this is the usual formula $p_i=\mathrm{Tr}(M_i\rho M_i^{†})$, ${\rho }_i=M_i\rho M_i^{†}/p_i$. The positive operators $E_i={\sum }_{\alpha }{M}_{i\alpha }^{†}{M}_{i\alpha }$ form a POVM, while the state-update maps form a quantum instrument.

The full postulate reduces to the usual projective measurement with the Lüders update when there is one operator per outcome and $M_i=P_i$, with $P_i=P_i^{†}=P_i^2$, $P_i{P}_j=0$ for $i\ne j$, and ${\sum }_i{P}_i=I$. Then $p_i=\mathrm{Tr}(P_i\rho )$ and ${\rho }_i=P_i\rho P_i/p_i$. Projective effects $E_i=P_i$ alone ensure these probabilities but do not fix the state update: an additional outcome-dependent unitary could still be applied. The choice $M_i=P_i$ makes the required projective state-update condition explicit.

Normalize the vector defining the first effect and write $E_1=\alpha |\psi ⟩⟨\psi |$. Since the two effects sum to $I$, the eigenvalues of $E_2=I-E_1$ are $1-\alpha$ along $\psi$ and $1$ on its orthogonal complement. For $E_2$ to have rank one, $\alpha =1$. Hence this binary rank-one qubit POVM is a projective measurement:The two Bloch vectors are antipodal on the Bloch sphere; the corresponding state vectors are orthogonal. The plot below chooses one representative unit vector. Rotating both directions gives every other case. The sphere represents the effect projectors' Bloch directions, rather than plotting their matrix entries.

Take the labels $r,s\in \{0,\dots ,n-1\}$, with basis indices read modulo $n$. There is a missing hypothesis in the printed claim: the root of unity must be primitive. For example, when $n=2$ and $\omega =1$, the two labels $(0,0)$ and $(1,0)$ produce the identical state $(|00⟩+|11⟩)/\sqrt{2}$, so they are not orthogonal. More generally, if the order of $\omega$ is $d<n$, changing $r$ to $r+d$ repeats a state. The orthonormality claim is false for a nonprimitive root.

For the intended result, choose a primitive root of unity, for example $\omega =e^{2\pi i/n}$. Since $|\omega |=1$, expansion in the orthonormal basis givesIf $r=r^{\prime }$, the sum is $n$. If $r\ne r^{\prime }$ modulo $n$, primitiveness gives $q={\omega }^{r^{\prime }-r}\ne 1$ while $q^n=1$, and the finite geometric series is $(1-q^n)/(1-q)=0$. ThusThere are $n^2$ vectors in an $n^2$-dimensional Hilbert space, so they form the generalized Bell basis. Each has equal Schmidt coefficients $1/\sqrt{n}$ and is a maximally entangled state.

For qudit teleportation, let $C$ be Alice's unknown input, write $|\chi {⟩}_C={\sum }_j{\alpha }_j|j{⟩}_C$, and let Alice and Bob share $|\Phi {⟩}_{AB}=n^{-1/2}{\sum }_k|k{⟩}_A|k{⟩}_B$. Alice holds $C,A$ and Bob holds $B$. Define the qudit shift and phase operatorsBoth are unitary. Alice makes a joint projective measurement of $C,A$ in the generalized Bell basis, with projectors $|{\psi }_{rs}⟩⟨{\psi }_{rs}|$. Completeness follows from the orthonormality just proved.

For outcome $(r,s)$, contracting the corresponding bra with the joint input and resource gives Bob's unnormalized state:The Born rule therefore gives $p_{rs}=1/n^2$, since $X^s{Z}^{-r}$ preserves the input norm. Conditional on this outcome, Bob holds $X^s{Z}^{-r}|\chi ⟩$. Alice sends him the classical label $(r,s)$, and he applies its inverse in the displayed order:The corrected receiver state is exactly the unknown input state for every outcome. Alice needs no knowledge of the amplitudes. The label has $n^2$ possibilities and can be encoded in $\lceil {\log }_2(n^2)\rceil$ classical bits; when $n$ is a power of two this is exactly $2{\log }_{2}n$. The protocol consumes the shared maximally entangled state and the original carrier is measured, so it does not retain an additional copy of the unknown state.

Equivalently, the complete joint quantum state has the teleportation expansionIt follows from the contraction calculation and completeness of the generalized Bell basis. After correction the branch operators are all $I/n$, so their sum defines the identity quantum channel: ${\sum }_{r,s}(I/n)\rho (I/n)=\rho$. Acting on the input part of a joint state with a reference gives the same identity, which proves teleportation as an identity channel on a reference and extends the protocol to mixed inputs.

Before receiving the label, Bob instead has the outcome-averaged stateTo check the equality, averaging over $r$ kills the off-diagonal matrix entries by the same root-of-unity sum; averaging the cyclic shifts $s$ makes every diagonal entry the total trace divided by $n$. This is the Heisenberg-Weyl twirling channel. Thus the classical message is necessary to recover the input, consistently with the no-communication theorem derived in Question 1.

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 $\varphi =j\pi /2$ for an integer $j$, and put $q=j\mathrm{mod}2$. Use the fixed phase-measurement angles $(\theta ,0,-\varphi )$ and a fixed final computational basis measurement. Denote their outcomes by $k,l,m,s$. The adaptive construction would instead use $-\varphi$ when $l=0$ and $+\varphi$ when $l=1$.

For the printed measurement vectors,Therefore $+\varphi$ and $-\varphi$ define the same unordered pair of rank-one linear projections; the labels are exchanged if and only if $q=1$. In the branch $l=1$, the outcome that would be called $m_{\mathrm{ad}}$ in the adaptive experiment is thus $m\oplus q$. In both branches,The output correction from the preceding part becomesIf $j$ is even this reduces to $s\oplus k\oplus m$; if $j$ is odd an additional $l$ is included. This equatorial measurement relabeling at Clifford angles changes only the classical interpretation, not any physical measurement basis.

All four fixed single-qubit projective measurements act on different vertices, so their operators commute. They can be performed simultaneously, with the displayed classical correction applied afterward. The first angle $\theta$ may be arbitrary: it was never adaptive. Only the sign choice for the third angle needed to be replaced. Thus the simulation is nonadaptive for every $\varphi \in (\pi /2)\mathbb{Z}$.

Write $a=|\alpha {|}^2$, $b=|\beta {|}^2=1-a$, so $1/2<a<1$ and $0<b<1/2$. Regrouping the four copies by party giveswhere $z(x)$ counts zeroes. Alice must measure only this count, preserving coherence inside each degenerate eigenspace, rather than measuring her four bits separately. Her projective measurement has projectors ${\Pi }_k={\sum }_{z(x)=k}|x⟩⟨x|$, and the Born rule givesAlice sends $k$ to Bob. Up to the common phase of ${\alpha }^k{\beta }^{4-k}$, their conditional pure state isThis is Schmidt projection entanglement concentration: its equal Schmidt coefficients give a maximally entangled state of Schmidt rank $d_k$.

For $k=0$ or $4$, $d_k=1$, and the branch is a product state. No Bell pair can be extracted using local operations and classical communication. The respective probabilities are $b^4$ and $a^4$.

For $k=1$ or $3$, $d_k=4$. List the four surviving strings in lexicographic order as $x_0,x_1,x_2,x_3$. For $k=1$ this list is $0111,1011,1101,1110$; for $k=3$ it is $0001,0010,0100,1000$. Each party applies a local unitary operation extending the basis relabellingSuch a unitary exists because these are four distinct orthonormal basis vectors mapped to four distinct basis vectors; extend the mapping to a permutation of all sixteen. Discarding the two fixed local ancillary bits leavesThus these branches give exactly two Bell pairs, with probabilities $4a{b}^3$ and $4a^{3}b$, and no further measurement in quantum mechanics is needed.

For $k=2$, the six strings in lexicographic order are $x_0=0011$, $x_1=0101$, $x_2=0110$, $x_3=1001$, $x_4=1010$, $x_5=1100$. A suitable local POVM gives two Bell pairs with certainty, rather than losing some of these branches to a simple subspace projection. Partition these labels into the three pairs $T_0=\{0,1\}$, $T_1=\{2,3\}$, $T_2=\{4,5\}$. Alice uses the Kraus operatorsOn the six-dimensional support, each label is retained by two operators, so ${\sum }_{r=0}^2{K}_r^{†}{K}_r={\Pi }_2$. Add $K_{\perp }=I-{\Pi }_2$ to define a complete measurement in quantum mechanics on Alice's four qubits; that extra outcome has probability zero on this branch. Each nonzero outcome has conditional probability $(1/2)(4/6)=1/3$, and gives the normalized stateAlice sends $r$ to Bob. Both parties relabel the four surviving strings in increasing order to $|00⟩,|01⟩,|10⟩,|11⟩$ on two output qubits, with two fixed ancillary bits, just as above. Every $r$ therefore gives two Bell pairs. The joint probability of $(k,r)=(2,r)$ is $p_2/3=2a^2{b}^2$ for each $r$.

For an explicit local implementation of this POVM, Alice can append an ancilla in a fixed state and apply an isometry on the six-dimensional support,It preserves inner products, extends to a unitary on system and ancilla, and measuring the ancilla realizes precisely the operators $K_r$. No nonlocal operation has been used. This is a deterministic reduction of maximally entangled Schmidt rank from six to four.

The complete output distribution for this strategy is consequentlyThe mean yield is $2(1-a^4-b^4)$ pairs per four-copy block. These are the maximum possible pair counts after the stipulated count measurement: any nonzero branch has Schmidt rank at most six, whereas three independent Bell pairs require Schmidt rank eight. In any refined LOCC branch the coefficient matrix is multiplied by local matrices on the left and right, which cannot increase its rank.

They need a pre-shared entanglement resource that permits deterministic production of a Bell pair. In particular, one shared Bell pair and two classical bits suffice for exact quantum teleportation. This condition is stronger than merely having some entanglement.

Let Alice's input be $|\psi {⟩}_C=\alpha |0⟩+\beta |1⟩$, and let her system $A$ and Bob's system $B$ share $|{\Phi }^{+}{⟩}_{AB}=(|00⟩+|11⟩)/\sqrt{2}$. Use the Bell states $|{\Phi }^{\pm }⟩=(|00⟩\pm |11⟩)/\sqrt{2}$ and $|{\Psi }^{\pm }⟩=(|01⟩\pm |10⟩)/\sqrt{2}$. Direct expansion givesAlice performs a projective measurement in this Bell basis and sends its two-bit outcome. Each outcome has probability $1/4$. Bob applies respectively $I,Z,X,ZX$, recovering $|\psi ⟩$ exactly, without either party knowing $\alpha ,\beta$. Before he receives the outcome, his averaged state is $I/2$, so the protocol does not communicate without the classical message. Alice's measurement consumes the input and the shared entanglement.

For necessity, exact transmission of every pure qubit means the induced quantum channel is the identity: pure-state projectors span the operator space, and a physical channel is linear. Alice can therefore prepare a Bell pair locally and transmit one half by the proposed protocol, leaving a Bell pair shared with Bob. The protocol would itself be a deterministic local operations and classical communication conversion of their resource into a Bell pair. This proves the exact teleportation resource criterion. With no shared entanglement, it is impossible: local operations and classical communication preserve separable quantum states, whereas the resulting Bell pair would be entangled.

In the generalized measurement postulate, outcome $m$ is described by a Kraus operator $M_m$, with ${\sum }_m{M}_m^{†}{M}_m=I$. On a density operator $\rho$ its probability and conditional output, for nonzero probability, areFor a pure input the conditional vector is $M_m|\psi ⟩/\sqrt{p_m}$. The effects $E_m=M_m^{†}{M}_m$ are positive and sum to the identity, defining a positive operator-valued measure.

More generally an outcome can have several Kraus operators $M_{m\alpha }$. Then sum over $\alpha$ in both the numerator and the probability, and require ${\sum }_{m,\alpha }{M}_{m\alpha }^{†}{M}_{m\alpha }=I$.

The usual projective measurement with the Lüders rule is recovered when the measurement operators are mutually orthogonal projections, $M_m=P_m=P_m^{†}=P_m^2$, $P_m{P}_n=0$ for $m\ne n$, and ${\sum }_m{P}_m=I$. Projector-valued effects alone give projective outcome statistics; to obtain the Lüders state update as well, the instrument must implement $\rho \mapsto P_m\rho P_m$, without an additional conditional state change.

Label an orthonormal basis of the $n$-dimensional Hilbert space by $j=0,\dots ,n-1$, with indices modulo $n$. LetThese are the shift and phase Heisenberg-Weyl operators. Alice holds the input $S$ and one half $A$ of the shared maximally entangled stateShe measures $SA$ in the generalized Bell basisIts inner products areThere are $n^2$ orthonormal vectors in an $n^2$-dimensional space, so this is a complete projective measurement.