PreprintCC BY 4.0arXiv
Linear-Time Encodable Quantum Codes near the CSS GV Bound
Abstract
We construct quantum CSS codes with rate-distance tradeoff approaching the CSS GV bound, which can be encoded by a quantum circuit of logarithmic depth and a linear number of gates. Our construction is heavily inspired by a work of Brehm and Resch and can be viewed as a quantum analogue of classical repeat multiple accumulate codes. The encoder has a particularly simple structure, consisting of a single constant depth outer quantum circuit followed by several classical accumulation and inverse-accumulation layers.
Related
- Linear-time erasure recovery for quantum expander codes
- Explicit Capacity-Achieving Quantum LDPC Codes List Decodable in Near-linear Time
- Spatially Coupled MacKay-Neal/Hsu-Anastasopoulos CSS Codes Achieve the Quantum-Erasure Hashing Bound by Seeded BP Decoding
- Random Quantum LDPC Codes Approaching the Gilbert-Varshamov Bound
- A Near-Optimal Joint Lower Bound for Sparse Quantum Linear System Solvers
BibTeX
@misc{zhang2026lineartime,
title = {{Linear-Time Encodable Quantum Codes near the CSS GV Bound}},
author = {Rachel Yun Zhang},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.01277},
eprint = {2610.01277},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.01277},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Linear-Time Encodable Quantum Codes near the CSS GV Bound
AU - Rachel Yun Zhang
PY - 2026
DA - 2026/10/01
PB - arXiv
DO - 10.48550/arxiv.2610.01277
UR - https://arxiv.org/abs/2610.01277
AB - We construct quantum CSS codes with rate-distance tradeoff approaching the CSS GV bound, which can be encoded by a quantum circuit of logarithmic depth and a linear number of gates. Our construction is heavily inspired by a work of Brehm and Resch and can be viewed as a quantum analogue of classical repeat multiple accumulate codes. The encoder has a particularly simple structure, consisting of a single constant depth outer quantum circuit followed by several classical accumulation and inverse-accumulation layers.
ER -