Fusion-based quantum computation

Abstract

We introduce fusion-based quantum computing (FBQC) - a model of universal quantum computation in which entangling measurements, called fusions, are performed on the qubits of small constant-sized entangled resource states. We introduce a stabilizer formalism for analyzing fault tolerance and computation in these schemes. This framework naturally captures the error structure that arises in certain physical systems for quantum computing, such as photonics. FBQC can offer significant architectural simplifications, enabling hardware made up of many identical modules, requiring an extremely low depth of operations on each physical qubit and reducing classical processing requirements. We present two pedagogical examples of fault-tolerant schemes constructed in this framework and numerically evaluate their threshold under a hardware agnostic fusion error model including both erasure and Pauli error. We also study an error model of linear optical quantum computing with probabilistic fusion and photon loss. In FBQC the non-determinism of fusion is directly dealt with by the quantum error correction protocol, along with other errors. We find that tailoring the fault-tolerance framework to the physical system allows the scheme to have a higher threshold than schemes reported in literature. We present a ballistic scheme which can tolerate a 10.4% probability of suffering photon loss in each fusion.

Cited by in corpus (21)

• Quantum Computational Advantage via High-Dimensional Gaussian Boson Sampling
• Perceval: A Software Platform for Discrete Variable Photonic Quantum Computing
• Real-Time Decoding for Fault-Tolerant Quantum Computing: Progress, Challenges and Outlook
• Reducing $g^{(2)}(0)$ of a parametric down-conversion source via photon-number resolution with superconducting nanowire detectors
• Type-II fractons from coupled spin chains and layers
• Digital Discovery of 100 diverse Quantum Experiments with PyTheus
• Error-correcting entanglement swapping using a practical logical photon encoding
• Topological-Graph Dependencies and Scaling Properties of a Heuristic Qubit-Assignment Algorithm
• Protocol for generation of high-dimensional entanglement from an array of non-interacting photon emitters
• Compilation of algorithm-specific graph states for quantum circuits
• Timing constraints imposed by classical digital control systems on photonic implementations of measurement-based quantum computing
• A prototype of quantum von Neumann architecture
• Intra-QLAN Connectivity: beyond the Physical Topology
• A compiler for universal photonic quantum computers
• Local tensor-network codes
• Do different kinds of photon-pair sources have the same indistinguishability in quantum silicon photonics?
• Enhancement of a silicon waveguide single photon source by temporal multiplexing
• Generation of photonic tensor network states with Circuit QED
• Universal quantum computation via quantum controlled classical operations
• Measurement-based interleaved randomised benchmarking using IBM processors
• A Concise Primer on Solid-State Quantum Emitters