Fault-Tolerant Quantum Computation with Local Gates
arXiv:quant-ph/9903099 · doi:10.1080/09500340008244046
Abstract
I discuss how to perform fault-tolerant quantum computation with concatenated codes using local gates in small numbers of dimensions. I show that a threshold result still exists in three, two, or one dimensions when next-to-nearest-neighbor gates are available, and present explicit constructions. In two or three dimensions, I also show how nearest-neighbor gates can give a threshold result. In all cases, I simply demonstrate that a threshold exists, and do not attempt to optimize the error correction circuit or determine the exact value of the threshold. The additional overhead due to the fault-tolerance in both space and time is polylogarithmic in the error rate per logical gate.
14 pages, LaTeX
Cited by in corpus (57)
- The Physical Implementation of Quantum Computation
- Topological quantum memory
- Quantum Error Correction for Quantum Memories
- Demonstration of a small programmable quantum computer with atomic qubits
- Quantum Error Correction for Beginners
- Quantum information processing with circuit quantum electrodynamics
- Theory of Decoherence-Free Fault-Tolerant Universal Quantum Computation
- Spin transport and quasi 2D architectures for donor-based quantum computing
- Fault-Tolerant Quantum Computation For Local Non-Markovian Noise
- Large Scale Quantum Computation in an Anharmonic Linear Ion Trap
- Repeat-Until-Success quantum computing using stationary and flying qubits
- Internal Consistency of Fault-Tolerant Quantum Error Correction in Light of Rigorous Derivations of the Quantum Markovian Limit
- Fault-tolerant quantum computation with few qubits
- Blind topological measurement-based quantum computation
- Local Fault-tolerant Quantum Computation
- A Quantum to Classical Phase Transition in Noisy Quantum Computers
- Coherent spin state transfer via Heisenberg exchange
- Efficient classical simulation of noisy random quantum circuits in one dimension
- Entanglement of multiparty stabilizer, symmetric, and antisymmetric states
- Fault tolerant architectures for superconducting qubits
- Why should anyone care about computing with anyons?
- A statistical mechanics view on Kitaev's proposal for quantum memories
- Quantum coding with low-depth random circuits
- Empirical Determination of Bang-Bang Operations
- A logical qubit in a linear array of semiconductor quantum dots
- Time-Efficient Constant-Space-Overhead Fault-Tolerant Quantum Computation
- Quantum multiplexing
- Resource Requirements for Fault-Tolerant Quantum Simulation: The Transverse Ising Model Ground State
- Threshold Error Penalty for Fault Tolerant Computation with Nearest Neighbour Communication
- Level Reduction and the Quantum Threshold Theorem
- Quantum Computation under Micromotion in a Planar Ion Crystal
- Multi-qubit compensation sequences
- 3-d topological quantum memory with a power-law energy barrier
- Error-detection-based quantum fault tolerance against discrete Pauli noise
- Computation on Spin Chains with Limited Access
- Accuracy threshold for concatenated error detection in one dimension
- Long-distance quantum communication over noisy networks without long-time quantum memory
- Fault-Tolerant Quantum Computation with Constant Overhead
- Is Fault-Tolerant Quantum Computation Really Possible?
- Quantum Computing and Error Correction
- High Fidelity Quantum Gates for Trapped Ions under Micromotion
- On the Effect of Quantum Interaction Distance on Quantum Addition Circuits
- Hierarchical memories: Simulating quantum LDPC codes with local gates
- Towards Large-Scale Quantum Computation
- Informationally complete measurements on bipartite quantum systems: comparing local with global measurements
- Quantum error correction benchmarks for continuous weak parity measurements
- Comparison of memory thresholds for planar qudit geometries
- The quest and hope of Majorana zero modes in topological superconductor for fault-tolerant quantum computing: an introductory overview
- Low-depth random Clifford circuits for quantum coding against Pauli noise using a tensor-network decoder
- Quantum Refrigerator
- Concatenate codes, save qubits
- An introduction to reliable quantum computation
- Postselection threshold against biased noise
- Quantum Memory Hierarchies: Efficient Designs to Match Available Parallelism in Quantum Computing
- Quantum memories and Landauer's principle
- Programming quantum computers using 3-D puzzles, coffee cups, and doughnuts
- A Quantum Logic Array Microarchitecture: Scalable Quantum Data Movement and Computation