Structure Theorem for Quantum Replacer Codes
arXiv:2505.06659 · doi:10.1063/5.0280149
Abstract
Quantum replacer codes are codes that can be protected from errors induced by a given set of quantum replacer channels, an important class of quantum channels that includes the erasures of subsets of qubits that arise in quantum error correction. We prove a structure theorem for such codes that synthesizes a variety of special cases with earlier theoretical work in quantum error correction. We present several examples and applications of the theorem, including a mix of new observations and results together with some subclasses of codes revisited from this new perspective.
22 pages, 1 figure
References in corpus (27)
- Bulk Locality and Quantum Error Correction in AdS/CFT
- On the Theory of Quantum Secret Sharing
- Development of Quantum InterConnects for Next-Generation Information Technologies
- The Ryu-Takayanagi Formula from Quantum Error Correction
- Stabilizer Formalism for Operator Quantum Error Correction
- Optimal Encryption of Quantum Bits
- A Unified and Generalized Approach to Quantum Error Correction
- A no-go theorem for a two-dimensional self-correcting quantum memory based on stabilizer codes
- High-fidelity gates with mid-circuit erasure conversion in a metastable neutral atom qubit
- Erasure conversion for fault-tolerant quantum computing in alkaline earth Rydberg atom arrays
- Erasure conversion in a high-fidelity Rydberg quantum simulator
- Holographic Renyi Entropy from Quantum Error Correction
- Strong converse exponents for a quantum channel discrimination problem and quantum-feedback-assisted communication
- Learning the Alpha-bits of Black Holes
- Quantum Error Correction with Metastable States of Trapped Ions Using Erasure Conversion
- Erasure qubits: Overcoming the limit in superconducting circuits
- Quantum minimal surfaces from quantum error correction
- Decoherence-full subsystems and the cryptographic power of a private shared reference frame
- Demonstrating a long-coherence dual-rail erasure qubit using tunable transmons
- Quantum Error Correcting Subsystems are Unitarily Recoverable Subsystems
- Complementarity of Private and Correctable Subsystems in Quantum Cryptography and Error Correction
- Random subspaces for encryption based on a private shared Cartesian frame
- Private algebras in quantum information and infinite-dimensional complementarity
- Private Quantum Subsystems
- Optimizing quantum error correction protocols with erasure qubits
- Quantum Privacy and Schur Product Channels
- Stabilizer Formalism for Operator Algebra Quantum Error Correction