Impure codes exceeding the pure bounds for quantum local recovery

Abstract

Existing literature provides several bounds for quantum local recovery, which essentially consider the number of message qudits, the distance, the length, and the locality of the involved codes. We give a family of $J$-affine variety codes that result in impure CSS codes. These quantum codes exceed several of the above mentioned bounds that apply to pure quantum locally recoverable codes. We also discuss a connection between bounds on quantum local recovery and on weight-constrained stabilizer codes.

Version 2 is publisher's open access PDF whose copyright is held by the authors

References in corpus (14)

• Capacities of Quantum Erasure Channels
• Erasure conversion for fault-tolerant quantum computing in alkaline earth Rydberg atom arrays
• Catalytic quantum error correction
• Quantum Error Correction with Metastable States of Trapped Ions Using Erasure Conversion
• Entanglement-Assisted Quantum Communication Beating the Quantum Singleton Bound
• Measurement-free fault-tolerant quantum error correction in near-term devices
• Stabilizer quantum codes from $J$-affine variety codes and a new Steane-like enlargement
• Low-Overhead Transversal Fault Tolerance for Universal Quantum Computation
• Feng-Rao decoding of primary codes
• Fault-tolerant measurement-free quantum error correction with multi-qubit gates
• Optimized measurement-free and fault-tolerant quantum error correction for neutral atoms
• Improved constructions of nested code pairs
• Optimal $(r,\delta )$-LRCs from monomial-Cartesian codes and their subfield-subcodes
• Quantum $(r,\delta )$-locally recoverable codes