The Fibonacci scheme for fault-tolerant quantum computation

Abstract

We rigorously analyze Knill's Fibonacci scheme for fault-tolerant quantum computation, which is based on the recursive preparation of Bell states protected by a concatenated error-detecting code. We prove lower bounds on the threshold fault rate of .67\times 10^{-3} for adversarial local stochastic noise, and 1.25\times 10^{-3} for independent depolarizing noise. In contrast to other schemes with comparable proved accuracy thresholds, the Fibonacci scheme has a significantly reduced overhead cost because it uses postselection far more sparingly.

24 pages, 10 figures; supersedes arXiv:0709.3603. (v2): Additional discussion about the overhead cost

References in corpus (5)

• Universal Quantum Computation with ideal Clifford gates and noisy ancillas
• Quantum Computing with Very Noisy Devices
• Topological fault-tolerance in cluster state quantum computation
• Subsystem fault tolerance with the Bacon-Shor code
• Fault-tolerant quantum computation against biased noise

Cited by in corpus (33)

• Quantum information with Rydberg atoms
• Quantum Error Correction for Quantum Memories
• Demonstration of qubit operations below a rigorous fault tolerance threshold with gate set tomography
• Gate Set Tomography
• Bias-preserving gates with stabilized cat qubits
• Rapid Driven Reset of a Qubit Readout Resonator
• Fidelity of a Rydberg blockade quantum gate from simulated quantum process tomography
• Fault-tolerant quantum computing with color codes
• Fault-tolerant quantum computation versus Gaussian noise
• Optimal control for non-Markovian open quantum systems
• A logical qubit in a linear array of semiconductor quantum dots
• Quantum simulation of dissipative collective effects on noisy quantum computers
• Fault-Tolerant Topological One-Way Quantum Computation with Probabilistic Two-Qubit Gates
• Optimal control of fast and high-fidelity quantum gates with electron and nuclear spins of a nitrogen-vacancy center in diamond
• Maps for general open quantum systems and a theory of linear quantum error correction
• Analysis of a controlled phase gate using circular Rydberg states
• Optimal control for fast and high-fidelity quantum gates in coupled superconducting flux qubits
• Fault-tolerant quantum computation using large spin cat-codes
• Compressive gate set tomography
• Accuracy threshold for concatenated error detection in one dimension
• Quantum Computation with Topological Codes: from qubit to topological fault-tolerance
• Topological One-Way Quantum Computation on Verified Logical Cluster States
• Cluster-based architecture for fault-tolerant quantum computation
• Optimal control of the silicon-based donor electron spin quantum computing
• Benchmarking quantum logic operations relative to thresholds for fault tolerance
• Optimal correction of concatenated fault-tolerant quantum codes
• Efficient diagnostics for quantum error correction
• A lower bound on the space overhead of fault-tolerant quantum computation
• An introduction to reliable quantum computation
• Resource optimization for fault-tolerant quantum computing
• Fibonacci schemes of fault-tolerant quantum computation
• Prospects for Quantum Computing
• Performance and Error Analysis of Knill's Postselection Scheme in a Two-Dimensional Architecture