REVIEW 7 cited by
Continuous symmetries and approximate quantum error correction
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
abstract
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 $n$ or 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: 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.
Forward citations
Cited by 7 Pith papers
-
Diffusive Speed Limits for U(1)-Covariant Quantum Error Correction
U(1)-covariant adjacent-charge encoders have an exact n^{-1/2} optimal flagged-erasure error, and the studied local-Haar brickwork circuits cannot reach it before Omega(n^2) cycles.
-
Quantum reference frames beyond subsystems: a reconstruction and generalization of the perspective-neutral framework
Quantum reference frames need not be subsystems: covariant instruments suffice, recovering the perspective-neutral framework operationally and enabling labeling frames and exact interacting relational clocks.
-
Approximate Quantum Error Correction at Chiral Topological Edges
Chiral edge codes have local-erasure robustness governed by power-law exponents with hierarchy γ≥α≥min{α,β}, so the 2D code is at least as robust as its 1D CFT reduction.
-
Arbitrary-Distance Quantum Error Correction with Gauss's Law for $\mathbb Z_2$ Lattice Gauge Theory
Gauss's law constraints in Z2 lattice gauge theory can be made into quantum error-correcting codes of arbitrary distance, with provably optimal encoding rate within the constructed family.
-
Protecting Astronomical Interferometry through Quantum-Memory Scrambling
A depth-2, five-cell number-conserving encoder with pattern-conditioned recovery beats deeper and charge-Haar benchmarks at one operating point under all-pattern flagged erasure, with no throughput advantage claimed.
-
A Note on Corrections to Entanglement Wedge Reconstruction
When the RT area term is O(1/G) and bulk entropy O(1), corrections to entanglement wedge reconstruction are exponentially small in G relative to state-dependent corrections to the area function.
-
Quantum Error Correction Codes for Truncated SU(2) Lattice Gauge Theories
Gauss's law constraints in jmax=1/2 SU(2) lattice gauge theory are converted into stabilizer codes that correct single-qubit errors using about 9N or 12N physical qubits per N plaquettes.
Discussion (0). Sign in to comment.