Concatenation Schemes for Topological Fault-tolerant Quantum Error Correction
Zhaoyi Li, Isaac Kim, Patrick Hayden

TL;DR
This paper introduces fault-tolerant quantum error correction schemes using concatenation with the 3D cluster state, improving thresholds and reducing overhead for quantum computing reliability.
Contribution
It proposes new concatenation-based fault-tolerant schemes converting circuit errors into erasures, enhancing performance over standard models.
Findings
Threshold improved by 16.5% with concatenation.
Spacetime overhead reduced by 32%.
Achieves logical error rate of 10^{-6} at physical error rate 10^{-3}.
Abstract
We investigate a family of fault-tolerant quantum error correction schemes based on the concatenation of small error detection or error correction codes with the three-dimensional cluster state. We propose fault-tolerant state preparation and decoding schemes that effectively convert every circuit-level error into an erasure error, leveraging the cluster state's high threshold against such errors. We find a set of codes for which such a conversion is possible, and study their performance against the standard circuit-level depolarizing model. Our best performing scheme, which is based on a concatenation with a classical code, improves the threshold by and decreases the spacetime overhead by compared to the scheme without concatenation, with each scheme subject to a physical error rate of and achieving a logical error rate of .
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.
Code & Models
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
