Operator Schmidt rank 2026-10-07
The operator Schmidt rank of a bipartite linear operator is its shortest expansion as a sum of product linear operators. Expanding in local orthonormal operator bases gives a coefficient matrix; its matrix rank is the operator Schmidt rank, by a singular value decomposition. It is unchanged by invertible local operator-basis changes. A rank-one projector onto a bipartite pure state of Schmidt rank has operator Schmidt rank : its expansion contains all independent products of local matrix units.
For , the partial transpose of its pure state projector is , where is the swap operator. Expand in matrix units: becomes .
Use logarithms to base two and set . For a density matrix with eigenvalues , the Von Neumann entropy is
Thus it is the Shannon entropy of the spectrum. In dimension , each term is nonnegative, and entropy vanishes exactly when one eigenvalue is one, namely for a pure state. The Jensen inequality applied to the strictly concave function gives , with equality precisely at the maximally mixed state . Unitary conjugation preserves eigenvalues, so . Product eigenvalues give
The finite-dimensional entropy is continuous because the eigenvalues depend continuously on the matrix and is continuous also at zero.
Define the partial trace over by choosing an orthonormal basis and setting
Equivalently it is uniquely characterized by for every operator on . This identity proves basis independence. Define similarly, with . Hermiticity is preserved by the displayed sum. For each ,
Taking the trace in a product orthonormal basis gives , and the same proof works for . Thus both reductions are density matrices. This is the partial trace positivity from product vectors argument.
For a bipartite pure state , expand in a product orthonormal basis with coefficient matrix . A singular value decomposition gives the Schmidt decomposition
with orthonormal families on both sides. Taking the two partial traces makes all cross terms vanish:
The spectra may have different numbers of zeros but have identical nonzero eigenvalues. Consequently the reduced entropies coincide:
This common value is the entanglement entropy. In infinite-dimensional trace-class systems the same partial-trace and Schmidt arguments apply, and the equality remains valid with the value allowed; the bound is specifically finite-dimensional.
For completeness, the basic mixing and correlation properties also admit short proofs. Define quantum relative entropy by when supports are included, and by otherwise. Here is its nonnegativity proof without merely citing an operator inequality. Diagonalize with eigenvalues , and let be the squared overlaps of their eigenbases. Both row and column sums of are one. The scalar inequality , with zero cases taken by limits, gives
Equality forces on every nonzero overlap, hence . For , expanding the trace definition yields
which proves Concavity of Von Neumann entropy.
The complementary entropy bounds for a quantum mixture are
To prove the upper bound, write the spectral pure-state decompositions of the as one ensemble with weights . Form the column matrix with columns . Its two Gram operators have the same nonzero spectrum: one is , and the other, , has diagonal . Relative entropy against gives . Since and , the bound follows. Zero-weight columns are omitted.
Finally the support of is contained in . Indeed, a vector in a marginal kernel gives a sum of nonnegative product-vector expectations equal to zero; positivity forces the corresponding product vectors into the kernel of . The operator identity on this support and the partial-trace identities give
This proves Subadditivity of Von Neumann entropy, with equality exactly for a product state. Purify by adjoining a third system, using its spectral decomposition. Equality of pure-state marginal entropies gives and . Subadditivity on systems then gives ; swapping gives the Araki–Lieb inequality . These finite-dimensional proofs establish the usual basic entropy bounds, rather than attributing all mixed-state behavior to pure-state Schmidt decompositions.
The Schmidt decomposition and local unitary operations put any entangled two-qubit pure state into
Both Schmidt coefficients are nonzero. Alice performs a two-outcome generalized measurement with Kraus operators
Their effects sum to the identity, so this is a legitimate local measurement in quantum mechanics. On success,
The normalized output is the Bell state . Bob's unitary matrix maps it to the spin singlet state. Alice communicates her success flag; no shared quantum operation is needed. At the filter is the identity and success is certain. This is the singlet target case of optimal stochastic conversion of a two-qubit pure state.
For dichotomic local outcomes , the CHSH inequality is
It assumes a local hidden-variable theory with freely chosen settings independent of the hidden-variable distribution. For the spin singlet state, direct evaluation of its Pauli matrices correlations gives
Choose , , , and . The four correlations are , respectively, giving
The success flag must be recorded and communicated before the subsequent independent choice of Bell-test settings. This conditioning is legitimate because setting-independent heralding preserves Bell locality: a putative local hidden-variable theory for the entire sequential experiment would, after successful filtering, still have local response functions with a setting-independent conditional hidden-variable distribution. More explicitly, if the hidden variable is and is the already determined success flag, conditioning changes its distribution to but leaves
Classical messages used in preparation can be included in ; none are exchanged during the spacelike Bell measurements. Such a conditioned model still obeys the CHSH inequality, contradicting the displayed singlet correlations. Therefore no local hidden-variable theory reproduces all sequential measurement correlations of any entangled two-qubit pure state. This argument does not discard outcomes on the basis of the later measurement settings.
The resource here is one copy of a two-qubit Werner state, with the physical range . The impossibility must include successful conditional branches of local operations and classical communication; average monotonicity alone would not exclude probabilistic enhancement.
For a normalized two-qubit pure state , define its concurrence as . Its mixed-state concurrence of two qubits is the convex roof extension
Combining near-optimal decompositions proves convexity. A separable quantum state has zero concurrence, because it has a decomposition into product vectors with zero coefficient determinant.
First establish the concurrence of a two-qubit Werner state. A pure state with squared Schmidt coefficients has . In this Schmidt basis a maximally entangled state has coefficient matrix with unitary. Its overlap magnitude is at most , because . Thus the singlet overlap satisfies
Averaging any decomposition of gives .
For the reverse bound use the orthonormal triplet vectors
Each is normalized, and direct evaluation of its two-by-two coefficient determinant gives . Their equally weighted six-state mixture has cancelled singlet–triplet coherences and triplet weight , so it is exactly . Hence
Every fully specified record of an LOCC protocol gives a product Kraus operator on the original pair. Local ancillas and discarded local outcomes can be included by refining the record. Write its success probability and normalized output as
For invertible , the concurrence scaling under invertible local filters is
Here is a derivation of that scaling. Each pure coefficient matrix transforms to , so its unnormalized determinant is multiplied by . If that pure component has success probability , its normalized concurrence is multiplied by , while its mixture weight becomes . Every ensemble average therefore scales by . Invertibility provides the reverse correspondence for every decomposition of , so taking both infima proves equality. If either local filter has rank one, the output is a separable quantum state and the desired bound is immediate.
It remains to show that the filter normalization cannot make this ratio exceed one. Use the Pauli matrices representation
Write the positive matrices and , so , . Taking traces gives
For completeness, squaring the middle comparison leaves , and both sides are nonnegative. This proves the single-copy Werner filtering normalization bound, and hence
Forgetting some record information or grouping several successful records mixes these branch outputs; convexity preserves the same bound. Any alleged final would therefore obey , contradicting . Thus even heralded single-copy LOCC cannot produce the specified improved Werner state. This proves that single-copy Werner filtering cannot increase concurrence. It does not forbid collective entanglement distillation from several noisy pairs; allowing additional shared entangled input copies would change the resource assumption.
A guaranteed exact overlap device would also distinguish two remotely prepared ensembles and permit a forbidden signal. Feed it a known reference and Bob's unknown state , obtained from Alice's projective measurement on a shared Bell state. A device promised to work for arbitrary unknown inputs must work on this fixed-reference subset.
Alice chooses either the computational basis or the diagonal basis . By the same remote preparation in conjugate bases, Bob receives a uniformly random member of the chosen basis. The possible exact squared overlap outputs are
These output sets are disjoint. Bob would infer Alice's basis choice from one run, without her communicating the random measurement result. Spacelike operation would contradict special relativity. Thus exact pure-state overlap readout would allow superluminal signalling, and no guaranteed exact overlap device is compatible with the stated assumptions.
This argument rules out even the phase-invariant magnitude squared. The raw complex inner product has an additional issue: replacing either pure state representative by a global phase changes that complex number without changing the physical input. The no-signalling contradiction therefore remains valid even if some phase convention is supplied. Statistical estimation from many identically prepared copies is not the promised exact single-pair readout.
Share the Bell state between Alice and Bob, and allow their actions to be spacelike separated. The projective measurement postulate gives the remote preparation in conjugate bases identity
If Alice measures in the computational basis, Bob is prepared in or , each with probability one half. If she instead measures in the conjugate basis , Bob is prepared in or , again equally likely. The conjugation is essential for a general complex unitary operator.
Interpreting distinct states as distinct physical rays, the two candidate pairs are disjoint. A hypothetical perfect identifier would tell Bob which member he received and therefore which basis Alice chose. Alice could transmit a bit by that basis choice, without sending her outcome or any other message. Bob could read it while spacelike separated from Alice, violating the no-superluminal-signalling requirement of special relativity. This establishes that perfect two-basis discrimination would allow superluminal signalling and rules out the device using the requested physical assumptions.
Ordinary measurement in quantum measurements do not signal: the two equally weighted ensembles have identical reduced density matrix
The contradiction arises from the hypothesized ability to label the ensemble's individual pure members. Global-phase variants of a vector do not count as distinct physical pure states; treating them as distinguishable labels would already introduce an unphysical extra readout.
For a density matrix on a finite-dimensional Hilbert space, its Von Neumann entropy in bits is
where are its eigenvalues and . It is the Shannon entropy of the spectrum, is zero for a pure state, and is invariant under unitary conjugation.
Take the Hadamard gate to be and the phase gate to be . This fixes the sign convention for the interference phase.
For the coherent quantum circuit, the successive quantum states are
The 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 is
After that Hadamard gate, its environment coefficient at output zero is . Squaring its norm sums over every unobserved environment outcome, so
The Cauchy-Schwarz inequality gives . In this single-qubit interference with conditional environment states, 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 follows from the specified overlap , rather than its complex conjugate.
If the same quantum decoherence occurs before the phase gate, the joint pure state is first . 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 oracle
The 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 , 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 . Since the Pauli X gate satisfies , quantum phase kickback gives
Write . Up to the irrelevant global phase , the input qubit acquires relative phase , so its ideal final computational-basis measurement returns : 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 are
Thus the diagram's usual zero-for-constant decision rule has
This is the reliability for either promised class separately, with no prior needed. For equally likely classes, if is known to be negative, reversing the interpretation gives . A known environment phase can instead be compensated by the phase gate before the final Hadamard gate, giving success probability . In particular, gives no information and 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.
Use the Hilbert-Schmidt inner product normalized by the dimension: . The identity and the three Pauli matrices are Hermitian, each has square , and each nonidentity Pauli matrix has zero trace. For distinct nonidentity indices, the Pauli matrix multiplication law gives , which is traceless. Therefore
There are four such orthonormal operators, and the complex vector space of two-by-two matrices has dimension four. Hence they form an orthonormal basis. Taking the inner product of any with each basis element proves, for arbitrary complex and not just Hermitian ones,
For example, if , its four coefficients are , , , and , respectively.
For the joint error, regard the two prescribed basis outputs as the columns of an environment-valued linear map. Its coefficient array in the usual output-row, input-column convention is
The source's other array is arranged as a column of the images of basis kets; it must not be mistaken for this coefficient array acting on an amplitude column. Applying the just-proved Pauli matrix expansion componentwise in any environment orthonormal basis gives the Pauli decomposition of a qubit-environment isometry:
To check the potentially delicate sign of the Pauli Y gate coefficient, use and . The four terms then give
Linearity proves the expansion for every input pure state. The environment coefficient vectors need not be normalized or mutually orthogonal. Consequently this expansion includes coherent combinations of Pauli errors, rather than asserting that every quantum channel is a probabilistic Pauli channel.
For the recovery probability, use the usual independent-use interpretation of the given phase-flip channel: each of the three transmitted qubits has a Pauli Z gate error independently with probability . The phase-flip repetition code uses logical codewords and . The decoding Hadamard gates convert physical phase flips to bit flips because . We can then analyze the two decoding controlled-NOT gates and the final Toffoli gate directly, rather than assuming a recovery rule.
Let be the error bits after this basis conversion. For a logical basis input , the three data bits before inverse encoding are . The two controlled-NOT gates produce
The Toffoli gate flips the first wire when both of the last two bits are one. Its residual error is
The last two wires carry an error syndrome independent of . Thus this transformation preserves the amplitudes of an arbitrary superposition: zero or one phase error returns the original unknown qubit, while two or three phase errors leave the logical Pauli X gate applied to it. The probability of universally successful recovery is therefore
Equivalently, the decoded quantum channel is , with logical failure of the three-qubit phase-flip repetition code . For , the failure probability is below , since . A special input that is a Pauli X eigenstate is unchanged even by the residual logical error; this does not make the code correct that error on an unknown input. Its squared quantum fidelity with a particular pure input is . If the errors on different channel uses are correlated, the marginal probability alone is insufficient: the general universal success probability is the probability of at most one error.
The generalized measurement postulate specifies operators with . On a density matrix , the outcome probability and conditional state are
The probabilities are nonnegative and sum to one. More generally an outcome may contain several Kraus operators , in which case one sums over in both formulas. A projective measurement with the usual Lüders update is the special case , where , and . 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 summing to . Its probabilities are . A generalized measurement gives effects , or . Conversely 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, , with normalized pure states and positive . 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 and ensemble decompositions of . Given effects , set
omitting zero effects. Each is a density matrix, , and
Conversely, if an ensemble satisfies , then are positive and sum to , 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, and ; it need not be an orthogonal measurement.
For a density matrix on a -dimensional Hilbert space, its Von Neumann entropy, in bits, is
where the are its eigenvalues and . Each summand is nonnegative, proving , with equality exactly when one eigenvalue is one and the rest zero, namely for a pure state.
We first prove the nonnegativity of quantum relative entropy needed below. Diagonalize with eigenvalues and eigenvectors , and with eigenvalues and eigenvectors . Put and . Each row of sums to one. Concavity of the ordinary logarithm gives . Consequently
The final Gibbs inequality follows directly from . Support failure gives ; zero eigenvalues can otherwise be handled by restriction or regularization. Equality requires and equality in the logarithm inequality on every positive-weight row. Thus is a eigenvector of eigenvalue wherever . The remaining diagonal entries of vanish and positivity makes the remaining rows and columns zero. Hence equality holds exactly when .
Taking gives , proving
The lower equality is attained exactly by pure states and the upper exactly by the maximally mixed state .
For , each positive-weight state has support contained in that of . Expanding the quantum relative entropy gives
This proves Concavity of Von Neumann entropy, with equality precisely when every positive-weight is the same state.
For the upper entropy bound for a quantum mixture, diagonalize each component, , and set . Form the rectangular matrix whose columns are . Then , while the Gram matrix has diagonal . The two matrices have the same nonzero eigenvalues: and map corresponding positive-eigenvalue eigenspaces isomorphically. Thus .
If there are columns, let , with . Then
All the summands have the same Von Neumann entropy. The just-proved concavity therefore implies . Finally,
We have proved both requested bounds:
For the upper equality, strictness in the concavity argument forces to be diagonal. Its entries between two positive-weight component eigenvectors then force those vectors to be orthogonal. Thus upper equality holds exactly when the supports of the positive-weight component states are mutually orthogonal. In that case their classical label is perfectly distinguishable, explaining the extra bits.
By the Schmidt decomposition theorem, suitable local unitary operations put the normalized pure state into the form
It is entangled precisely when both Schmidt coefficients are nonzero. Put , so for the case of interest. The Pauli operators
satisfy and in this pure state: fixes both basis terms, and exchanges them.
Choose Alice's two observables as , , and Bob's as
These are valid dichotomic projective measurements. Indeed, and , so ; each observable has outcomes . For the CHSH inequality convention , the quantum value is
For the original pure state, conjugate these four observables by the corresponding local unitary operators. Their outcomes and Pauli correlators are unchanged, and each party still measures only their own qubit. Thus every entangled pure two-qubit state violates CHSH for suitable local measurements, proving Gisin's theorem directly. The CHSH axes for an entangled pure two-qubit state approach a nonviolating configuration continuously as one Schmidt coefficient tends to zero; the strict violation therefore need not be large for weak entanglement.
Compute the honest one-qubit density operators in the computational basis. Writing and , the two quantum state ensembles give
The equality includes the off-diagonal coherence; comparing only the basis outcome probabilities would not suffice.
The protocol is perfectly hiding against Bob when Alice is honest. Independence of the honest preparations makes his full received density operator . For any POVM , including collective measurements and measurements using ancillas, the Born rule gives the same outcome probabilities . Thus no measurement supplies information about the committed bit.
It is not binding against Alice. Here is an explicit ensemble-steering attack on quantum bit commitment. For each position, Alice prepares the normalized two-qubit pure state
retains and sends . Its partial trace on is the honest common density operator. She sends the halves of independent copies while retaining all the halves, and chooses her bit only at unveiling.
To open one, she makes a projective measurement of each retained qubit in the computational basis. Outcome zero has probability and prepares Bob's state ; outcome one has probability and prepares . She announces that list. It has exactly the honest bit-one distribution, and every declared-state test passes.
To open zero, she instead measures each retained qubit using a three-outcome POVM with effects , where
All effects are positive. Their diagonal sums are and , and the off-diagonal sum is zero, so . This establishes that the proposed POVM is physically valid.
To verify the conditional states directly, the coefficient matrix of , with Bob's index as the row and Alice's as the column, is
A real rank-one effect on Alice's half gives the unnormalized Bob state vector . For the three effects above,
Their squared norms are therefore , exactly the honest bit-zero probabilities, and Bob's conditional pure states are the corresponding declared states. Independent measurements on the retained halves produce the honest distribution of the entire list, so even checks on the declared frequencies do not defeat the attack. Every declared-state projector test again succeeds.
Alice can consequently unveil either bit with acceptance probability one, without having chosen it when sending the qubits. This is the Hughston–Jozsa–Wootters theorem mechanism implemented by an explicit measurement, rather than merely an appeal to the general impossibility of perfectly hiding and binding quantum bit commitment.