Fully fault tolerant quantum computation with non-deterministic gates
arXiv:1008.1369 · doi:10.1103/PhysRevLett.105.250502
Abstract
In certain approaches to quantum computing the operations between qubits are non-deterministic and likely to fail. For example, a distributed quantum processor would achieve scalability by networking together many small components; operations between components should assumed to be failure prone. In the logical limit of this architecture each component contains only one qubit. Here we derive thresholds for fault tolerant quantum computation under such extreme paradigms. We find that computation is supported for remarkably high failure rates (exceeding 90%) providing that failures are heralded, meanwhile the rate of unknown errors should not exceed 2 in 10^4 operations.
5 pages, 3 figs
References in corpus (8)
- Fault-tolerant quantum computation with high threshold in two dimensions
- Resource-efficient linear optical quantum computation
- Topological fault-tolerance in cluster state quantum computation
- Brokered Graph State Quantum Computing
- Scalable Generation of Graph-State Entanglement through Realistic Linear Optics
- Fault-Tolerant Topological One-Way Quantum Computation with Probabilistic Two-Qubit Gates
- Strategies for the preparation of large cluster states using non-deterministic gates
- Parity measurement of one- and two-electron double well systems
Cited by in corpus (42)
- Large Scale Modular Quantum Computer Architecture with Atomic Memory and Photonic Interconnects
- Ultrafast and Fault-Tolerant Quantum Communication across Long Distances
- Photonic architecture for scalable quantum information processing in NV-diamond
- Local and Distributed Quantum Computation
- Magic state distillation in all prime dimensions using quantum Reed-Muller codes
- Fault-tolerant thresholds for quantum error correction with the surface code
- Blind topological measurement-based quantum computation
- Resource costs for fault-tolerant linear optical quantum computing
- Foliated Quantum Codes
- Independent high-purity photons created in domain-engineered crystals
- Ancilla-Driven Universal Blind Quantum Computation
- Robust-fidelity atom-photon entangling gates in the weak-coupling regime
- A logical qubit in a linear array of semiconductor quantum dots
- Verifiable fault-tolerance in measurement-based quantum computation
- Fault-Tolerant Topological One-Way Quantum Computation with Probabilistic Two-Qubit Gates
- Resource-efficient and fault-tolerant topological quantum computation with hybrid entanglement of light
- Thermal States as Universal Resources for Quantum Computation with Always-on Interactions
- Fault-tolerant quantum computation with non-deterministic entangling gates
- High threshold distributed quantum computing with three-qubit nodes
- All-photonic architectural roadmap for scalable quantum computing using Greenberger-Horne-Zeilinger states
- Measurement-free topological protection using dissipative feedback
- Topologically protected measurement-based quantum computation on the thermal state of a nearest-neighbor two-body Hamiltonian with spin-3/2 particles
- High photon-loss threshold quantum computing using GHZ-state measurements
- Quantum Computation with Topological Codes: from qubit to topological fault-tolerance
- Long range failure-tolerant entanglement distribution
- A Spin-Optical Quantum Computing Architecture
- Highly photon loss tolerant quantum computing using hybrid qubits
- Tailoring fusion-based error correction for high thresholds to biased fusion failures
- Acausal measurement-based quantum computing
- Graph-theoretical optimization of fusion-based graph state generation
- Robust and Scalable Scheme to Generate Large-Scale Entanglement Webs
- Fast graph operations in quantum computation
- Nonlinear Domain Engineering for Quantum Technologies
- Universal resource-efficient topological measurement-based quantum computation via color-code-based cluster states
- Decoding Schemes for Foliated Sparse Quantum Error Correcting Codes
- Parity-encoding-based quantum computing with Bayesian error tracking
- Efficient quantum computation in a network with probabilistic gates and logical encoding
- Cluster state generation with ageing qubits
- Quantum entanglement distribution using a magnetic field sensor
- Computational quantum-classical boundary of complex and noisy quantum systems
- Programming quantum computers using 3-D puzzles, coffee cups, and doughnuts
- Quantum information and statistical mechanics: an introduction to frontier