Abelian multi-cycle codes for single-shot error correction
Hsiang-Ku Lin, Pak Kau Lim, Alexey A. Kovalev, Leonid P. Pryadko

TL;DR
This paper introduces shorter quantum low-density parity-check codes with single-shot error correction capabilities, derived from higher-dimensional hypergraph-product codes, improving decoding accuracy and fault-tolerance.
Contribution
It presents a new family of quantum codes that are shorter and maintain single-shot properties, with explicit constructions and performance analysis.
Findings
Codes have high redundancy of low-weight stabilizers.
Simulation shows a (pseudo)threshold close to 1.1%.
Codes outperform similar toric or surface codes in noise resilience.
Abstract
We construct a family of quantum low-density parity-check codes locally equivalent to higher-dimensional quantum hypergraph-product (QHP) codes. Similarly to QHP codes, the proposed codes have highly redundant sets of low-weight stabilizer generators, which improves decoding accuracy in a fault-tolerant regime and gives them single-shot properties. The advantage of the new construction is that it gives shorter codes. We derive simple expressions for the dimension of the proposed codes in two important special cases, give bounds on the distances, and explicitly construct some relatively short codes. Circuit simulations for codes locally equivalent to 4-dimensional toric codes show a (pseudo)threshold close to 1.1%, better than for toric or surface codes with a similar noise model.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography · Quantum-Dot Cellular Automata
