Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Physical Review A

Optimal enhancement of the fidelity of two qubits.

Frank Verstraete, Henri Verschelde

Published Jan 1, 2002• 6 citations
OpenAlex

Abstract

We consider a single copy of a mixed state of two qubits and prove tight lower and upper bounds for its fidelity in terms of its concurrence or negativity. Next we derive the optimal filtering operations and the optimal trace-preserving local operations assisted by classical communication (LOCC) such as to maximize the fidelity of a given copy of a mixed state of two qubits. The optimal LOCC operations turn out to be very simple and implementable by 1-LOCC protocols, and always yield a fidelity larger then 1/2 if the original state was entangled.

Related papers

Optimal Teleportation with a Mixed State of Two Qubits

Frank Verstraete, Henri Verschelde

We consider a single copy of a mixed state of two qubits and derive the optimal trace-preserving local operations assisted by classical communication such as to maximize the fidelity of teleportation that can be achieved with this state. These optimal local operations turn out to be implementable by one-way communication and always yield a teleportation fidelity larger than 2/3 if the original state is entangled. This maximal achievable fidelity is an entanglement measure and turns out quantifying the minimal amount of mixing required to destroy the entanglement in a quantum state.

arXiv:quant-ph/0303007•Physical Review Letters•Mar 5, 2003•166 citations

Fidelity of mixed states of two qubits

Frank Verstraete, Henri Verschelde

We consider a single copy of a mixed state of two qubits and show how its fidelity or maximal singlet fraction is related to the entanglement measures concurrence and negativity. We characterize the extreme points of a convex set of states with constant fidelity, and use this to prove tight lower and upper bounds on the fidelity for a given amount of entanglement.

arXiv:quant-ph/0203073•Physical Review A•Aug 12, 2002•110 citations

Purification of two-qubit mixed states

E. Jané

We find the necessary and sufficient condition under which two two-qubit mixed states can be purified into a pure maximally entangled state by local operations and classical communication. The optimal protocol for such transformation is obtained. This result leads to a necessary and sufficient condition for the exact purification of $n$ copies of a two-qubit state.

arXiv:quant-ph/0205107•Quantum Information and Computation•Aug 1, 2002•12 citations

Local Discrimination of Mixed States

John Calsamiglia, Julio I. de Vicente, R. Muñoz-Tapia +1 more

We provide rigorous, efficiently computable and tight bounds on the average error probability of multiple-copy discrimination between qubit mixed states by local operations assisted with classical communication (LOCC). In contrast with the pure-state case, these experimentally feasible protocols perform strictly worse than the general collective ones. Our numerical results indicate that the gap between LOCC and collective error rates persists in the asymptotic limit. In order for LOCC and collective protocols to achieve the same accuracy, the former can require up to twice the number of copies of the latter. Our techniques can be used to bound the power of LOCC strategies in other similar settings, which is still one of the most elusive questions in quantum communication.

arXiv:1004.5522•Physical Review Letters•Aug 18, 2010•71 citations

Optimal estimation of an unknown maximally entangled state with local operations and classical communication

ShengLi Zhang, Xu‐Bo Zou, Ke Li +2 more

We consider the optimal measurement procedures for estimating an unknown maximally entangled state with local operations and classical communications (LOCC). By the ``optimal,'' we mean that there is no other LOCC measurements that can provide a higher estimation fidelity. In fact, we first use the positive partial transpose constraint to obtain an upper bound of the fidelity; then, we show there exists a kind of LOCC measurement that can attain such a bound. The estimation fidelity of the optimal LOCC estimation procedures is $\frac{D+2}{(D+1){D}^{2}}$ with $D$ denoting the dimension of the relevant quantum system.

Physical Review A•Oct 18, 2007•3 citations

Classical Communication Helps Single-Shot Quantum Compression

Omri Farber, Gilad Gour

Free classical communication can yield an unbounded single-shot saving in quantum compression, even though it leaves the asymptotic rate of an i.i.d. source unchanged. At every fixed error in $(0,1)$, we exhibit sources whose unassisted compression cost is arbitrarily large, yet a single qubit suffices with classical communication and no preshared entanglement. We establish this separation by determining the exact optimal source fidelity for compression through an $m$-dimensional noiseless quantum channel, with and without free classical communication, while preserving correlations with an inaccessible reference. Without classical assistance, the optimal fidelity is exactly the Ky Fan norm $\|ρ\|_{(m)}$, the sum of the $m$ largest eigenvalues of the source state. With classical assistance, we obtain an explicit spectral threshold formula and a protocol attaining it. Classical communication strictly improves fidelity whenever $m$ is smaller than the source rank. The corresponding compression costs are two smoothed versions of the log-rank entropy, also called max-entropy: trace-distance smoothing under local operations and quadratic smoothing under LOCC. For i.i.d. copies of a fixed source with positive entropy variance, however, the two costs have identical first-, second-, and third-order asymptotic terms. For nonlattice spectra, we determine the constant-order advantage: classical communication saves $\log_2(e)-1$ bits per block asymptotically, and the ratio of assisted to unassisted minimum communication dimensions converges to $2/e$.

quant-pharXiv:2610.14785•Oct 13, 2026•0 citations
We consider a single copy of a mixed state of two qubits and prove tight lower and upper bounds for its fidelity in terms of its concurrence or negativity. Next we derive the optimal filtering operations and the optimal trace-preserving local operations assisted by classical communication (LOCC) such as to maximize the fidelity of a given copy of a mixed state of two qubits. The optimal LOCC operations turn out to be very simple and implementable by 1-LOCC protocols, and always yield a fidelity larger then 1/2 if the original state was entangled.
We consider a single copy of a mixed state of two qubits and derive the optimal trace-preserving local operations assisted by classical communication such as to maximize the fidelity of teleportation that can be achieved with this state. These optimal local operations turn out to be implementable by one-way communication and always yield a teleportation fidelity larger than 2/3 if the original state is entangled. This maximal achievable fidelity is an entanglement measure and turns out quantifying the minimal amount of mixing required to destroy the entanglement in a quantum state.
We find the necessary and sufficient condition under which two two-qubit mixed states can be purified into a pure maximally entangled state by local operations and classical communication. The optimal protocol for such transformation is obtained. This result leads to a necessary and sufficient condition for the exact purification of nnn copies of a two-qubit state.
We provide rigorous, efficiently computable and tight bounds on the average error probability of multiple-copy discrimination between qubit mixed states by local operations assisted with classical communication (LOCC). In contrast with the pure-state case, these experimentally feasible protocols perform strictly worse than the general collective ones. Our numerical results indicate that the gap between LOCC and collective error rates persists in the asymptotic limit. In order for LOCC and collective protocols to achieve the same accuracy, the former can require up to twice the number of copies of the latter. Our techniques can be used to bound the power of LOCC strategies in other similar settings, which is still one of the most elusive questions in quantum communication.
We consider the optimal measurement procedures for estimating an unknown maximally entangled state with local operations and classical communications (LOCC). By the ``optimal,'' we mean that there is no other LOCC measurements that can provide a higher estimation fidelity. In fact, we first use the positive partial transpose constraint to obtain an upper bound of the fidelity; then, we show there exists a kind of LOCC measurement that can attain such a bound. The estimation fidelity of the optimal LOCC estimation procedures is D+2(D+1)D2\frac{D+2}{(D+1){D}^{2}}(D+1)D2D+2​ with DDD denoting the dimension of the relevant quantum system.
Free classical communication can yield an unbounded single-shot saving in quantum compression, even though it leaves the asymptotic rate of an i.i.d. source unchanged. At every fixed error in (0,1)(0,1)(0,1), we exhibit sources whose unassisted compression cost is arbitrarily large, yet a single qubit suffices with classical communication and no preshared entanglement. We establish this separation by determining the exact optimal source fidelity for compression through an mmm-dimensional noiseless quantum channel, with and without free classical communication, while preserving correlations with an inaccessible reference. Without classical assistance, the optimal fidelity is exactly the Ky Fan norm ∥ρ∥(m)\|ρ\|_{(m)}∥ρ∥(m)​, the sum of the mmm largest eigenvalues of the source state. With classical assistance, we obtain an explicit spectral threshold formula and a protocol attaining it. Classical communication strictly improves fidelity whenever mmm is smaller than the source rank. The corresponding compression costs are two smoothed versions of the log-rank entropy, also called max-entropy: trace-distance smoothing under local operations and quadratic smoothing under LOCC. For i.i.d. copies of a fixed source with positive entropy variance, however, the two costs have identical first-, second-, and third-order asymptotic terms. For nonlattice spectra, we determine the constant-order advantage: classical communication saves log⁡2(e)−1\log_2(e)-1log2​(e)−1 bits per block asymptotically, and the ratio of assisted to unassisted minimum communication dimensions converges to 2/e2/e2/e.