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
(94)- End-to-end fault tolerance
- Quantum limit on computational time and speed
- Simulating fermions on a quantum computer
- Quantum computing with spin qubits in semiconductor structures
- A quantum computing primer for operator theorists
- Quantum computation by measurement and quantum memory
- Optimal correction of concatenated fault-tolerant quantum codes
- Encoding an arbitrary state in a \([7, 1, 3]\) quantum error correction code
- Quantum computation in quantum-Hall systems.
- Suppressing environmental noise in quantum computation through pulse control.
- Classical leakage resilience from fault-tolerant quantum computation
- On the generalization of the construction of quantum codes from Hermitian self-orthogonal codes
- Error correction of the continuous-variable quantum hybrid computation on two-node cluster states: limit of squeezing
- Error scaling in fault tolerant quantum computation
- Quantum Parrondo's games under decoherence
- [[:Publication:2355591|Syndrome measurement strategies for the \(7,1,3\) code]]
- NMR quantum information processing
- Transferring multiqubit entanglement onto memory qubits in a decoherence-free subspace
- Additivity of decoherence measures for multiqubit quantum systems
- Design of a universal logic block for fault-tolerant realization of any logic operation in trapped-ion quantum circuits
- Hyperfine spin qubits in irradiated malonic acid: heat-bath algorithmic cooling
- Deterministic transfer of multiqubit GHZ entangled states and quantum secret sharing between different cavities
- Quantum computation and cryptography: An overview
- Quantum codes do not fix isotropic errors
- Stabilizer quantum codes defined by trace-depending polynomials
- Efficient universal leakage elimination for physical and encoded qubits
- Quantum simulations of localization effects with dipolar interactions
- Improving ancilla states for quantum computation
- [[:Publication:291572|Syndrome measurement order for the 7,1,3 quantum error correction code]]
- A new universal and fault-tolerant quantum basis
- Steane code single qubit Clifford gates
- Universal collective rotation channels and quantum error correction
- Braiding fluxes in Pauli Hamiltonian
- Quantum error correction and fault-tolerant quantum computing
- Quantum algorithms for algebraic problems
- Decoherence, einselection, and the quantum origins of the classical
- Quantum computers, factoring, and decoherence
- Multiple-particle interference and quantum error correction
- Quantum memory as a perpetuum mobile? Stability vs. reversibility of information processing
- Robust quantum spatial search
- Maximum density of quantum information in a scalable CMOS implementation of the hybrid qubit architecture
- Quantum computation and quantum information†
- Quantum control with noisy fields: computational complexity versus sensitivity to noise
- PROJECTED ENTANGLED STATES: PROPERTIES AND APPLICATIONS
- SIMPLE FAULT-TOLERANT ENCODING OVER q-ARY CSS QUANTUM CODES
- GENERAL CIRCUITS FOR INDIRECTING AND DISTRIBUTING MEASUREMENT IN QUANTUM COMPUTATION
- Quantum computer architecture for fast entropy extraction
- QUANTUM ERROR-CORRECTION FOR SPATIALLY CORRELATED ERRORS
- Homological error correction: Classical and quantum codes
- Resilient quantum computation: error models and thresholds
- Decoherence and entanglement degradation of a qubit-qutrit system in non-inertial frames
- Quantum Computation over Continuous Variables
- MEASURED QUANTUM FOURIER TRANSFORM OF 1024 QUBITS ON FIBER OPTICS
- On quantum discord for analyzing decoherence effect and deformation phenomena in entangled coherent bipartite state
- REALIZATION OF UNITARY MAPS VIA PROBABILISTIC PROGRAMMABLE QUANTUM PROCESSORS
- Efficient discrete approximations of quantum gates
- Topological quantum memory
- Hiding messages in quantum data
- scientific article; zbMATH DE number 1406150 (Why is no real title available?)
- Dual-code quantum computation model
- Indistinguishability-enhanced entanglement recovery by spatially localized operations and classical communication
- Generalized toric codes coupled to thermal baths
- Surface code quantum computing by lattice surgery
- Self-correcting quantum computers
- Unfolding the color code
- CONTROL AND ERROR PREVENTION IN CONDENSED MATTER QUANTUM COMPUTING DEVICES
- The logic of entanglement
- Quasiclassical computation
- Architecture of a Quantum Multicomputer Implementing Shor’s Algorithm
- [[:Publication:5696625|ERROR THRESHOLD ESTIMATION BY MEANS OF THE 7,1,3 CSS QUANTUM CODE]]
- QUANTUM COMPUTATION WITH RESTRICTED AMPLITUDES
- Decoherence rates in large-scale quantum computers and macroscopic quantum systems
- Quantum computing
- Decoherence of quantum registers in the weak-coupling limit
- Algorithms on ensemble quantum computers
- Optimal population inversion of a single dissipative two-level system
- From quantum optimal control theory to coherent destruction of tunneling
- Quantum computation with Turaev-Viro codes
- Logical qubit behavior model and fast simulation for surface code
- A branching space-times view on quantum error correction
- Bipartite entanglement purification with neutral atoms
- Fault-tolerant quantum computation using low-cost joint measurements
- The geometry of quantum computing
- Introduction to quantum error correction with stabilizer codes
- Fidelity of the sum of independent quantum computing errors
- New quantum MDS codes with flexible parameters from Hermitian self-orthogonal GRS codes
- A LSB quantum steganography algorithm based on hash encryption
- Reachable set of operators on controlled open quantum systems in a Markovian environment
- Global estimates of errors in quantum computation by the Feynman-Vernon formalism
- Martingale projections and quantum decoherence
- On the practicality of quantum sieving algorithms for the shortest vector problem
- Programmable quantum processors
- The breaking of quantum double symmetries by defect condensation
- Unitary R-matrices for topological quantum computing
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)
