Dephased Bell-state mixture Created 2026-10-06 Updated 2026-10-07
For real , this two-qubit density operator has equal and populations and off-diagonal coherences . It is a pure state exactly when , and a separable quantum state exactly when . Its partial transpose has eigenvalues , directly witnessing entanglement for every nonzero admissible coherence.
Entangled state Created 2026-09-24 Updated 2026-10-05
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.
Entanglement distillation 2026-10-14
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 witness Created 2026-09-28 Updated 2026-10-05
An entanglement witness is a Hermitian operator such that for every separable quantum state , but for at least one entangled state .
Suppose Alice holds a classical orthogonal flag for the phase of a Bell state:
Her local controlled phase correction maps this to . Thus Alice and Bob recover an exact Bell pair without revealing its bit value. Even if Eve knows the flag, purity decouples a subsystem from its purification, so the corrected pair can supply a private bit. Discarding the flag first can instead yield a separable quantum state, as happens at .
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.
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.
First explain the stated local conversion. The four equally weighted correlated local Pauli operations , , , and remove coherences in the Bell states basis, since those states have distinct joint parity eigenvalues. This leaves four Bell probabilities. One-party Pauli operations permute the Bell projectors, so the largest probability can be placed on the singlet . Call it ; necessarily .
The two common unitaries found above generate permutations of the three triplet projectors: exchanges and , and exchanges and . Averaging the six triplet permutations replaces their weights by their common mean, while collective-unitary covariance of the two-qubit singlet fixes the singlet projector. This is Bell twirling followed by triplet symmetrization, producing the specified two-qubit Werner state. Shared randomness coordinates the local choices, so the procedure is allowed by local operations and classical communication. Common unitaries alone would preserve the original singlet weight, which need not initially be at least ; the preceding one-party permutation is what ensures that range.
For the eigenvalue calculation, put , , and . Then . In the ordered computational basis , transposing the second subsystem gives
The block has eigenvalues and , while the other two basis vectors also have eigenvalue . Thus the partial transpose spectrum is
The last three are positive throughout the given range, so the partial transpose is not positive exactly when . A separable quantum state is a convex sum of product density operators, each still positive after transposing one factor. The negative eigenvalue therefore proves entanglement.
For completeness, separability on the other side can be proved explicitly rather than inferred solely from a theorem name. Let be the one-qubit Pauli eigenprojectors. At , the mixture of six antiparallel product states is
using . It is manifestly separable. For ,
with nonnegative coefficients summing to one; is also separable. Consequently
At the boundary the partial transpose has a zero eigenvalue and the explicit decomposition shows separability.
Use base-two logarithms, so entanglement entropy is measured in bits. Write for the binary entropy, with . Taking a partial trace over any two parties removes the off-diagonal terms: the two traced strings are orthogonal. Consequently all three one-party reduced density matrices of the first pure state are
Each division into two groups is one party versus the other two. The Schmidt coefficients are and , so the entanglement entropy across each of , and is . For the second pure state, set : every one-party reduced density matrix is , and all three entanglement entropies are one bit.
For every pair , the first pure state instead gives the reduced density matrix
This is a separable quantum state, explicitly a convex combination of two product states. Its relative entropy of entanglement is therefore zero: in , choose to attain zero, while nonnegativity of quantum relative entropy excludes a negative value. The same argument with equal weights applies to the second pure state. Thus
The pairwise density matrices contain classical correlations, despite the entanglement of the global pure state; discarding a party loses the coherence between its two branches.
The entanglement entropy of independent source copies across any cut is , whereas copies of the target GHZ state have entanglement entropy . Average monotonicity of pure-state entanglement entropy under LOCC gives for exact successful forward branches. In a reversible asymptotic conversion the reverse direction similarly prevents a first-order deficit, since . For asymptotically faithful outputs, a continuity bound for quantum conditional entropy with trivial conditioning changes these inequalities only by . Hence the reversible leading-order rate is
The zero pairwise relative entropies of entanglement are consistent with this conversion: no independent pairwise resource has to be supplied or removed.
There is a qualification to the literal finite-block formulation in the source. For , the Schmidt rank of the exact state of source copies is , whereas target GHZ states have Schmidt rank . Every refined LOCC branch acts by a product of local linear operators and cannot increase this Schmidt rank. For , the displayed rate has for sufficiently large blocks when , so an exact successful reverse conversion is impossible, irrespective of its claimed probability. The exact dilution obstruction from Schmidt rank is avoided in the usual asymptotic formulation by allowing outputs approaching the desired pure state. The leading-order rate above and the exact forward protocol below remain valid; neither establishes the source's stronger exact round-trip claim. At the two states are identical. At or , the source is a known product state, the rate is zero, and local preparation supplies any desired number of source copies.
No secure key can be produced. The off-diagonal terms in the two Bell state projectors cancel, giving the separable quantum state
A possible purification of a density operator is . Eve measures her register in the computational basis and learns whether Alice and Bob have or . Their apparently shared random bit is therefore completely known to Eve. Conditioned on her record the Alice–Bob state is a known product state; public discussion and local private randomness cannot create a shared secret unknown to that record. The state has no distillable secret key in the stated purification model.
Insecure as a proposed test-and-purify protocol: the basis string and check positions are announced before receipt. Eve can intercept and store the travelling qubits until the announcement. For each data position with basis bit , she measures the stored qubit in the basis . If the outcome is , the Alice–Bob pair becomes
and Eve knows . She forwards that qubit, and forwards every publicly identified check qubit untouched. After Bob's Hadamard gate decoding, every data pair is the known product state , while the unmodified check pairs remain perfect. Thus the check bit error rate is zero even though Eve knows all raw data bits. This is premature basis announcement in quantum key distribution.
The retained data are a separable quantum state with a classical label held by Eve; LOCC cannot turn them into private Bell pairs. Consequently the listed check does not justify the claimed success of the subsequent entanglement purification. A sound purification procedure that independently detects the missing entanglement must fail or abort on this attack. If Step 9 were instead read as an independently guaranteed production of private, nearly perfect Bell pairs, their subsequent key would of course be private; the flaw is that this protocol's test cannot establish that guarantee. Naming an EPP does not repair the information leak or the invalid sampling test.
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 , and let her system and Bob's system share . Use the Bell states and . Direct expansion gives
Alice performs a projective measurement in this Bell basis and sends its two-bit outcome. Each outcome has probability . Bob applies respectively , recovering exactly, without either party knowing . Before he receives the outcome, his averaged state is , 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.
The equal mixture of and cancels their off-diagonal coherence, leaving the separable quantum state
A trivial LHV model chooses a shared random bit , uniformly zero or one, and prepares both local qubits in . Each party uses the local Born rule for its own chosen spin direction, with independent local random seeds if a deterministic description is desired. This reproduces the entire joint measurement distribution, not merely the -axis correlation.
Since the state has an explicit local hidden-variable theory for these local measurements, it cannot violate the CHSH inequality, by the derivation in part (b). Classical correlation of the shared preparation bit is sufficient; the cancellation of coherence removes the entanglement.
The useful object is the Choi state of the entanglement-breaking channel. Put , introduce a reference with the same computational basis as , and use the normalized maximally entangled state
The entanglement-breaking channel makes a separable quantum state. Its partial trace is , because is a quantum channel. Write a separable positive operator decomposition
Discard any term with : a positive operator with zero trace is zero. Define
Each is a density operator. Each is a positive operator, and taking the matrix transpose of the partial trace identity gives
Thus the form a POVM. In this reference-first convention, the Choi reconstruction formula is
The factor is essential because we used a normalized Choi state. A measurement channel storing the outcome , followed by the prescribed quantum state preparation of , has precisely this action on every linear operator . The desired factorization is therefore
Every separable quantum state has positive partial transpose. Here the partial transpose is
with eigenvalues . Any nonzero therefore gives a negative eigenvalue, excluding a separable quantum state. At , the explicit decomposition
is a mixture of product states. Consequently
Only necessity of the positive partial transpose criterion is needed here; sufficiency at zero follows directly from the decomposition.
The partial transpose of the spin singlet state projector is the Hermitian operator
For every separable quantum state , the positive partial transpose criterion and the trace-adjoint identity for partial transpose give
For the specified Bell state, however,
Thus is an entanglement witness detecting . In fact, it detects any state whose overlap with that Bell state exceeds .
Use two precise finite-dimensional results. The positive-map separability criterion says that a state on is separable exactly when for every positive linear map . The Størmer-Woronowicz decomposability theorem says that every such map is a decomposable positive map, so
with completely positive maps and the matrix transpose on .
If has positive partial transpose, both and are positive. Hence
The positive-map separability criterion now proves that is a separable quantum state. The dimension-specific decomposability theorem is essential: the conclusion does not extend to arbitrary bipartite dimensions.
A bipartite density operator has positive partial transpose when in a product basis. Positivity is independent of the choice of local bases, although the matrix representing the partial transpose changes.
If the state is a separable quantum state, write . Taking its partial transpose gives
Indeed, the matrix transpose preserves the nonnegative eigenvalues of each local density operator; a tensor product of positive semidefinite operators is positive, and so is their nonnegative sum. This proves the necessary direction of the positive partial transpose criterion.