A fast quantum mechanical algorithm for database search
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Fault-tolerant quantum computation with constant error
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
SIAM Journal on Computing
Fault-tolerant quantum computation
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Quantum accuracy threshold for concatenated distance-3 codes
Quantum Information & Computation
A flow-map model for analyzing pseudothresholds in fault-tolerant quantum computing
Quantum Information & Computation
Noise threshold for a fault-tolerant two-dimensional lattice architecture
Quantum Information & Computation
Implementation of Shor's algorithm on a linear nearest neighbour qubit array
Quantum Information & Computation
Threshold error penalty for fault-tolerant quantum computation with nearest neighbor communication
IEEE Transactions on Nanotechnology
Surface code quantum error correction incorporating accurate error propagation
Quantum Information & Computation
| Hi-index | 0.00 |
Assuming an array that consists of two parallel lines of qubits and that permits only nearest neighbor interactions, we construct physical and logical circuitry to enable universal fault tolerant quantum computation under the [[7, 1, 3]] quantum code. A rigorous lower bound to the fault tolerant threshold for this array is determined in a number of physical settings. Adversarial memory errors, two-qubit gate errors and readout errors are included in our analysis. In the setting where the physical memory failure rate is equal to one-tenth of the physical gate error rate, the physical readout error rate is equal to the physical gate error rate, and the duration of physical readout is ten times the duration of a physical gate, we obtain a lower bound to the asymptotic threshold of 1.96 × 10-6.