English

Constraints on recovering quantum information after erasure

Quantum Physics 2026-07-19 v1 Information Theory

Abstract

Suppose that we encode quantum information into n 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 t1/2 t \geq 1/2 , then it is impossible to recover the quantum information with asymptotically vanishing error and probability >1t > 1-t . We prove this conjecture by establishing new no-cloning constraints on realizable recovery probabilities.

Keywords

Cite

@article{arxiv.2607.17319,
  title  = {Constraints on recovering quantum information after erasure},
  author = {Mohammad A. Alhejji and Noah Lordi and Omkar Baraskar and Ariel Shlosberg and Emanuel Knill},
  journal= {arXiv preprint arXiv:2607.17319},
  year   = {2026}
}

Comments

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