Network Requirements for Distributed Quantum Computation

Abstract

Physical constraints and engineering challenges, including wafer dimensions, classical control cabling, and refrigeration volumes, impose significant limitations on the scalability of quantum computing units. As a result, a modular quantum computing architecture, comprising small processors interconnected by quantum links, is emerging as a promising approach to fault-tolerant quantum computing. However, the requirements that the network must fulfill to enable distributed quantum computation remain largely unexplored. We consider an architecture tailored for qubits with nearest-neighbor physical connectivity, leveraging the surface code for error correction and enabling fault-tolerant operations through lattice surgery and magic state distillation. We propose measurement teleportation as a tool to extend lattice surgery techniques to qubits located on different computing units interconnected via Bell pairs. Through memory simulations, we build an error model for logical operations and deduce an end-to-end resource estimation of Shor's algorithm over a minimalist distributed architecture. Concretely, for a characteristic physical gate error rate of 1e-3, a processor cycle time of 1 microsecond, factoring a 2048-bit RSA integer is shown to be possible with 379 computing processors, each made with 89781 qubits, with negligible space and time overhead with respect to a monolithic approach without parallelization, if 70 Bell pairs are available per cycle time between each processor with a fidelity exceeding 98.1 percent.

References in corpus (34)

• Surface codes: Towards practical large-scale quantum computation
• Topological quantum memory
• Universal Quantum Computation with ideal Clifford gates and noisy ancillas
• Suppressing quantum errors by scaling a surface code logical qubit
• How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits
• Roads towards fault-tolerant universal quantum computation
• Surface code quantum computing by lattice surgery
• High-threshold and low-overhead fault-tolerant quantum memory
• A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery
• Stim: a fast stabilizer circuit simulator
• Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity
• A Race Track Trapped-Ion Quantum Processor
• Distributed Quantum Computation Based-on Small Quantum Registers
• Low-distance Surface Codes under Realistic Quantum Noise
• Topological quantum computing with a very noisy network and local error rates approaching one percent
• Distributed Quantum Computing: a Survey
• Magic State Distillation: Not as Costly as You Think
• Fault-tolerant thresholds for quantum error correction with the surface code
• Entanglement purification for Quantum Computation
• Sparse Blossom: correcting a million errors per core second with minimum-weight matching
• Circuit knitting with classical communication
• Optimized Entanglement Purification
• Lattice Surgery with a Twist: Simplifying Clifford Gates of Surface Codes
• Universal quantum computing with twist-free and temporally encoded lattice surgery
• Entanglement purification and protection in a superconducting quantum network
• Combining quantum processors with real-time classical communication
• Quantum algorithms: A survey of applications and end-to-end complexities
• Distributed quantum information processing with minimal local resources
• Distributed quantum error correction for chip-level catastrophic errors
• A circuit-level protocol and analysis for twist-based lattice surgery
• Inplace Access to the Surface Code Y Basis
• Error-corrected Hadamard gate simulated at the circuit level
• Optimizing quantum error correction protocols with erasure qubits
• Optimized noise-resilient surface code teleportation interfaces