Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1709.04471 · PRX Quantum

Error Correction of Quantum Reference Frame Information

Patrick M. Hayden, Sepehr Nezami, Sandu Popescu, Grant Salton

Published Feb 18, 2021• 59 citations
arXivHTMLPDF

Abstract

An investigation of group covariant quantum error correction indicates that the Eastin-Knill theorem, a stumbling block on the path to fault-tolerant quantum computation, may be circumvented by using continuous variables.
DOI
10.1103/prxquantum.2.010326

Related papers

New perspectives on covariant quantum error correction

Sisi Zhou, Zi-Wen Liu, Liang Jiang

Covariant codes are quantum codes such that a symmetry transformation on the logical system could be realized by a symmetry transformation on the physical system, usually with limited capability of performing quantum error correction (an important case being the Eastin–Knill theorem). The need for understanding the limits of covariant quantum error correction arises in various realms of physics including fault-tolerant quantum computation, condensed matter physics and quantum gravity. Here, we explore covariant quantum error correction with respect to continuous symmetries from the perspectives of quantum metrology and quantum resource theory, establishing solid connections between these formerly disparate fields. We prove new and powerful lower bounds on the infidelity of covariant quantum error correction, which not only extend the scope of previous no-go results but also provide a substantial improvement over existing bounds. Explicit lower bounds are derived for both erasure and depolarizing noises. We also present a type of covariant codes which nearly saturates these lower bounds.

arXiv:2005.11918•Quantum•Aug 9, 2021•53 citations

Quantum error correction

John P. Preskill

One reason why building large-scale quantum computers will be particularly challenging is that quantum computers are far more susceptible to making errors than conventional digital computers. I will explain the principles of quantum error correction and fault-tolerant quantum computation, which can enable a properly designed quantum computer with imperfect components to achieve good reliability. Some recent developments in the theory of quantum fault tolerance will be reviewed, including quantum error-correcting codes for systems described by continuous quantum variables, robust storage of quantum information based on topological principles, and applications of quantum error-correcting codes to quantum cryptography.

Optical Fiber Communication Conference•Jan 1, 2001•17 citations

Continuous Symmetries and Approximate Quantum Error Correction

Philippe Faist, Sepehr Nezami, Victor V. Albert +4 more

Quantum error correction and symmetry arise in many areas of physics, including many-body systems, metrology in the presence of noise, fault-tolerant computation, and holographic quantum gravity. Here, we study the compatibility of these two important principles. If a logical quantum system is encoded into n physical subsystems, we say that the code is covariant with respect to a symmetry group G if a G transformation on the logical system can be realized by performing transformations on the individual subsystems. For a G-covariant code with G a continuous group, we derive a lower bound on the error-correction infidelity following erasure of a subsystem. This bound approaches zero when the number of subsystems nor the dimension d of each subsystem is large. We exhibit codes achieving approximately the same scaling of infidelity with n or d as the lower bound. Leveraging tools from representation theory, we prove an approximate version of the Eastin-Knill theorem for quantum computation: If a code admits a universal set of transversal gates and corrects erasure with fixed accuracy, then, for each logical qubit, we need a number of physical qubits per subsystem that is inversely proportional to the error parameter. We construct codes covariant with respect to the full logical unitary group, achieving good accuracy for large d (using random codes) or n (using codes based on W states). We systematically construct codes covariant with respect to general groups, obtaining natural generalizations of qubit codes to, for instance, oscillators and rotors. In the context of the AdS/CFT correspondence, our approach provides insight into how time evolution in the bulk corresponds to time evolution on the boundary without violating the Eastin-Knill theorem, and our five-rotor code can be stacked to form a covariant holographic code.

arXiv:1902.07714•Physical Review X•Oct 26, 2020•147 citations

Optimal universal quantum error correction via bounded reference frames

Yuxiang Yang, Yin Mo, Joseph M. Renes +2 more

Error correcting codes with a universal set of transversal gates are a desideratum for quantum computing. Such codes, however, are ruled out by the Eastin-Knill theorem. Moreover, the theorem also rules out codes which are covariant with respect to the action of transversal unitary operations forming continuous symmetries. In this work, starting from an arbitrary code, we construct approximate codes which are covariant with respect to the entire group of local unitary gates in dimension $d\phantom{\rule{4pt}{0ex}}(<\ensuremath{\infty})$, using quantum reference frames. We show that our codes are capable of efficiently correcting different types of erasure errors. When only a small fraction of the $n$ qudits upon which the code is built are erased, our covariant code has an error that scales as $1/{n}^{2}$, which is reminiscent of the Heisenberg limit of quantum metrology. When every qudit has a chance of being erased, our covariant code has an error that scales as $1/n$. We show that the error scaling is optimal in both cases. Our approach has implications for fault-tolerant quantum computing, reference frame error correction, and the AdS-CFT duality.

arXiv:2007.09154•Physical Review Research•May 9, 2022•49 citations

Real-Time Error Correction for Quantum Computing

Philip Ball

An experiment shows that errors in quantum computation can be repeatedly corrected on the fly.

Physics•Dec 23, 2021•5 citations

Streamlined Quantum Error Correction

Ryan Wilkinson

A new method for fixing errors in quantum computations can be just as accurate as previous approaches while needing fewer resources.

Physics•Jan 9, 2025•0 citations
Covariant codes are quantum codes such that a symmetry transformation on the logical system could be realized by a symmetry transformation on the physical system, usually with limited capability of performing quantum error correction (an important case being the Eastin–Knill theorem). The need for understanding the limits of covariant quantum error correction arises in various realms of physics including fault-tolerant quantum computation, condensed matter physics and quantum gravity. Here, we explore covariant quantum error correction with respect to continuous symmetries from the perspectives of quantum metrology and quantum resource theory, establishing solid connections between these formerly disparate fields. We prove new and powerful lower bounds on the infidelity of covariant quantum error correction, which not only extend the scope of previous no-go results but also provide a substantial improvement over existing bounds. Explicit lower bounds are derived for both erasure and depolarizing noises. We also present a type of covariant codes which nearly saturates these lower bounds.
One reason why building large-scale quantum computers will be particularly challenging is that quantum computers are far more susceptible to making errors than conventional digital computers. I will explain the principles of quantum error correction and fault-tolerant quantum computation, which can enable a properly designed quantum computer with imperfect components to achieve good reliability. Some recent developments in the theory of quantum fault tolerance will be reviewed, including quantum error-correcting codes for systems described by continuous quantum variables, robust storage of quantum information based on topological principles, and applications of quantum error-correcting codes to quantum cryptography.
Quantum error correction and symmetry arise in many areas of physics, including many-body systems, metrology in the presence of noise, fault-tolerant computation, and holographic quantum gravity. Here, we study the compatibility of these two important principles. If a logical quantum system is encoded into n physical subsystems, we say that the code is covariant with respect to a symmetry group G if a G transformation on the logical system can be realized by performing transformations on the individual subsystems. For a G-covariant code with G a continuous group, we derive a lower bound on the error-correction infidelity following erasure of a subsystem. This bound approaches zero when the number of subsystems nor the dimension d of each subsystem is large. We exhibit codes achieving approximately the same scaling of infidelity with n or d as the lower bound. Leveraging tools from representation theory, we prove an approximate version of the Eastin-Knill theorem for quantum computation: If a code admits a universal set of transversal gates and corrects erasure with fixed accuracy, then, for each logical qubit, we need a number of physical qubits per subsystem that is inversely proportional to the error parameter. We construct codes covariant with respect to the full logical unitary group, achieving good accuracy for large d (using random codes) or n (using codes based on W states). We systematically construct codes covariant with respect to general groups, obtaining natural generalizations of qubit codes to, for instance, oscillators and rotors. In the context of the AdS/CFT correspondence, our approach provides insight into how time evolution in the bulk corresponds to time evolution on the boundary without violating the Eastin-Knill theorem, and our five-rotor code can be stacked to form a covariant holographic code.
Error correcting codes with a universal set of transversal gates are a desideratum for quantum computing. Such codes, however, are ruled out by the Eastin-Knill theorem. Moreover, the theorem also rules out codes which are covariant with respect to the action of transversal unitary operations forming continuous symmetries. In this work, starting from an arbitrary code, we construct approximate codes which are covariant with respect to the entire group of local unitary gates in dimension $d\phantom{\rule{4pt}{0ex}}(<\ensuremath{\infty})$, using quantum reference frames. We show that our codes are capable of efficiently correcting different types of erasure errors. When only a small fraction of the nnn qudits upon which the code is built are erased, our covariant code has an error that scales as 1/n21/{n}^{2}1/n2, which is reminiscent of the Heisenberg limit of quantum metrology. When every qudit has a chance of being erased, our covariant code has an error that scales as 1/n1/n1/n. We show that the error scaling is optimal in both cases. Our approach has implications for fault-tolerant quantum computing, reference frame error correction, and the AdS-CFT duality.