Distillable entanglement of Bell-diagonal states

Problem

What is the distillable entanglement \(D(\rho_{\mathbf p})\) under local operations and classical communication (LOCC) for the Bell-diagonal state

\begin{equation} \rho_{\mathbf p} =p_I\lvert\Phi^+\rangle\!\langle\Phi^+\rvert +p_X\lvert\Psi^+\rangle\!\langle\Psi^+\rvert +p_Y\lvert\Psi^-\rangle\!\langle\Psi^-\rvert +p_Z\lvert\Phi^-\rangle\!\langle\Phi^-\rvert? \tag{1} \end{equation}

What is this LOCC protocol?

The Bell states in Eq. (1) are defined by

\begin{equation} \lvert\Phi^\pm\rangle:=\frac{\lvert00\rangle\pm\lvert11\rangle}{\sqrt2}, \qquad \lvert\Psi^\pm\rangle:=\frac{\lvert01\rangle\pm\lvert10\rangle}{\sqrt2}. \tag{2} \end{equation}

Equation (2) fixes the phase convention. Assume \(\sum_i p_i=1\) and \(p_I\ge1/2\ge p_i>0\) for \(i\in\{X,Y,Z\}\).

Source

The problem is implicit in the gap between the Bell-diagonal distillation protocols of Bennett et al. and the PPT-based converse bounds introduced by Rains [BDSW96], [Rai99].

Progress

The Rains bound gives

\begin{equation} D(\rho_{\mathbf p})\le 1-h_2(p_I), \qquad h_2(x):=-x\log_2x-(1-x)\log_2(1-x). \tag{3} \end{equation}

Equation (3) is the relevant upper bound for the present Bell-diagonal family [Rai99], [Rai01].
The hashing protocol gives

\begin{equation} D(\rho_{\mathbf p})\ge\max\{0,1-H(\mathbf p)\}, \qquad H(\mathbf p):=-\sum_i p_i\log_2p_i. \tag{4} \end{equation}

Recurrence followed by hashing improves on the direct use of Eq. (4) and shows that \(D(\rho_{\mathbf p})>0\) whenever \(p_I>1/2\) [BBP+96], [BDSW96].
Two-way protocols can strictly exceed the hashing rate in Eq. (4). Recurrence–hashing interpolation improves the rate for every full-rank entangled Bell-diagonal state, including the high-fidelity regime \(p_I\to1\) [VV05]. Adaptive protocols give related improvements for Werner/depolarizing states [HDM06], [AJSS26]. Most recently, a receding-horizon search over asymptotic parity-check protocols produced higher numerical yields for qubit Werner states across a broad tested fidelity range, thereby improving the corresponding known lower bounds on depolarizing-channel two-way capacity. This is a constructive lower-bound improvement, not a determination of \(D(\rho_{\mathbf p})\) [BP26].

Comment

The exact LOCC distillable entanglement is not known for a general full-rank Bell-diagonal state; the gap between constructive lower bounds and the Rains upper bound remains the central question.

References

[Rai99]: E. M. Rains, “An Improved Bound on Distillable Entanglement,” Physical Review A 60, 179–184 (1999).DOI arXiv
[Rai01]: E. M. Rains, “A Semidefinite Program for Distillable Entanglement,” IEEE Transactions on Information Theory 47, 2921–2933 (2001).DOI arXiv
[BBP+96]: C. H. Bennett, G. Brassard, S. Popescu, B. Schumacher, J. A. Smolin, and W. K. Wootters, “Purification of Noisy Entanglement and Faithful Teleportation via Noisy Channels,” Physical Review Letters 76, 722–725 (1996).DOI arXiv
[BDSW96]: C. H. Bennett, D. P. DiVincenzo, J. A. Smolin, and W. K. Wootters, “Mixed-State Entanglement and Quantum Error Correction,” Physical Review A 54, 3824–3851 (1996).DOI arXiv
[VV05]: K. G. H. Vollbrecht and F. Verstraete, “Interpolation of Recurrence and Hashing Entanglement Distillation Protocols,” Physical Review A 71, 062325 (2005).DOI arXiv
[HDM06]: E. Hostens, J. Dehaene, and B. De Moor, “Asymptotic Adaptive Bipartite Entanglement Distillation Protocol,” Physical Review A 73, 062337 (2006).DOI arXiv
[AJSS26]: D. Abdelhadi, T. Jochym-O’Connor, V. Siddhu, and J. Smolin, “Adaptive Channel Reshaping for Improved Entanglement Distillation,” Physical Review Research 8, 013018 (2026).DOI arXiv
[BP26]: M. Barber and S. Pirandola, “Heuristic Lookahead Distillation Protocol Search,” arXiv preprint (2026).arXiv

Distillable entanglement of Bell-diagonal states

Problem

Source

Progress

Comment

References

Cite this problem

BibTeX

Plain text

Problem

Source

Progress

Comment

References

Related problems