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.