Space, time, parallelism and noise requirements for reliable quantum computing
arXiv:quant-ph/9708021 · doi:10.1002/(SICI)1521-3978(199806)46:4/5<443::AID-PROP443>3.0.CO;2-8
Abstract
Quantum error correction methods use processing power to combat noise. The noise level which can be tolerated in a fault-tolerant method is therefore a function of the computational resources available, especially the size of computer and degree of parallelism. I present an analysis of error correction with block codes, made fault-tolerant through the use of prepared ancilla blocks. The preparation and verification of the ancillas is described in detail. It is shown that the ancillas need only be verified against a small set of errors. This, combined with previously known advantages, makes this `ancilla factory' the best method to apply error correction, whether in concatenated or block coding. I then consider the resources required to achieve computational steps reliably in a computer of 2150 logical qubits, finding that the simplest block codes can tolerate more noise with smaller overheads than the -bit concatenated code. The scaling is such that block codes remain the better choice for all computations one is likely to contemplate.
LaTeX, 9 pages plus 6 figures
References in corpus (2)
Cited by in corpus (32)
- Quantum Computing with Very Noisy Devices
- Overhead and noise threshold of fault-tolerant quantum error correction
- OpenQASM 3: A broader and deeper quantum assembly language
- Layered architecture for quantum computing
- Parallel Entangling Operations on a Universal Ion Trap Quantum Computer
- Efficient fault-tolerant quantum computing
- Experimental on-demand recovery of entanglement by local operations within non-Markovian dynamics
- Local Fault-tolerant Quantum Computation
- Error Rates and Resource Overheads of Repetition Cat Qubits
- Optimized Surface Code Communication in Superconducting Quantum Computers
- Resource Requirements for Fault-Tolerant Quantum Simulation: The Transverse Ising Model Ground State
- Coherence control for qubits
- Simple experimental methods for trapped ion quantum processors
- An -depth Quantum Adder on a 2D NTC Quantum Computer Architecture
- Quantum Error Correcting Subsystem Codes From Two Classical Linear Codes
- Parallel entangling gate operations and two-way quantum communication in spin chains
- Cluster-based architecture for fault-tolerant quantum computation
- Efficient Construction of a Control Modular Adder on a Carry-Lookahead Adder Using Relative-phase Toffoli Gates
- Resource Optimized Quantum Architectures for Surface Code Implementations of Magic-State Distillation
- Transversality versus Universality for Additive Quantum Codes
- A Study on the Noise Threshold of Fault-tolerant Quantum Error Correction
- Fault-Tolerant Thresholds for Encoded Ancillae with Homogeneous Errors
- Improving the purity of one- and two-qubit gates by AC fields
- Hybrid magic state distillation for universal fault-tolerant quantum computation
- Speedup of iterated quantum search by parallel performance
- Simulating the Effects of Quantum Error-correction Schemes
- Numerical simulation of information recovery in quantum computers
- Error Channels and the Threshold for Fault-tolerant Quantum Computation
- Quantum Memory Hierarchies: Efficient Designs to Match Available Parallelism in Quantum Computing
- A Quantum Logic Array Microarchitecture: Scalable Quantum Data Movement and Computation
- Optimizing Quantum Variational Circuits with Deep Reinforcement Learning
- Error correction in short time steps during the application of quantum gates