For a bipartite density operator , the reduced state of subsystem is the partial trace . Every measurement performed only on has outcome probabilities determined entirely by .
Suppose two density operators on have the same reduced density matrix . Every measurement confined to then has the same outcome probabilities for the two preparations: a POVM effect has probability in either case. This remains true when contains several laboratories brought together for a joint measurement.
For independent copies, the accessible states are both . No collective measurement on those copies can distinguish the original preparations. Adaptive local processing also cannot help, since applying the same quantum operation to equal inputs gives equal outputs. Access to an additional environment measurement record is a change of resources, and can reveal differences hidden by the partial trace.
A trace-preserving operation on subsystem cannot change the reduced density matrix of a disjoint subsystem when its unobserved outcomes are averaged. Local measurements on therefore cannot reveal which operation was chosen on .
For local Kraus operators with , let . For every remote operator , cyclicity of the trace gives . Hence the remote reduced density matrix is unchanged. In particular every remote POVM has the same outcome probabilities, proving the no-communication theorem from the measurement rule rather than assuming it as a physical postulate.
A bipartite density operator is a product state when it factors as . A pure product state factors as ; its reduced density matrices have rank one and zero entanglement entropy. Mixed product states can have nonzero marginal Von Neumann entropy.
A nonzero bipartite pure state is a product state if and only if all its partial inner products on the first subsystem lie in a common one-dimensional vector subspace of the second. For a product , every contraction equals . Conversely, contract against each vector of an orthonormal basis to write . If for a common nonzero , then . Zero conditional vectors are allowed. A nontrivial linear dependence relation requires multipliers not both zero; allowing both multipliers to vanish would give no test at all.
Write a two-qubit pure state as and form its coefficient matrix . The state is a product state exactly when has rank one, equivalently when
A bipartite density operator is entangled when it is not a separable quantum state. For a pure state, this is equivalent to not being a product state, or to either reduced density matrix having rank greater than one.
For two systems of equal dimension , no joint pure state guarantees equal outcome labels whenever both systems undergo the same arbitrary basic measurement. Equal outcomes in the computational basis would force . On any two coordinates j,k, changing both bases to the real sum/difference pair makes the different-outcome amplitude , so all coefficients must agree. Changing both to the imaginary-phase pair makes a different-outcome amplitude , so those coefficients must also be negatives. They must all vanish, contradicting normalization. The one-dimensional case is an exception.
The requirement of all complex bases matters. A maximally entangled vector does produce matching labels if one party uses a basis and the other its coordinatewise complex conjugate basis. Conjugate-state steering from a maximally entangled pair gives this conjugation explicitly. Identical real bases are a special case, not evidence for identical arbitrary complex bases.
Quantum entanglement between electromagnetic polarization degrees of freedom. For example, is a Bell state of two photons; neither photon separately has a definite horizontal polarization or vertical polarization in this description.
Entanglement distillation uses local operations and classical communication on many noisy entangled states to produce fewer high-fidelity Bell pairs. It is also called entanglement purification. The protocol may fail or abort; naming a purification step does not guarantee successful output for arbitrary inputs. If the output is an exact pure state of Bell pairs, every purification of a density operator factors between those pairs and the environment, so measuring each pair in the computational basis gives a shared uniform bit independent of an eavesdropper. Approximate privacy follows when the entire retained output is sufficiently close to that pure target. A separable quantum state cannot be distilled into a Bell pair by LOCC, because each local branch preserves separability.
Entanglement dilution uses local operations and classical communication to prepare partially entangled states from maximally entangled states, such as Bell pairs. For many identical bipartite pure targets, the asymptotic cost in Bell pairs per target, allowing a vanishing approximation error, is their entanglement entropy in bits. The quantum typical subspace of the target's Schmidt coefficients has almost all its weight and dimension at most . A maximally entangled state of this dimension can be converted to the normalized truncated target by Nielsen's pure-state conversion theorem. The resulting state approaches the full target as the retained weight tends to one. Average monotonicity of pure-state entanglement entropy and entropy continuity give the converse lower bound. This is the reverse asymptotic task to entanglement concentration.
For , every bipartition of has Schmidt rank , while copies of a GHZ state have Schmidt rank . Schmidt-rank contraction under product operators therefore forbids any exact successful LOCC branch when . Approximate entanglement dilution avoids this obstruction by retaining only a high-weight quantum typical subspace, whose dimension has logarithm . Exact finite-block conversion and asymptotically faithful conversion are different tasks.
For nonnegative with , Alice applies Kraus operators and to one half of a Bell state. Their squared effects sum to the identity, and both outcomes have probability one half. The first branch is the target; the second becomes the target after both parties apply Pauli X gates. Sending the outcome by classical communication makes this exact deterministic entanglement dilution, rather than a postselected conversion.
An entanglement monotone quantifies entanglement without increasing on average under local operations and classical communication. The average is over recorded measurement in quantum mechanics outcomes: individual successful branches can have more entanglement, provided their probabilities compensate for that increase. This distinction makes an entanglement monotone useful for bounding probabilistic state conversion. A pure-state entanglement monotone need only satisfy this inequality on pure input states and pure conditional branches, with local measurement outcomes refined to individual Kraus operators.
The relative entropy of entanglement is the smallest quantum relative entropy from a density operator to a separable quantum state, with the separable set specified for the relevant division into parties. Nonnegativity of quantum relative entropy implies . For a separable quantum state, choosing gives . For finite-dimensional bipartite states, compactness of the separable set and lower semicontinuity of the relative entropy give the converse. The support convention is unless .
For a bipartite pure state, the squared Schmidt coefficients are the nonzero eigenvalues of either reduced density matrix. Their sum except the largest defines . The largest eigenvalue is a convex function, since ; consequently is concave. If Alice measures locally and records outcome , Bob's conditional reductions satisfy . Concavity gives . For Bob's measurements use Alice's unchanged average reduction instead. Iteration proves average monotonicity under LOCC. For Schmidt rank at most two, is the smaller squared Schmidt coefficient. A conversion succeeding with probability therefore obeys , since failure branches contribute nonnegative amounts.
For a normalized pure state of two qubits with coefficient matrix , the concurrence is . It ranges from zero for a product state to one for a maximally entangled state.
For a normalized pure two-qubit state written in a magic basis, concurrence is , while . This bilinear sum uses no complex conjugation inside its square; replacing it by would incorrectly give maximal concurrence for every state.
For a normalized two-qubit pure state with coefficient matrix , concurrence is . The displayed convex roof extension defines its mixed-state version. Combining decompositions proves convexity: . Every separable quantum state has a decomposition into product vectors, each with zero determinant, so its concurrence is zero.
For , with invertible , a pure coefficient matrix transforms as . Its unnormalized determinant is multiplied by . The invertible filter bijects pure decompositions before and after conditioning, with branch weights rescaled by their success probabilities. Taking both infima in the convex roof extension gives the displayed exact scaling. If either filter has rank one, the retained state is separable across that party.
Entanglement concentration probabilistically converts partially entangled pure states into fewer maximally entangled states by local operations and classical communication.
For one pure rank-two entangled state with descending squared Schmidt coefficients , the success operator gives a Bell pair with probability . The complementary operator makes a valid quantum instrument. Optimality follows from the Schmidt-tail entanglement monotone: a successful Bell branch has smallest weight , so its probability cannot exceed . Failure branches have nonnegative monotone and cannot loosen this bound.
For a pure state with two descending squared Schmidt coefficients , this quantum instrument acts in one party's Schmidt basis. The first outcome balances the two Schmidt amplitudes when , with probability . This is not the optimal unrestricted success probability in single-copy entanglement concentration. An embedding in a larger subsystem requires a POVM on the occupied support or a full-space completion.
For copies of a normalized pure state , regroup Alice's and Bob's tensor factors. Alice performs a projective measurement of the total number of zeroes, preserving all coherence among strings with that count. The outcome has binomial distributionEach retained string has the same complex amplitude , so, up to a common phase, the conditional quantum state isIts equal Schmidt coefficients make it a maximally entangled state of Schmidt rank . Alice sends the count to Bob. They can relabel the corresponding local computational basis strings with local unitary operations, and convert the resulting resource to Bell pairs. Measuring the individual bits instead would reveal the entire string and leave a product state.
For , a projective measurement of the number of ones in one party's local qubits gives a common type class of size . The conditional pure state is . It can be converted exactly and deterministically to a uniform common-label state of any dimension : one party measures an -element subset with Kraus operator , and all parties relabel their common retained labels after receiving . Choosing gives independent GHZ states. Stirling's formula and the weak law of large numbers give in probability. Measuring every local bit separately would instead destroy the coherence and leave a product state.
The Bell states and both have reduced state on either qubit. No measurement on one qubit alone can distinguish their relative sign.
Articles by others on the same topic
There are currently no matching articles.