Resilient quantum computation: error models and thresholds
From MaRDI portal
Abstract: Recent research has demonstrated that quantum computers can solve certain types of problems substantially faster than the known classical algorithms. These problems include factoring integers and certain physics simulations. Practical quantum computation requires overcoming the problems of environmental noise and operational errors, problems which appear to be much more severe than in classical computation due to the inherent fragility of quantum superpositions involving many degrees of freedom. Here we show that arbitrarily accurate quantum computations are possible provided that the error per operation is below a threshold value. The result is obtained by combining quantum error-correction, fault tolerant state recovery, fault tolerant encoding of operations and concatenation. It holds under physically realistic assumptions on the errors.
Recommendations
Cited in
(50)- scientific article; zbMATH DE number 5360947 (Why is no real title available?)
- Quantum computation with Turaev-Viro codes
- Constructing four-photon states for quantum communication and information processing
- Superselection rules, quantum error correction, and quantum chromodynamics
- A new universal and fault-tolerant quantum basis
- Fermionic quantum computation
- Error-detection-based quantum fault-tolerance threshold
- Quantum error-detection at low energies
- On sampling determinantal and Pfaffian point processes on a quantum computer
- Topological quantum memory
- Efficient decoding scheme of non-uniform concatenation quantum code with deep neural network
- On the generalization of the construction of quantum codes from Hermitian self-orthogonal codes
- Quantum computation with coherent spin states and the close Hadamard problem
- Key ideas in quantum error correction
- scientific article; zbMATH DE number 1406150 (Why is no real title available?)
- [[:Publication:5696625|ERROR THRESHOLD ESTIMATION BY MEANS OF THE 7,1,3 CSS QUANTUM CODE]]
- Error correction of the continuous-variable quantum hybrid computation on two-node cluster states: limit of squeezing
- Two-sided bounds on minimum-error quantum measurement, on the reversibility of quantum dynamics, and on maximum overlap using directional iterates
- A trade-off between classical and quantum circuit size for an attack against CSIDH
- Quantum computation by measurement and quantum memory
- Statistical mechanical models for quantum codes with correlated noise
- The argument against quantum computers
- Manifold algorithmic errors in quantum computers with static internal imperfections
- Towards quantum large-scale password guessing on real-world distributions
- Optimal correction of concatenated fault-tolerant quantum codes
- Quantum universality from magic states distillation applied to CSS codes
- Arbitrary quantum control of qubits in the presence of universal noise
- Fault-ignorant quantum search
- THE PHYSICS OF QUANTUM INFORMATION: COMPLEMENTARITY, UNCERTAINTY, AND ENTANGLEMENT
- Decoherence, einselection, and the quantum origins of the classical
- An apologia for islands
- Deutsch-Jozsa algorithm using triggered single photons from a single quantum dot
- Non-abelian anyons and topological quantum computation
- Graph concatenation for quantum codes
- Steane enlargement of entanglement-assisted quantum error-correcting codes
- Fault-tolerant quantum computation with non-binary systems
- Dual-code quantum computation model
- Hamiltonian sparsification and gap-simulation
- Pieceable fault tolerant conversion between 5-qubit code and 7-CSS code
- Stabilizer quantum codes defined by trace-depending polynomials
- Error scaling in fault tolerant quantum computation
- A quantum computing primer for operator theorists
- Process tomography of robust dynamical decoupling with superconducting qubits
- Propagation of correlations in local random quantum circuits
- Characterizing error propagation in quantum circuits: the isotropic index
- Decoherence rates in large-scale quantum computers and macroscopic quantum systems
- Effective fault-tolerant quantum computation with slow measurements
- Algorithms on ensemble quantum computers
- scientific article; zbMATH DE number 1749716 (Why is no real title available?)
- A fault-tolerant one-way quantum computer
This page was built for publication: Resilient quantum computation: error models and thresholds
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4223939)
