Practical Topological Cluster State Quantum Computing Requires Loss Below 1%

Abstract

The surface code cannot be used when qubits vanish during computation; instead, a variant known as the topological cluster state is necessary. It has a gate error threshold of $0.75% and only requires nearest-neighbor interactions on a 2D array of qubits. Previous work on loss tolerance using this code only considered qubits vanishing during measurement. We begin by also including qubit loss during two-qubit gates and initialization, and then additionally consider interaction errors that occur when neighbors attempt to entangle with a qubit that isn't there. In doing so, we show that even our best case scenario requires a loss rate below 1% in order to avoid considerable space-time overhead.

12 pages, 19 figures

References in corpus (7)

• Fault-tolerant quantum computation with high threshold in two dimensions
• Topological fault-tolerance in cluster state quantum computation
• How good must single photon sources and detectors be for efficient linear optical quantum computation?
• Efficient Algorithms for Maximum Likelihood Decoding in the Surface Code
• Fast simulation of stabilizer circuits using a graph state representation
• Randomized benchmarking of atomic qubits in an optical lattice
• Proof of finite surface code threshold for matching

Cited by in corpus (21)

• Blueprint for a Scalable Photonic Fault-Tolerant Quantum Computer
• Almost-linear time decoding algorithm for topological codes
• Linear-Time Maximum Likelihood Decoding of Surface Codes over the Quantum Erasure Channel
• High threshold codes for neutral atom qubits with biased erasure errors
• Dual-rail encoding with superconducting cavities
• Characterization of Leakage Errors via Randomized Benchmarking
• Resource-efficient and fault-tolerant topological quantum computation with hybrid entanglement of light
• Robust Characterization of Loss Rates
• Fault-tolerance thresholds for the surface code with fabrication errors
• Fault-tolerant quantum computation with non-deterministic entangling gates
• All-photonic architectural roadmap for scalable quantum computing using Greenberger-Horne-Zeilinger states
• Leakage mitigation for quantum error correction using a mixed qubit scheme
• Highly photon loss tolerant quantum computing using hybrid qubits
• Tailored cluster states with high threshold under biased noise
• Noise threshold and resource cost of fault-tolerant quantum computing with Majorana fermions in hybrid systems
• Stable Symmetry-Protected Topological Phases in Systems with Heralded Noise
• Universal resource-efficient topological measurement-based quantum computation via color-code-based cluster states
• Modular architectures to deterministically generate graph states
• Accommodating Fabrication Defects on Floquet Codes with Minimal Hardware Requirements
• Distributed Quantum Computing Utilizing Multiple Codes on Imperfect Hardware
• Taming Rydberg Decay with Measurement-based Quantum Computation