What determines the ultimate precision of a quantum computer?
arXiv:1702.07688 · doi:10.1103/PhysRevA.99.042318
Abstract
A quantum error correction (QEC) code uses quantum bits to construct one "logical" quantum bits of better quality than the original "physical" ones. QEC theory predicts that the failure probability of logical qubits decreases exponentially with provided the failure probability of the physical qubit is below a certain threshold . In particular QEC theorems imply that the logical qubits can be made arbitrarily precise by simply increasing . In this letter, we search for physical mechanisms that lie outside of the hypothesis of QEC theorems and set a limit to the precision of the logical qubits (irrespectively of ). directly controls the maximum number of operations that can be performed before the logical quantum state gets randomized, hence the depth of the quantum circuits that can be considered. We identify a type of error - silent stabilizer failure - as a mechanism responsible for finite and discuss its possible causes. Using the example of the topological surface code, we show that a single local event can provoke the failure of the logical qubit, irrespectively of .
arXiv commentPublished version. New discussion added at the end
References in corpus (25)
- Quantum Computing in the NISQ era and beyond
- Quantum Computation with Quantum Dots
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- A variational eigenvalue solver on a quantum processor
- Charge insensitive qubit design derived from the Cooper pair box
- Surface codes: Towards practical large-scale quantum computation
- Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
- Quantum Error Correction for Quantum Memories
- Scalable Quantum Simulation of Molecular Energies
- Elucidating Reaction Mechanisms on Quantum Computers
- Quantum optimization using variational algorithms on near-term quantum devices
- A blueprint for demonstrating quantum supremacy with superconducting qubits
- Fault-Tolerant Error Correction with Efficient Quantum Codes
- Measuring and Suppressing Quantum State Leakage in a Superconducting Qubit
- Unsupervised Machine Learning on a Hybrid Quantum Computer
- Thresholds for topological codes in the presence of loss
- Coping with qubit leakage in topological codes
- Understanding the effects of leakage in superconducting quantum error detection circuits
- Experimentally scalable protocol for identification of correctable codes
- Proof of finite surface code threshold for matching
- Quantifying the effects of local many-qubit errors and non-local two-qubit errors on the surface code
- Conditional generation of error syndromes in fault-tolerant error correction
- Breakdown of Surface Code Error Correction Due to Coupling to a Bosonic Bath
- Fault-Tolerant Quantum Computation for Singlet-Triplet Qubits with Leakage Errors
- Prospects for quantum computing: extremely doubtful
Cited by in corpus (7)
- What limits the simulation of quantum computers?
- Protecting quantum entanglement from leakage and qubit errors via repetitive parity measurements
- Opening the Black Box Inside Grover's Algorithm
- The Quantum House Of Cards
- Semiconductor-based electron flying qubits: Review on recent progress accelerated by numerical modelling
- Feasibility of performing quantum chemistry calculations on quantum computers
- Who can compete with quantum computers? Lecture notes on quantum inspired tensor networks computational techniques