No ((n, k, d < 127)) code can violate the quantum Hamming bound

Abstract

It is well-known that pure quantum error correcting codes (QECCs) are constrained by a quantum version of the Hamming bound. Whether impure codes also obey such a bound, however, remains a long-standing question with practical implications for the efficacy of QECCs. We employ a combination of previously derived bounds on QECCs to demonstrate that a subset of all codes must obey the quantum Hamming bound. Specifically, we combine an analytical bound due to Rains with a numerical bound due to Li and Xing to show that no ((n,k,d < 127)) code can violate the quantum Hamming bound.

References in corpus (17)

• Quantum Computing in the NISQ era and beyond
• Good Quantum Error-Correcting Codes Exist
• Stabilizer Codes and Quantum Error Correction
• Realizing Repeated Quantum Error Correction in a Distance-Three Surface Code
• Roads towards fault-tolerant universal quantum computation
• Realization of Three-Qubit Quantum Error Correction with Superconducting Circuits
• Exponential suppression of bit or phase flip errors with repetitive error correction
• Repeated Quantum Error Detection in a Surface Code
• Quantum Channel Capacity of Very Noisy Channels
• Logical-qubit operations in an error-detecting surface code
• Compilation of Fault-Tolerant Quantum Heuristics for Combinatorial Optimization
• Quantum Error-Correcting Codes Need Not Completely Reveal the Error Syndrome
• Quantum variational learning for quantum error-correcting codes
• Degenerate quantum codes and the quantum Hamming bound
• The Implications of Ignorance for Quantum Error Correction Thresholds
• A Note on Quantum Hamming Bound
• Asymptotics of the quantum Hamming bound for subsystem codes