Fault-tolerant quantum computation with constant error
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Secure multi-party quantum computation
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Reliable computation with cellular automata
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Fault-tolerant quantum computation
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Toward a world with quantum computers
Communications of the ACM - ACM's plan to go online first
Can quantum mechanics help distributed computing?
ACM SIGACT News
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
Nonlocal quantum information in bipartite quantum error correction
Quantum Information Processing
The role of symmetries in adiabatic quantum algorithms
Quantum Information & Computation
A flow-map model for analyzing pseudothresholds in fault-tolerant quantum computing
Quantum Information & Computation
Fault-tolerant quantum computation for local leakage faults
Quantum Information & Computation
Noise threshold for a fault-tolerant two-dimensional lattice architecture
Quantum Information & Computation
Accuracy threshold for postselected quantum computation
Quantum Information & Computation
Universal fault tolerant quantum computation on bilinear nearest neighbor arrays
Quantum Information & Computation
A comparative code study for quantum fault tolerance
Quantum Information & Computation
Latency in local, two-dimensional, fault-tolerant quantum computing
Quantum Information & Computation
Fault-tolerance threshold for a distance-three quantum code
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Constructing arbitrary steane code single logical qubit fault-tolerant gates
Quantum Information & Computation
Universal quantum computation and leakage reduction in the 3-qubit decoherence free subsystem
Quantum Information & Computation
Optimal correction of concatenated fault-tolerant quantum codes
Quantum Information Processing
Encoding an arbitrary state in a [7,1,3] quantum error correction code
Quantum Information Processing
Fault-tolerant ancilla preparation and noise threshold lower boudds for the 23-qubit Golay code
Quantum Information & Computation
Sufficient condition on noise correlations for scalable quantum computing
Quantum Information & Computation
The robustness of magic state distillation against errors in Clifford gates
Quantum Information & Computation
| Hi-index | 0.00 |
We prove a new version of the quantum threshold theorem that applies to concatenationof a quantum code that corrects only one error, and we use this theorem to derive arigorous lower bound on the quantum accuracy" threshold ε0. Our proof also appliesto concatenation of higher-distance codes, and to noise models that allow faults to becorrelated in space and in time. The proof uses new criteria for assessing the accuracy" offault-tolerant circuits, which are particularly conducive to the inductive analysis of recur-sire simulations. Our lower bound on the threshold, ε0 ≥ 2.73 × 10-5 for an adversarialindependent stochastic noise model, is derived from a computer-assisted combinatorialanaly sis; it is the best lower bound that has been rigorously proven so far.