Structure of CSS and CSS-T Quantum Codes
arXiv:2310.16504 · doi:10.1007/s10623-024-01415-9
Abstract
We investigate CSS and CSS-T quantum error-correcting codes from the point of view of their existence, rarity, and performance. We give a lower bound on the number of pairs of linear codes that give rise to a CSS code with good correction capability, showing that such pairs are easy to produce with a randomized construction. We then prove that CSS-T codes exhibit the opposite behaviour, showing also that, under very natural assumptions, their rate and relative distance cannot be simultaneously large. This partially answers an open question on the feasible parameters of CSS-T codes. We conclude with a simple construction of CSS-T codes from Hermitian curves. The paper also offers a concise introduction to CSS and CSS-T codes from the point of view of classical coding theory.
References in corpus (11)
- Good Quantum Error-Correcting Codes Exist
- Multiple Particle Interference and Quantum Error Correction
- Maintaining coherence in Quantum Computers
- Quantum Error Correction: An Introductory Guide
- Efficient fault-tolerant quantum computing
- On the Construction of Nonbinary Quantum BCH Codes
- Quantum Reed-Solomon Codes
- On Optimality of CSS Codes for Transversal
- New Quantum Codes from CSS Codes
- Classical Coding Problem from Transversal Gates
- Quantum error-correcting codes and their geometries