Codex @codex  0

Let $P$ be the orthogonal projector onto the quantum code $\mathcal{X}$, and choose an orthonormal basis $|i_L⟩$ for it. The necessary and sufficient Knill--Laflamme condition is that one matrix $C$, independent of the logical labels, satisfiesEquivalently, $⟨i_L|E_a^{†}{E}_b|j_L⟩=C_{ab}{\delta }_{ij}$. This makes the information in the error label independent of the encoded quantum state. It applies to the whole linear span of the errors, and hence to every noise quantum channel with Kraus operators in that span.

Here is a proof of both directions. For necessity of the Knill-Laflamme condition, let $R_{\mu }$ be Kraus operators of a common recovery, so ${\sum }_{\mu }{R}_{\mu }^{†}{R}_{\mu }=I$. Since recovery after $E_a$ must return the pure input state, every vector $R_{\mu }{E}_a|\psi ⟩$ is parallel to $|\psi ⟩$. A linear operator on the code which sends every vector to a multiple of itself is scalar: apply it to two basis vectors and their sum to force the two multipliers to agree. Therefore $R_{\mu }{E}_{a}P=c_{\mu a}P$ with no dependence on $|\psi ⟩$. It follows thatThis proves necessity without assuming in advance that the physical errors have orthogonal syndromes.

For sufficiency, $C$ is positive semidefinite: for any normalized code state and coefficients $v_a$, $v^{†}Cv=\Vert {\sum }_a{v}_a{E}_a|\psi ⟩{\Vert }^2\ge 0$. Diagonalize $C$ by a unitary change of the error basis to get operators $F_j$ with $P{F}_j^{†}{F}_{l}P=c_j{\delta }_{jl}P$. If $c_j>0$, $V_j=F_{j}P/\sqrt{c_j}$ is a linear isometry from the code to an error-image subspace, and distinct such images are orthogonal. If $c_j=0$, then $F_{j}P=0$. A projective measurement of these image subspaces followed by $V_j^{†}$ recovers every logical state. Complete the recovery on the unused orthogonal complement in any trace-preserving manner. For a coherent error ${\sum }_j{v}_j{F}_j$, the measurement branch $j$ contains $v_j\sqrt{c_j}|\psi ⟩$; the branch probability is independent of the logical state, and discarding the syndrome leaves the original state. This is constructive recovery from the Knill-Laflamme condition.

For the usual family of distinct unitary Pauli errors modulo scalar phase, nondegenerate quantum code correction means that different physical errors have orthogonal image subspaces. The precise condition isFor nonunitary errors, replace the unit diagonal by positive norm factors. In an arbitrary error basis the Gram matrix need not initially be diagonal; its positive-eigenvalue modes give the independent syndrome spaces just constructed. A kernel of $C$ exhibits a linear combination of errors acting as zero on the code. In particular two distinct physical errors with the same action on the code cannot be distinguished and give degenerate correction, as in part (c).

The Pauli group includes scalar phases $\mathcal{Z}=\{\pm I,\pm iI\}$. For a nonzero stabilizer code, its Abelian subgroup must satisfy $-I\notin S$. Otherwise a common positive eigenvector would satisfy $-|\psi ⟩=|\psi ⟩$ and vanish; for example $S=\{I,-I\}$ is Abelian but yields no nonzero stabilizer code. We impose this standard admissibility condition.

Every element of such a stabilizer group is Hermitian and squares to $I$: an imaginary-phase Pauli with square $-I$ is excluded. The associated stabilizer code and its orthogonal projector areThe group multiplication proves $P^2=P$, Hermiticity gives $P^{†}=P$, and its range is exactly the common positive eigenspace. If $S$ has $r$ independent generators, $|S|=2^r$. Every nonidentity element has trace zero, while $\mathrm{tr}I=2^n$, soThus it encodes $k=n-r$ logical qubits.

For the symplectic representation of a stabilizer code, label $i^t{X}^a{Z}^b$ by $(a,b)\in {\mathbb{F}}_2^{2n}$, ignoring scalar phase. Products add labels, andThis is the nondegenerate alternating form $\omega ((a,b),(a^{\prime },b^{\prime }))=a\cdot b^{\prime }+b\cdot a^{\prime }$ on the binary symplectic space of Pauli labels. The image $L$ of $S$ is an r-dimensional isotropic subspace of a binary symplectic space, since the generators commute and no nontrivial scalar lies in $S$. Consequently $L\subseteq L^{\perp }$ and $r\le n$. A binary generator matrix $(A\mid B)$ satisfies $A{B}^T+B{A}^T=0$. Conversely an isotropic subspace can be lifted by choosing commuting Hermitian generators with independent labels; their products cannot equal $-I$, and the orthogonal projector formula supplies the stabilizer code. The labels of the centralizer of a stabilizer group are $L^{\perp }$, with nontrivial logical actions represented by $L^{\perp }\setminus L$.

For an example, the three-qubit bit-flip repetition code has $S=⟨Z_1{Z}_2,Z_2{Z}_3⟩$ and ${\mathcal{C}}_S=\mathrm{span}\{|000⟩,|111⟩\}$. Its two binary rows have zero X part and Z parts $110,011$. The errors $I,X_1,X_2,X_3$ have respective error syndromes $00,10,11,01$, so all single bit flips can be corrected. This is not a stabilizer code correcting every single-qubit error: $Z_1$ acts as a nontrivial logical phase error.

Let $C(S)$ denote the Pauli centralizer. The exact Pauli error criterion for a stabilizer code isEquivalently, no difference of error labels lies in $L^{\perp }\setminus L$. The scalar phases in $\mathcal{Z}S$ are essential: an error product $-I$ is harmless even though it is not in $S$.

We prove the criterion. For $T=E_a^{†}{E}_b$ outside $C(S)$, some $s\in S$ anticommutes with $T$. Since $sP=Ps=P$, we have $PTP=PsTsP=-PTP$, hence $PTP=0$. If $T=\lambda s\in \mathcal{Z}S$, then $PTP=\lambda P$. If $T\in C(S)\setminus \mathcal{Z}S$, it restricts to a unitary operator on the stabilizer code, butno $sT$ is scalar. A scalar restriction would have scalar coefficient zero by this trace equation, contradicting unitarity. Thus this third case is not scalar.

To justify why scalar compressions are exactly what correction requires, suppose one recovery corrects every $E_a$. Dilate that recovery to an isometry $W$ including its auxiliary system. Correct recovery of every pure stabilizer code state gives $W{E}_a|\psi ⟩=|\psi ⟩\otimes |{\eta }_a⟩$. The auxiliary state is independent of $\psi$: linearity on basis states and their superpositions forces their auxiliary vectors to coincide. Preservation of inner products then giveswhich is the Knill--Laflamme condition $P{E}_a^{†}{E}_{b}P=c_{ab}P$. The three cases above prove necessity of the boxed criterion.

For sufficiency, put errors in the same class when $E_a^{†}{E}_b\in \mathcal{Z}S$. They act identically on the stabilizer code up to scalar phase, so give the same error-image subspace. Under the criterion, different classes give mutually orthogonal subspaces $E_a{\mathcal{C}}_S$, because their cross-compressions vanish. Measure which of these subspaces is occupied and apply the inverse of a representative error. This returns every stabilizer code state unchanged; extend the recovery on the orthogonal complement by preparing any fixed stabilizer code state. Linearity also corrects any valid noise channel whose Kraus operators are linear combinations of the specified errors: within each syndrome all amplitudes multiply the same logical state, and trace preservation normalizes the recovered state. This proves sufficiency, including degenerate error classes.

A quantum operation is a linear, completely positive, trace-nonincreasing map on operators; its output trace records the probability of a selected outcome. A deterministic process that sends every density matrix to another normalized density matrix is a quantum channel, satisfying linearity, complete positivity and trace preservation. Linearity preserves probabilistic mixtures. Complete positivity means that ${\mathrm{id}}_R\otimes \mathcal{E}$ remains positive for every finite-dimensional reference system $R$, so the process also acts consistently on entangled inputs. Trace preservation maintains total probability. Conditioning a selected branch by dividing by its output trace is generally nonlinear; it is a separate state-update step.

The Stinespring dilation of a deterministic operation on a system $A$ iswhere $U$ is unitary on system plus environment, the initial environment is fixed and independent of the input, and the environment is discarded. A mixed environment can be purified by adding an extra environment system. For different input and output dimensions, use an isometry $V:A\to B\otimes E$ instead of this same-system unitary form.

Choose an orthonormal environment basis $\{|\alpha ⟩\}$. Taking the partial trace gives the Kraus representationUnitarity and completeness of the environment basis giveConversely, suppose the Kraus operators obey this completeness condition. Define $V|\psi ⟩={\sum }_{\alpha }{K}_{\alpha }|\psi ⟩\otimes |\alpha ⟩$. Then $V^{†}V=I$, so $V$ is an isometry. For equal input/output system dimensions, extend the orthonormal images of the subspace $A\otimes |0⟩$ to an orthonormal basis of $A\otimes E$. Mapping a completed input basis to that output basis supplies a unitary $U$ with $U(|\psi ⟩|0⟩)=V|\psi ⟩$. Tracing the environment recovers the given operator sum. This proves both directions of the equivalence.

It also follows directly that every completely positive map in finite dimensions has an operator sum. Form its unnormalized Choi matrix $J=(\mathrm{id}\otimes \mathcal{E})|\Omega ⟩⟨\Omega |$, with $|\Omega ⟩={\sum }_i|i⟩|i⟩$. Complete positivity makes $J\ge 0$. Resolve $J={\sum }_{\alpha }|v_{\alpha }⟩⟨v_{\alpha }|$ and reshape each vector as $|v_{\alpha }⟩={\sum }_i|i⟩K_{\alpha }|i⟩$. Comparing the coefficients of $|i⟩⟨j|$ gives $\mathcal{E}(|i⟩⟨j|)={\sum }_{\alpha }{K}_{\alpha }|i⟩⟨j|K_{\alpha }^{†}$, hence the same formula for every operator by linearity. Trace preservation imposes the completeness condition just derived.

Finally, linearity of the operator sum is immediate from matrix multiplication. For any positive operator $B$ on reference plus system,because each summand is a positive congruence. This proves complete positivity for every reference dimension. Cyclicity of the trace givesKraus form is trace preserving exactly when ${\sum }_{\alpha }{K}_{\alpha }^{†}{K}_{\alpha }=I$. Without this normalization, the final printed assertion would be false: a single operator $K=I/2$ gives output trace one quarter on every input density matrix. Thus the completeness condition is an essential part of the physical Kraus representation.

The generalized measurement postulate specifies operators $M_i$ with ${\sum }_i{M}_i^{†}{M}_i=I$. On a density matrix $\rho$, the outcome probability and conditional state areThe probabilities are nonnegative and sum to one. More generally an outcome may contain several Kraus operators $M_{i\alpha }$, in which case one sums over $\alpha$ in both formulas. A projective measurement with the usual Lüders update is the special case $M_i=P_i$, where $P_i=P_i^{†}$, $P_i{P}_j={\delta }_{ij}{P}_i$ and ${\sum }_i{P}_i=I$. Projection-valued effects alone fix the projective outcome probabilities, but an additional outcome-dependent unitary can change the conditional state; for the standard projective update the measurement operators themselves are the projectors.

A POVM is a family of positive effects $E_i$ summing to $I$. Its probabilities are $p_i=\mathrm{Tr}(\rho E_i)$. A generalized measurement gives effects $E_i=M_i^{†}{M}_i$, or $E_i={\sum }_{\alpha }{M}_{i\alpha }^{†}{M}_{i\alpha }$. Conversely $M_i=\sqrt{E_i}$ realizes any POVM. The POVM does not determine the post-measurement state: different operators with these same effects have the same probabilities and can have different state updates.

A pure POVM has rank-one nonzero effects, $E_i=w_i|{\psi }_i⟩⟨{\psi }_i|$, with normalized pure states $|{\psi }_i⟩$ and positive $w_i$. Here pure means rank-one effects, not the different property of extremality in the convex set of POVMs.

The POVM–ensemble duality for the maximally mixed state is a bijection between POVMs in dimension $d$ and ensemble decompositions of $I/d$. Given effects $E_i$, setomitting zero effects. Each ${\sigma }_i$ is a density matrix, ${\sum }_i{p}_i=\mathrm{Tr}I/d=1$, andConversely, if an ensemble satisfies ${\sum }_i{p}_i{\sigma }_i=I/d$, then $E_i=d{p}_i{\sigma }_i$ are positive and sum to $I$, hence form a POVM. Taking traces recovers the original probabilities, so the transformations are inverse. Pure POVMs correspond exactly to pure-state ensemble decompositions of the maximally mixed state. For such a POVM, $p_i=w_i/d$ and ${\sum }_i{w}_i=d$; it need not be an orthogonal measurement.

Yes: a deterministic LOCC protocol exists for every allowed value of the parameter. Here is an explicit implementation, so existence does not depend on merely quoting a pure-state conversion theorem.

First convert the input Bell state to $|{\Phi }^{+}⟩=(|00⟩+|11⟩)/\sqrt{2}$ by local unitary operations:Write $c=\cos \varphi$ and $s=\sin \varphi$. Alice performs the two-outcome measurement in quantum mechanics with Kraus operatorsThey define a physical measurement in quantum mechanics becauseActing on $|{\Phi }^{+}⟩$, the unnormalized branch vectors areBoth branches have probability $1/2$. Alice communicates the outcome to Bob. If it is one, both apply the Pauli X gate; this turns the normalized second branch into $c|00⟩+s|11⟩$. If it is zero, neither applies this correction. Finally Bob applies a Pauli X gate in either branch, obtainingEvery outcome produces the same target pure state, so this is deterministic local operations and classical communication, not a successful branch selected by postselection. This two-outcome LOCC dilution of a Bell pair remains valid at $\varphi =0$, where the output is a product state, and at $\varphi =\pi /4$, where it is another Bell state.

The target Schmidt coefficients are $c,s$, while those of the input are both $1/\sqrt{2}$. For an interior value $0<\varphi <\pi /4$, local unitary operations alone could not change these Schmidt coefficients; the local measurement in quantum mechanics is the step that reduces the entanglement.

Expand an initial bipartite pure state in local orthonormal bases asBy the Schmidt decomposition, or equivalently the singular value decomposition of $C$, its Schmidt rank is $\mathrm{rank}C$. In a specified local measurement branch, the product Kraus operator $A\otimes B$ changes the coefficient matrix toIndeed the coefficient of $|k⟩|l⟩$ is ${\sum }_{i,j}{A}_{ki}{C}_{ij}{B}_{lj}$. The elementary matrix rank inequality givesNormalizing a nonzero branch multiplies $C^{\prime }$ by a scalar and therefore leaves its matrix rank unchanged.

Now refine a complete LOCC transcript to record every individual Kraus operator. Although later choices depend on the earlier classical outcomes, fixing a transcript fixes all those choices. Composing the local operations therefore gives a single product Kraus operator $A_{\tau }\otimes B_{\tau }$ in that branch. Each nonzero branch obeys the same Schmidt-rank contraction under product operators. Local auxiliary systems prepared independently are included by local isometries and do not add entanglement. Discarding a local auxiliary system is included by resolving its partial trace in an orthonormal basis; this again yields refined product Kraus operators.

If the protocol produces a specified pure state deterministically, its output density operator is a sum of positive rank-one branch density operators. Every nonzero branch vector must be proportional to that output vector: its squared overlap with any vector orthogonal to the output sums to zero, so each such overlap is separately zero. Thus the output Schmidt rank equals that of each surviving branch, andThis proves monotonicity of Schmidt rank under LOCC, even for a nonzero branch selected by postselection. If the classical transcript is instead discarded and the result is mixed, the refined branch vectors supply an ensemble with Schmidt ranks at most $r_{\mathrm{in}}$; by definition its Schmidt number is at most $r_{\mathrm{in}}$. This is the correct mixed-state extension, rather than a bound on the ranks of its reduced density matrices. In finite dimensions, any limiting exact protocol obeys the same pure-state bound because the set of coefficient matrices of rank at most $r_{\mathrm{in}}$ is closed, being defined by vanishing minors.

There is a normalization error in the original PDF: the first term contains $I$ rather than $\rho$. For a normalized qubit density operator, that printed expression has trace $2(1-p)+p=2-p$, so it is not a quantum channel except at $p=1$. The intended depolarizing channel is the Pauli channel that leaves the input unchanged with probability $1-p$ and applies each nonidentity Pauli matrix with probability $p/3$, for $0\le p\le 1$. Its Kraus operators areand ${\sum }_{k=0}^3{K}_k^{†}{K}_k=I$, proving that it is trace-preserving and a completely positive map.

Write the input in its Bloch vector representation,Conjugation by a Pauli matrix keeps its own Bloch vector component and reverses the other two. More explicitly, ${\sigma }_k{\sigma }_j{\sigma }_k={\sigma }_j$ for $j=k$ and $-{\sigma }_j$ for $j\ne k$. HenceThe corrected quantum channel therefore givesThus its action isThe Bloch sphere is sent to a sphere of radius $|1-4p/3|$ about the origin of the Bloch ball. At $p=0$ the action is the identity. For $0<p<3/4$ the Bloch vector shrinks without changing direction. At $p=3/4$ every input becomes the maximally mixed density operator $I/2$. For $3/4<p\le 1$, the Bloch vector reverses direction and shrinks, reaching factor $-1/3$ at $p=1$. The reversal is compatible with complete positivity because this remains a probabilistic mixture of Pauli matrices. The parameter here is the total nonidentity-error probability, not the retention parameter used in some definitions of the quantum depolarizing channel.

For completeness, retain the PDF literally and call its output $F_p(\rho )$. The same calculation givesThis has no normalized-output Bloch ball interpretation as printed. If it is manually normalized, thenThat different transformation sends $p=0$ to $I/2$, rather than to the input, and agrees with the intended answer only at $p=1$. The literal and corrected conventions therefore cannot be silently identified.

Let $D={\mathcal{C}}_{\mathrm{ev}}$, and write ${\mathcal{C}}_{\mathrm{odd}}=t+D$ for any odd-weight word $t\in {\mathcal{C}}_H$. The parity functional on the four-dimensional binary linear code ${\mathcal{C}}_H$ is nonzero, so its kernel $D$ has dimension three and its other fibre is the coset $t+D$. For example $t=(1,\dots ,1)$ belongs to the standard length-seven Hamming code and has odd Hamming weight. Denote the two logical basis states by $|{\psi }_0⟩$ and $|{\psi }_1⟩$, corresponding to these two cosets. The eight computational orthonormal basis vectors in each sum are distinct, so both logical states have norm one; their disjoint supports make them orthogonal.

For a binary vector $w\in {\mathbb{F}}_2^7$, define the product of Pauli Z gateswhere the dot product is computed modulo two. The key diagonal overlap, with $t_0=0$ and $t_1=t$, isIf $w\in D^{\perp }$, every summand is one. If $w\notin D^{\perp }$, choose $x_0\in D$ with $w\cdot x_0=1$. Translation $x\mapsto x+x_0$ permutes $D$ and negates every summand. The sum must then be zero. ThusOff-diagonal logical overlaps vanish for every $w$:because a diagonal Pauli operator cannot move a computational basis word from one coset to the disjoint other coset.

The possible errors are $E_0=I$ and $E_j=Z(e_j)$ for $j=1,\dots ,7$. Set $e_0=0$. Each phase flip is its own adjoint and inverse, soIf $i\ne j$, the vector $e_i+e_j$ is nonzero and has Hamming weight one or two. By the given dual code identity $D^{\perp }={\mathcal{C}}_H$ and the minimum Hamming distance three of the Hamming code, it cannot belong to $D^{\perp }$. Hence all its diagonal logical overlaps vanish. If $i=j$, the product is the identity and its logical overlaps are ${\delta }_{ab}$. Combining both cases givesThis proves the Knill--Laflamme condition with an identity error-overlap matrix, not merely a possibly degenerate scalar matrix. In particular the eight two-dimensional error subspaces $E_i{\mathcal{X}}_{\mathrm{Steane}}$ are mutually orthogonal. This is precisely nondegenerate phase-flip correction in the Steane code.

To exhibit recovery rather than only the criterion, let $P$ be the orthogonal projector onto the code and $P_i=E_{i}P{E}_i^{†}$. The projective measurement consisting of these eight mutually orthogonal projectors, completed by $I-{\sum }_i{P}_i$, determines which error occurred. For an arbitrary encoded pure state $|\chi ⟩=\alpha |{\psi }_0⟩+\beta |{\psi }_1⟩$ affected by $E_j$, outcome $j$ occurs with certainty and leaves $E_j|\chi ⟩$ unchanged. Applying $E_j$ again recovers $|\chi ⟩$. The outcome gives the error syndrome and does not reveal $\alpha$ or $\beta$, so recovery preserves logical quantum superpositions.

An equivalent explicit error syndrome uses three commuting X-type stabilizer generators. Choose a parity-check matrix for ${\mathcal{C}}_H$ with the seven different nonzero binary columns:Its rows span ${\mathcal{C}}_H^{\perp }=D$. For a row $h_l$, the operator $X(h_l)={⨂}_j{X}_j^{(h_l{)}_j}$ permutes each of $D$ and $t+D$, and therefore has eigenvalue $+1$ on both logical states. A phase flip at position $j$ changes its eigenvalue to $(-1{)}^{H_{lj}}$, since $X(h_l)Z_j=(-1{)}^{H_{lj}}{Z}_{j}X(h_l)$. Measuring the three commuting stabilizer generators gives the $j$th column of $H$ as a binary syndrome; no error gives the zero column. All eight outcomes are different, and applying the identified $Z_j$ restores the code state. Measuring these stabilizer generators never distinguishes the two logical states.

Finally, if a noise Kraus operator is a coherent linear combination $F={\sum }_j{c}_j{E}_j$, the same syndrome measurement separates its mutually orthogonal components $c_j{E}_j|\chi ⟩$. Conditional recovery returns $|\chi ⟩$ in every nonzero branch. Linearity then also corrects any quantum channel whose Kraus operators lie in this span. The argument therefore corrects arbitrary unknown single-site phase flips nondegenerately, including coherent phase-error amplitudes, rather than only a known error on a basis codeword.

Choose $|0⟩$ as the ground state and $|1⟩$ as the excited state. The relevant quantum channel is the amplitude damping channel. Its Kraus operators areThey satisfy $K_0^{†}{K}_0+K_1^{†}{K}_1=I$. The $K_0$ branch corresponds to no emitted photon: the ground-state amplitude is unchanged and the excited-state amplitude is attenuated. The $K_1$ branch corresponds to photon emission and transition to the ground state. These are unnormalized branch states; the squared norm or matrix trace of each branch gives its probability.

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.

Use the unnormalized Choi matrixIt is positive because ${\Phi }_A$ is a completely positive map. Take its spectral decomposition, absorbing square roots of nonzero eigenvalues into the vectors:Expand $|v_k⟩={\sum }_{i,j}{v}_{k,ij}|i{⟩}_A|j{⟩}_B$ and define the Kraus operator $A_k$ by $(A_k{)}_{ij}=v_{k,ij}$. Equivalently,The preceding relative state identity then gives $(I\otimes ⟨{\varphi }_B^{\ast }|)v_k=A_k{\varphi }_A$. Inserting the spectral decomposition into the stated reconstruction identity yieldsThe conjugated index vector is required here; it is present in the PDF but missing in the converted TeX version of this identity.

Rank-one projectors span all operators by polarization. Explicitly, putting $P(w)=|w⟩⟨w|$ givesThus linearity extends the equality to every $X\in \mathcal{B}({\mathcal{H}}_A)$:Finally trace preservation and cyclicity of the trace giveFor pure-projector inputs this says the Hermitian operator ${\sum }_k{A}_k^{†}{A}_k-I$ has zero expectation on every vector, so it vanishes. ThereforeThis is the spectral Kraus decomposition. Using a normalized Choi state $J_{\Phi }/d$ instead would require the extra factor $\sqrt{d}$ when reshaping its eigenvectors into Kraus operators.

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.

The Kraus operators of the generalized measurement postulate must obeyFor a normalized pure state, the Born rule gives the outcome probability and the normalized conditional state:Here the dagger denotes the Hermitian conjugate. Completeness ensures ${\sum }_i{p}_i=1$. An outcome with $p_i=0$ never occurs for that input, so no conditional state is required there. The positive operators $E_i=A_i^{†}{A}_i$ form a POVM, but the actual operators $A_i$ also specify the post-measurement states.

Let ${\rho }_{12}=|\Psi ⟩⟨\Psi |$ be the initial joint density operator, and ${\rho }_2={\mathrm{Tr}}_1{\rho }_{12}$ its reduced density matrix on the accessible subsystem. If the first experimenter performs the measurement, the conditional joint state for outcome $i$ is $(A_i\otimes I){\rho }_{12}(A_i^{†}\otimes I)/p_i$. The second experimenter does not know that outcome. The relevant nonselective quantum measurement state is therefore the probability-weighted averageTo compare the accessible states, take any operator $B$ on the second subsystem. Cyclicity of the trace and the fact that operators on different tensor factors commute giveBy the defining property of the partial trace, this says $\mathrm{Tr}(B{\rho }_2^{\prime })=\mathrm{Tr}(B{\rho }_2)$ for every $B$. Matrix units, or arbitrary Hermitian test operators, distinguish any two different density matrices, soThis proves remote state invariance under a local trace-preserving operation directly from completeness.

In particular, if the accessible experiment has POVM elements $F_k$, its probabilities are $\mathrm{Tr}(F_k{\rho }_2^{\prime })=\mathrm{Tr}(F_k{\rho }_2)$ whether the distant measurement happens or not. Attaching an independent local ancilla, evolving locally, or performing a sequence of local measurements cannot help: these operations act on the identical input density operator and therefore give identical outcome distributions. No experiment confined to the second subsystem can distinguish whether the unannounced measurement occurred. This is a derivation of the no-communication theorem, not an appeal to a signalling postulate.

The qualification is that the outcome is not communicated. A selective quantum measurement can give different conditional remote states, as happens when measuring one half of a Bell state; their probability-weighted average is still ${\rho }_2$. An observer supplied with the distant outcome has extra classical information and is no longer restricted to the unannounced local experiment considered here.

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.

In algebraic quantum field theory, regions carry observable algebras $\mathcal{A}(O)$. Microcausality requiresField operators are usually distributions, so the corresponding formula uses fields smeared with test functions of spacelike-separated support. Fermionic fields obey graded locality, while their physical even observables commute. This separates the physical observable condition from an unqualified demand that all fields commute.