Reliable quantum computers
From MaRDI portal
Abstract: The new field of quantum error correction has developed spectacularly since its origin less than two years ago. Encoded quantum information can be protected from errors that arise due to uncontrolled interactions with the environment. Recovery from errors can work effectively even if occasional mistakes occur during the recovery procedure. Furthermore, encoded quantum information can be processed without serious propagation of errors. Hence, an arbitrarily long quantum computation can be performed reliably, provided that the average probability of error per quantum gate is less than a certain critical value, the accuracy threshold. A quantum computer storing about 10^6 qubits, with a probability of error per quantum gate of order 10^{-6}, would be a formidable factoring engine. Even a smaller, less accurate quantum computer would be able to perform many useful tasks. (This paper is based on a talk presented at the ITP Conference on Quantum Coherence and Decoherence, 15-18 December 1996.)
Recommendations
Cited in
(92)- Hiding messages in quantum data
- Quantum computation with Turaev-Viro codes
- Quantum algorithms for algebraic problems
- Transferring multiqubit entanglement onto memory qubits in a decoherence-free subspace
- REALIZATION OF UNITARY MAPS VIA PROBABILISTIC PROGRAMMABLE QUANTUM PROCESSORS
- Deterministic transfer of multiqubit GHZ entangled states and quantum secret sharing between different cavities
- A branching space-times view on quantum error correction
- A new universal and fault-tolerant quantum basis
- The breaking of quantum double symmetries by defect condensation
- Design of a universal logic block for fault-tolerant realization of any logic operation in trapped-ion quantum circuits
- Quantum computer architecture for fast entropy extraction
- Reachable set of operators on controlled open quantum systems in a Markovian environment
- Additivity of decoherence measures for multiqubit quantum systems
- Quantum computation and cryptography: An overview
- Resilient quantum computation: error models and thresholds
- Quantum limit on computational time and speed
- Quantum computing with spin qubits in semiconductor structures
- Quantum Computation over Continuous Variables
- Self-correcting quantum computers
- Topological quantum memory
- Decoherence and entanglement degradation of a qubit-qutrit system in non-inertial frames
- Quantum computation in quantum-Hall systems.
- Unfolding the color code
- Surface code quantum computing by lattice surgery
- Programmable quantum processors
- GENERAL CIRCUITS FOR INDIRECTING AND DISTRIBUTING MEASUREMENT IN QUANTUM COMPUTATION
- On the generalization of the construction of quantum codes from Hermitian self-orthogonal codes
- Improving ancilla states for quantum computation
- [[:Publication:291572|Syndrome measurement order for the 7,1,3 quantum error correction code]]
- Global estimates of errors in quantum computation by the Feynman-Vernon formalism
- Simulating fermions on a quantum computer
- scientific article; zbMATH DE number 1406150 (Why is no real title available?)
- NMR quantum information processing
- Braiding fluxes in Pauli Hamiltonian
- Unitary R-matrices for topological quantum computing
- Suppressing environmental noise in quantum computation through pulse control.
- SIMPLE FAULT-TOLERANT ENCODING OVER q-ARY CSS QUANTUM CODES
- Quantum computation and quantum information†
- QUANTUM COMPUTATION WITH RESTRICTED AMPLITUDES
- PROJECTED ENTANGLED STATES: PROPERTIES AND APPLICATIONS
- [[: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
- The geometry of quantum computing
- Quantum computers, factoring, and decoherence
- Quantum computation by measurement and quantum memory
- The logic of entanglement
- End-to-end fault tolerance
- MEASURED QUANTUM FOURIER TRANSFORM OF 1024 QUBITS ON FIBER OPTICS
- Martingale projections and quantum decoherence
- Optimal correction of concatenated fault-tolerant quantum codes
- Quantum Parrondo's games under decoherence
- Efficient universal leakage elimination for physical and encoded qubits
- QUANTUM ERROR-CORRECTION FOR SPATIALLY CORRELATED ERRORS
- Quasiclassical computation
- Efficient discrete approximations of quantum gates
- Robust quantum spatial search
- Maximum density of quantum information in a scalable CMOS implementation of the hybrid qubit architecture
- Introduction to quantum error correction with stabilizer codes
- Fidelity of the sum of independent quantum computing errors
- Quantum memory as a perpetuum mobile? Stability vs. reversibility of information processing
- On quantum discord for analyzing decoherence effect and deformation phenomena in entangled coherent bipartite state
- Logical qubit behavior model and fast simulation for surface code
- Decoherence of quantum registers in the weak-coupling limit
- Generalized toric codes coupled to thermal baths
- Encoding an arbitrary state in a \([7, 1, 3]\) quantum error correction code
- Decoherence, einselection, and the quantum origins of the classical
- Multiple-particle interference and quantum error correction
- Quantum error correction and fault-tolerant quantum computing
- Bipartite entanglement purification with neutral atoms
- Dual-code quantum computation model
- Hyperfine spin qubits in irradiated malonic acid: heat-bath algorithmic cooling
- Indistinguishability-enhanced entanglement recovery by spatially localized operations and classical communication
- Universal collective rotation channels and quantum error correction
- [[:Publication:2355591|Syndrome measurement strategies for the \(7,1,3\) code]]
- Homological error correction: Classical and quantum codes
- Quantum codes do not fix isotropic errors
- Stabilizer quantum codes defined by trace-depending polynomials
- Error scaling in fault tolerant quantum computation
- A quantum computing primer for operator theorists
- Architecture of a Quantum Multicomputer Implementing Shor’s Algorithm
- Steane code single qubit Clifford gates
- New quantum MDS codes with flexible parameters from Hermitian self-orthogonal GRS codes
- Quantum control with noisy fields: computational complexity versus sensitivity to noise
- Decoherence rates in large-scale quantum computers and macroscopic quantum systems
- Optimal population inversion of a single dissipative two-level system
- Quantum simulations of localization effects with dipolar interactions
- From quantum optimal control theory to coherent destruction of tunneling
- Classical leakage resilience from fault-tolerant quantum computation
- CONTROL AND ERROR PREVENTION IN CONDENSED MATTER QUANTUM COMPUTING DEVICES
- Algorithms on ensemble quantum computers
- A LSB quantum steganography algorithm based on hash encryption
- Fault-tolerant quantum computation using low-cost joint measurements
This page was built for publication: Reliable quantum computers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4223940)
