Fault-Tolerant Quantum Computation with Constant Error Rate
From MaRDI portal
Abstract: This paper proves the threshold result, which asserts that quantum computation can be made robust against errors and inaccuracies, when the error rate, , is smaller than a constant threshold, . The result holds for a very general, not necessarily probabilistic noise model, for quantum particles with any number of states, and is also generalized to one dimensional quantum computers with only nearest neighbor interactions. No measurements, or classical operations, are required during the quantum computation. The proceeding version was very succinct, and here we fill all the missing details, and elaborate on many parts of the proof. In particular, we devote a section for a discussion of universality issues and proofs that the sets of gates that we use are universal. Another section is devoted to a rigorous proof that fault tolerance can be achieved in the presence of general non probabilistic noise. The systematic structure of the fault tolerant procedures for polynomial codes is explained in length. The proof that the concatenation scheme works is written in a clearer way. The paper also contains new and significantly simpler proofs for most of the known results which we use. For example, we give a simple proof that it suffices to correct bit and phase flips, we significantly simplify Calderbank and Shor's original proof of the correctness of CSS codes. We also give a simple proof of the fact that two-qubit gates are universal. The paper thus provides a self contained and complete proof for universal fault tolerant quantum computation.
Recommendations
Cited in
(79)- End-to-end fault tolerance
- Fault-tolerant quantum computation with higher-dimensional systems
- Characterizing error propagation in quantum circuits: the isotropic index
- Error symmetrization in quantum computers
- Fault-tolerant quantum computation by anyons
- Automated error correction in IBM quantum computer and explicit generalization
- Geometric Rényi divergence and its applications in quantum channel capacities
- Statistical mechanical models for quantum codes with correlated noise
- A novel fault-tolerant quantum divider and its simulation
- Towards quantum large-scale password guessing on real-world distributions
- Error scaling in fault tolerant quantum computation
- Verification of quantum computation: an overview of existing approaches
- A fault-tolerant one-way quantum computer
- Scaling and renormalization in fault-tolerant quantum computers
- Pieceable fault tolerant conversion between 5-qubit code and 7-CSS code
- The application of weight parity error correction in quantum codes
- Low-overhead code concatenation approaches for universal quantum computation
- A Fully Fault-Tolerant Representation of Quantum Circuits
- The physics of quantum computation
- A new universal and fault-tolerant quantum basis
- Upper bounds on fault tolerance thresholds of noisy Clifford-based quantum computers
- Quantum algorithms for algebraic problems
- scientific article; zbMATH DE number 5863326 (Why is no real title available?)
- Constructing arbitrary Steane code single logical qubit fault-tolerant gates
- Effective fault-tolerant quantum computation with slow measurements
- Upper bounds on the noise threshold for fault-tolerant quantum computing
- scientific article; zbMATH DE number 5613917 (Why is no real title available?)
- Latency in local, two-dimensional, fault-tolerant quantum computing
- Design of p-valued Deutsch quantum gates with multiple control signals and mixed polarity
- Analytical error analysis of Clifford gates by the fault-path tracer method
- scientific article; zbMATH DE number 5595797 (Why is no real title available?)
- scientific article; zbMATH DE number 5595810 (Why is no real title available?)
- \({\mathcal C}_3\), semi-Clifford and generalized semi-Clifford operations
- SIMPLE FAULT-TOLERANT ENCODING OVER q-ARY CSS QUANTUM CODES
- Upper Bounds on the Noise Threshold for Fault-Tolerant Quantum Computing
- An upper bound on the threshold quantum decoherence rate
- A flow-map model for analyzing pseudothresholds in fault-tolerant quantum computing
- Fault-tolerant quantum computation for local leakage faults
- Universal fault tolerant quantum computation on bilinear nearest neighbor arrays
- Fault-Tolerance Threshold for a Distance-Three Quantum Code
- Quantum measurements and gates by code deformation
- scientific article; zbMATH DE number 2103532 (Why is no real title available?)
- Topological quantum memory
- Fault-tolerant ancilla preparation and noise threshold lower bounds for the 23-qubit Golay code
- Error thresholds for arbitrary Pauli noise
- Dual-code quantum computation model
- The BQP-hardness of approximating the Jones polynomial
- Efficient quantum computing with weak measurements
- Error-transparent evolution: the ability of multi-body interactions to bypass decoherence
- Symmetry-protected adiabatic quantum transistors
- Quantum fault tolerance in systems with restricted control
- Universal quantum computation with metaplectic anyons
- THE PHYSICS OF QUANTUM INFORMATION: COMPLEMENTARITY, UNCERTAINTY, AND ENTANGLEMENT
- Quantum error correction and fault tolerant quantum computing.
- Manifold algorithmic errors in quantum computers with static internal imperfections
- [[:Publication:5696625|ERROR THRESHOLD ESTIMATION BY MEANS OF THE 7,1,3 CSS QUANTUM CODE]]
- Bounding quantum gate error rate based on reported average fidelity
- Minimising the heat dissipation of quantum information erasure
- Robust characterization of leakage errors
- Dimensional jump in quantum error correction
- Calculable lower bounds on the efficiency of universal sets of quantum gates
- Trading inverses for an irrep in the Solovay-Kitaev theorem
- On the universality and membership problems for quantum gates
- 9 Fault-tolerant mechanism using intelligent quantum computing-based error reduction codes
- Quantum computation of phase transition in interacting scalar quantum field theory
- Channel polarization of two-dimensional-input quantum symmetric channels
- Fault-Tolerant Syndrome Extraction and Cat State Preparation with Fewer Qubits
- Random quantum circuits transform local noise into global white noise
- Hierarchical quantum error correction with hypergraph product code and rotated surface code
- Fidelity of the sum of independent quantum computing errors
- The computational advantage of MIP* vanishes in the presence of noise
- The computational advantage of MIP* vanishes in the presence of noise
- An apologia for islands
- Superselection rules, quantum error correction, and quantum chromodynamics
- A methodology for comparing and benchmarking quantum devices
- Universal topological quantum computing via double-braiding in SU(2) Witten-Chern-Simons theory
- Robust quantum entanglement at (nearly) room temperature
- Global estimates of errors in quantum computation by the Feynman-Vernon formalism
- Error-detection-based quantum fault-tolerance threshold
This page was built for publication: Fault-Tolerant Quantum Computation with Constant Error Rate
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3395030)
