Reproduce “Constraints on recovering quantum information after erasure” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Mohammad A. Alhejji, Noah Lordi, Omkar Baraskar, Ariel Shlosberg, Emanuel Knill
This work precisely characterized the fundamental limits on quantum information recovery from erased carriers, showing that for up to four carriers, basic no-cloning constraints define achievable probabilities, while for more carriers, new bounds derived using the Lovász number are necessary. These new constraints were leveraged to formally prove M.B. Hastings' erasure-simulation conjecture, establishing fundamental limits on the effective noise reduction achievable through quantum channel simulation.
Key insights
- For quantum codes with n 4 carriers, the set of realizable recovery probability tuples (Q_n) is precisely equivalent to the set T_n, defined by basic no-cloning constraints, including the partition constraint.
- For n > 4, Q_n is a strict subset of T_n, demonstrating that existing basic no-cloning constraints are insufficient and more stringent limitations exist for larger quantum codes.
- The Lovász number from graph theory provides a powerful and general mathematical tool to derive new no-cloning bounds on the sum of quantum information recovery probabilities, extending beyond previously known constraints.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.