A comparative code study for quantum fault-tolerance
Andrew W. Cross, David P. DiVincenzo, Barbara M. Terhal
TL;DR
This paper compares various quantum error-correcting codes to identify the most effective ones for fault-tolerant quantum computing, using the AGP ex-Rec method to evaluate their performance against noise.
Contribution
It provides a comprehensive comparison of quantum codes at the physical level, estimating their pseudo-thresholds and logical noise rates under depolarizing noise.
Findings
Bacon-Shor codes and Golay code outperform others in the study.
Estimated logical noise rates as a function of overhead.
Identified optimal codes for fault-tolerance at specific error rates.
Abstract
We study a comprehensive list of quantum codes as candidates of codes to be used at the bottom, physical, level in a fault-tolerant code architecture. Using the Aliferis-Gottesman-Preskill (AGP) ex-Rec method we calculate the pseudo-threshold for these codes against depolarizing noise at various levels of overhead. We estimate the logical noise rate as a function of overhead at a physical error rate of . The Bacon-Shor codes and the Golay code are the best performers in our study.
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 and electron transport phenomena