Fault-tolerant quantum computation with constant error
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Polynomial-time quantum algorithms for Pell's equation and the principal ideal problem
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Algorithms for quantum computation: discrete logarithms and factoring
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Quantum accuracy threshold for concatenated distance-3 codes
Quantum Information & Computation
Nonlocal quantum information in bipartite quantum error correction
Quantum Information Processing
Noise threshold for a fault-tolerant two-dimensional lattice architecture
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
Fault-tolerant ancilla preparation and noise threshold lower boudds for the 23-qubit Golay code
Quantum Information & Computation
Hi-index | 0.00 |
An arbitrarily reliable quantum computer can be efficiently constructed from noisy components using a recursive simulation procedure, provided that those components fail with probability less than the fault-tolerance threshold. Recent estimates of the threshold are near some experimentally achieved gate ?delities. However, the landscape of threshold estimates includes pseudothresholds, threshold estimates based on a subset of components and a low level of the recursion. In this paper, we observe that pseudothresholds are a generic phenomenon in fault-tolerant computation. We define pseudothresholds and present classical and quantum fault-tolerant circuits exhibiting pseudothresholds that differ by a factor of 4 from fault-tolerance thresholds for typical relationships between component failure rates. We develop tools for visualizing how reliability is influenced by recursive simulation in order to determine the asymptotic threshold. Finally, we conjecture that refinements of these methods may establish upper bounds on the fault-tolerance threshold for particular codes and noise models.