Constraints on recovering quantum information after erasure

Abstract:Suppose that we encode quantum information into $ n $ physical carriers. With what probabilities can we perfectly recover the quantum information after sets of carriers have been erased? This question arises in the study of quantum erasure channels, for which M.B. Hastings conjectured that if each carrier is independently erased with probability $ t \geq 1/2 $, then it is impossible to recover the quantum information with asymptotically vanishing error and probability $ > 1-t $. We prove this conjecture by establishing new no-cloning constraints on realizable recovery probabilities.

6 pages, 6 pages of supplemental material, 3 figures. See arXiv:2607.08591 for an independent proof of the erasure-simulation conjecture

Quantum Physics (quant-ph); Information Theory (cs.IT)

arXiv:2607.17319 [quant-ph]

(or arXiv:2607.17319v1 [quant-ph] for this version)

https://doi.org/10.48550/arXiv.2607.17319 Focus to learn more arXiv-issued DOI via DataCite (pending registration)

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.