Comparing the Overhead of Topological and Concatenated Quantum Error Correction

Abstract

This work compares the overhead of quantum error correction with concatenated and topological quantum error-correcting codes. To perform a numerical analysis, we use the Quantum Resource Estimator Toolbox (QuRE) that we recently developed. We use QuRE to estimate the number of qubits, quantum gates, and amount of time needed to factor a 1024-bit number on several candidate quantum technologies that differ in their clock speed and reliability. We make several interesting observations. First, topological quantum error correction requires fewer resources when physical gate error rates are high, white concatenated codes have smaller overhead for physical gate error rates below approximately 10E-7. Consequently, we show that different error-correcting codes should be chosen for two of the studied physical quantum technologies - ion traps and superconducting qubits. Second, we observe that the composition of the elementary gate types occurring in a typical logical circuit, a fault-tolerant circuit protected by the surface code, and a fault-tolerant circuit protected by a concatenated code all differ. This also suggests that choosing the most appropriate error correction technique depends on the ability of the future technology to perform specific gates efficiently.

References in corpus (7)

• Quantum information processing with circuit quantum electrodynamics
• Topological fault-tolerance in cluster state quantum computation
• Subsystem fault tolerance with the Bacon-Shor code
• Quantum accuracy threshold for concatenated distance-3 codes
• A Depth-Optimal Canonical Form for Single-qubit Quantum Circuits
• Fault-tolerant quantum computation with asymmetric Bacon-Shor codes
• Comparing the Overhead of Topological and Concatenated Quantum Error Correction

Cited by in corpus (19)

• The Bitter Truth About Quantum Algorithms in the NISQ Era
• Fault-tolerant quantum computation with few qubits
• Neutral Atom Quantum Computing Hardware: Performance and End-User Perspective
• Partial Compilation of Variational Algorithms for Noisy Intermediate-Scale Quantum Machines
• Optimized Surface Code Communication in Superconducting Quantum Computers
• A Roadmap for Automating the Selection of Quantum Computers for Quantum Algorithms
• Comparing the Overhead of Topological and Concatenated Quantum Error Correction
• Exploiting Degeneracy in Belief Propagation Decoding of Quantum Codes
• Predicting Good Quantum Circuit Compilation Options
• Quantitative Robustness Analysis of Quantum Programs (Extended Version)
• A High Performance Compiler for Very Large Scale Surface Code Computations
• Enabling Accuracy-Aware Quantum Compilers using Symbolic Resource Estimation
• The T-Complexity Costs of Error Correction for Control Flow in Quantum Computation
• SurfBraid: A concept tool for preparing and resource estimating quantum circuits protected by the surface code
• Gleipnir: Toward Practical Error Analysis for Quantum Programs (Extended Version)
• Practical Quantum Computing: The value of local computation
• Composability of global phase invariant distance and its application to approximation error management
• Offloading Quantum Computation by Superposition Masking
• Quantum Resource Management in the NISQ Era: Challenges, Vision, and a Runtime Framework