Reuse & Permissions

It is not necessary to obtain permission to reuse this article or its components as it is available under the terms of the Creative Commons Attribution 4.0 International license. This license permits unrestricted use, distribution, and reproduction in any medium, provided attribution to the author(s) and the published article's title, journal citation, and DOI are maintained. Please note that some figures may have been included with permission from other third parties. It is your responsibility to obtain the proper permission from the rights holder directly for these figures.

Export citation

Export citation

Choose format for download:

Download Citation
  • Open Access

Adaptive channel reshaping for improved entanglement distillation

Dina Abdelhadi1,*, Tomas Jochym-O’Connor2,3, Vikesh Siddhu2,4, and John Smolin2

  • *Contact author: dinaabdelhadiquantum@gmail.com

Phys. Rev. Research 8, 013018 – Published 12 January, 2026

DOI: https://doi.org/10.1103/8kdf-37gp

Abstract

Quantum communication and computation heavily rely on entanglement distillation protocols. There is a plethora of distillation protocols for Pauli channels and also for some non-Pauli channels. However, an effort to relate the effectiveness of these protocols for different types of noise has been missing. For most quantum channels, the gap between the existing lower and upper bounds on distillation rates is substantial, and improvements of achievable rates have been stagnant for decades. In this work, we improve the best known distillation lower bounds, for both the amplitude damping and depolarizing channels. We build on a key observation that distillation protocols reshape several uses of a very noisy channel into a better effective channel. We apply this channel processing in an adaptive and recurrent manner. For the amplitude damping channel, our suggested protocol reshapes the channel into an erasure channel, achieving rates exceeding the best known lower bound given by the channel’s reverse coherent information. For the depolarizing channel, we introduce the Greedy recurrence protocol with proven performance guarantees and construct a combined protocol improving upon previously known distillation rates. Improved bounds on attainable distillation rates give insights for both practical implementations and theoretical understanding of quantum information processing.

View figure in article

Physics Subject Headings (PhySH)

Article Text

References (32)

  1. 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, Phys. Rev. Lett. 76, 722 (1996).
  2. C. H. Bennett and P. W. Shor, Quantum information theory, IEEE Trans. Inf. Theory 44, 2724 (1998).
  3. H. Barnum, E. Knill, and M. A. Nielsen, On quantum fidelities and channel capacities, IEEE Trans. Inf. Theory 46, 1317 (2000).
  4. D. Kretschmann and R. F. Werner, Tema con variazioni: Quantum channel capacity, New J. Phys. 6, 26 (2004).
  5. C. H. Bennett, D. P. DiVincenzo, and J. A. Smolin, Capacities of quantum erasure channels, Phys. Rev. Lett. 78, 3217 (1997).
  6. S. Lloyd, Capacity of the noisy quantum channel, Phys. Rev. A 55, 1613 (1997).
  7. P. W. Shor, Quantum error correction (2002), https://www.slmath.org/workshops/203/schedules/1181.
  8. I. Devetak, The private classical capacity and quantum capacity of a quantum channel, IEEE Trans. Inf. Theory 51, 44 (2005).
  9. I. Devetak and A. Winter, Distillation of secret key and entanglement from quantum states, Proc. R. Soc. A 461, 207 (2005).
  10. K. G. H. Vollbrecht and F. Verstraete, Interpolation of recurrence and hashing entanglement distillation protocols, Phys. Rev. A 71, 062325 (2005).
  11. M. Horodecki, P. Horodecki, and R. Horodecki, Unified approach to quantum capacities: Towards quantum noisy coding theorem, Phys. Rev. Lett. 85, 433 (2000).
  12. I. Devetak, M. Junge, C. King, and M. B. Ruskai, Multiplicativity of completely bounded p-norms implies a new additivity result, Commun. Math. Phys. 266, 37 (2006).
  13. R. García-Patrón, S. Pirandola, S. Lloyd, and J. H. Shapiro, Reverse coherent information, Phys. Rev. Lett. 102, 210501 (2009).
  14. C. H. Bennett, D. P. DiVincenzo, J. A. Smolin, and W. K. Wootters, Mixed-state entanglement and quantum error correction, Phys. Rev. A 54, 3824 (1996).
  15. A. W. Leung and P. W. Shor, Adaptive entanglement purification protocols with two-way classical communication, arXiv:quant-ph/0702156.
  16. E. Hostens, J. Dehaene, and B. De Moor, Publisher’s note: Asymptotic adaptive bipartite entanglement-distillation protocol, Phys. Rev. A 73, 062337 (2006); 74, 019903 (2006).
  17. M. M. Wilde, Quantum Information Theory, 2nd ed. (Cambridge University Press, Cambridge, 2017).
  18. J. Watrous, The Theory of Quantum Information, 1st ed. (Cambridge University Press, Cambridge, 2018).
  19. B. Schumacher and M. A. Nielsen, Quantum data processing and error correction, Phys. Rev. A 54, 2629 (1996).
  20. M. M. Wolf and D. Pérez-García, Quantum capacities of channels with small environment, Phys. Rev. A 75, 012303 (2007).
  21. I. Devetak and P. W. Shor, The capacity of a quantum channel for simultaneous transmission of classical and quantum information, Commun. Math. Phys. 256, 287 (2005).
  22. S. Khatri, K. Sharma, and M. M. Wilde, Information-theoretic aspects of the generalized amplitude-damping channel, Phys. Rev. A 102, 012401 (2020).
  23. R. Duan, M. Grassl, Z. Ji, and B. Zeng, Multi-error-correcting amplitude damping codes, in 2010 IEEE International Symposium on Information Theory (IEEE, Piscataway, NJ, 2010), Vol. 75, pp. 2672–2676.
  24. A. Kubica, A. Haim, Y. Vaknin, H. Levine, F. Brandão, and A. Retzker, Erasure qubits: Overcoming the T1 limit in superconducting circuits, Phys. Rev. X 13, 041022 (2023).
  25. V. Siddhu, D. Abdelhadi, T. Jochym-O’Connor, and J. Smolin, Entanglement sharing across a damping-dephasing channel, in 2024 IEEE International Symposium on Information Theory (ISIT) (IEEE, Piscataway, NJ, 2024), pp. 1432–1437.
  26. D. Gottesman, Stabilizer codes and quantum error correction, thesis, California Institute of Technology, 1997.
  27. A. Ambainis and D. Gottesman, The minimum distance problem for two-way entanglement purification, IEEE Trans. Inf. Theory 52, 748 (2006).
  28. N. Rengaswamy, R. Calderbank, H. D. Pfister, and S. Kadhe, Synthesis of logical Clifford operators via symplectic geometry, in 2018 IEEE International Symposium on Information Theory (ISIT) (IEEE, Piscataway, NJ, 2018), pp. 791–795.
  29. B. Schumacher, Sending quantum entanglement through noisy channels, Phys. Rev. A 54, 2614 (1996).
  30. D. P. DiVincenzo, D. W. Leung, and B. M. Terhal, Quantum data hiding, IEEE Trans. Inf. Theory 48, 580 (2002).
  31. M. B. Hastings, Notes on some questions in mathematical physics and quantum information, arXiv:1404.4327.
  32. I. Lim, Lecture notes in quantum information theory (2019), https://lim.physics.ucdavis.edu/teaching/files/qi-notes-partiii.pdf.

Outline

Information

Sign In to Your Journals Account

Filter

Filter

Article Lookup

Enter a citation