Sufficient condition on noise correlations for scalable quantum computing
arXiv:1207.6131
Abstract
I study the effectiveness of fault-tolerant quantum computation against correlated Hamiltonian noise, and derive a sufficient condition for scalability. Arbitrarily long quantum computations can be executed reliably provided that noise terms acting collectively on k system qubits are sufficiently weak, and decay sufficiently rapidly with increasing k and with increasing spatial separation of the qubits.
13 pages, 1 figure. (v2) Minor corrections and clarifications
References in corpus (20)
- Dynamical Decoupling of Open Quantum Systems
- Reliable Quantum Computers
- A Theory of Quantum Error-Correcting Codes
- Fault-tolerant quantum computation with long-range correlated noise
- Fault-Tolerant Quantum Computation For Local Non-Markovian Noise
- Combining dynamical decoupling with fault-tolerant quantum computation
- Dynamical description of quantum computing: generic nonlocality of quantum noise
- Quantum accuracy threshold for concatenated distance-3 codes
- Fault-tolerant quantum computation versus Gaussian noise
- Limitations of Noisy Reversible Computation
- How Quantum Computers Fail: Quantum Codes, Correlations in Physical Systems, and Noise Accumulation
- Resilient Quantum Computation in Correlated Environments: A Quantum Phase Transition Perspective
- Hamiltonian Formulation of Quantum Error Correction and Correlated Noise: The Effects Of Syndrome Extraction in the Long Time Limit
- Is Fault-Tolerant Quantum Computation Really Possible?
- Decoherence in quantum walks and quantum computers
- Quantum Computers: Noise Propagation and Adversarial Noise Models
- Bound on quantum computation time: Quantum error correction in a critical environment
- Detrimental Decoherence
- Comment on "Resilient Quantum Computation in Correlated Environments: A Quantum Phase Transition Perspective" and "Fault-tolerant Quantum Computation with Longe-range Correlated Noise"
- Quantum memory as a perpetuum mobile? Stability v.s. reversibility of information processing