Interleaving: Modular architectures for fault-tolerant photonic quantum computing

Abstract

Useful fault-tolerant quantum computers require very large numbers of physical qubits. Quantum computers are often designed as arrays of static qubits executing gates and measurements. Photonic qubits require a different approach. In photonic fusion-based quantum computing (FBQC), the main hardware components are resource-state generators (RSGs) and fusion devices connected via waveguides and switches. RSGs produce small entangled states of a few photonic qubits, whereas fusion devices perform entangling measurements between different resource states, thereby executing computations. In addition, low-loss photonic delays such as optical fiber can be used as fixed-time quantum memories simultaneously storing thousands of photonic qubits. Here, we present a modular architecture for FBQC in which these components are combined to form "interleaving modules" consisting of one RSG with its associated fusion devices and a few fiber delays. Exploiting the multiplicative power of delays, each module can add thousands of physical qubits to the computational Hilbert space. Networks of modules are universal fault-tolerant quantum computers, which we demonstrate using surface codes and lattice surgery as a guiding example. Our numerical analysis shows that in a network of modules containing 1-km-long fiber delays, each RSG can generate four logical distance-35 surface-code qubits while tolerating photon loss rates above 2% in addition to the fiber-delay loss. We illustrate how the combination of interleaving with further uses of non-local fiber connections can reduce the cost of logical operations and facilitate the implementation of unconventional geometries such as periodic boundaries or stellated surface codes. Interleaving applies beyond purely optical architectures, and can also turn many small disconnected matter-qubit devices with transduction to photons into a large-scale quantum computer.

References in corpus (25)

• Fault-tolerant quantum computation by anyons
• Surface codes: Towards practical large-scale quantum computation
• Encoding a qubit in an oscillator
• Universal Quantum Computation with ideal Clifford gates and noisy ancillas
• Quantum Error Correction for Quantum Memories
• Reliable Quantum Computers
• Resource-efficient linear optical quantum computation
• Elucidating Reaction Mechanisms on Quantum Computers
• Roads towards fault-tolerant universal quantum computation
• Instantaneous non-local computation of low T-depth quantum circuits
• The Heisenberg Representation of Quantum Computers
• Topological Order with a Twist: Ising Anyons from an Abelian Model
• Quantum codes on a lattice with boundary
• A photonic cluster state machine gun
• Even more efficient quantum computations of chemistry through tensor hypercontraction
• Generation and sampling of quantum states of light in a silicon chip
• Almost-linear time decoding algorithm for topological codes
• From three-photon GHZ states to ballistic universal quantum computation
• Qubitization of Arbitrary Basis Quantum Chemistry Leveraging Sparsity and Low Rank Factorization
• Photonic tensor networks produced by a single quantum emitter
• Linear-Time Maximum Likelihood Decoding of Surface Codes over the Quantum Erasure Channel
• A simple scheme for universal linear optics quantum computing with constant experimental complexity using fiber-loops
• Fault-tolerant qubit from a constant number of components
• Sequential measurement-based quantum computing with memories
• Flexible layout of surface code computations using AutoCCZ states

Cited by in corpus (3)

• Low-overhead fault-tolerant quantum computing using long-range connectivity
• Quantifying nonlocality: how outperforming local quantum codes is expensive
• Fault-tolerant Quantum Error Correction Using a Linear Array of Emitters