Superconducting qubits in the millions: the potential and limitations of modularity
arXiv:2406.06015 · doi:10.1103/k3d5-v43c
Abstract
The development of fault-tolerant quantum computers (FTQCs) is receiving increasing attention within the quantum computing community. Like conventional digital computers, FTQCs, which utilize error correction and millions of physical qubits, have the potential to address some of humanity's grand challenges. However, accurate estimates of the tangible scale of future FTQCs, based on transparent assumptions, are uncommon. How many physical qubits are necessary to solve a practical problem intractable for classical hardware? What costs arise from distributing quantum computation across multiple machines? This paper presents an architectural model of a potential FTQC based on superconducting qubits, divided into discrete modules and interconnected via coherent links. We employ a resource estimation framework and software tool to assess the physical resources required to execute specific quantum algorithms compiled into their graph-state form and arranged onto a modular superconducting hardware architecture. Our tool can predict the size, power consumption, and execution time of these algorithms based on explicit assumptions about the system's physical layout, thermal load, and modular connectivity. We assess the resources needed for quantum computation examples that serve as building blocks of proposed applications, quantifying the architectural bottlenecks and trade-offs that remain to be addressed to deliver utility.
References in corpus (54)
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Surface codes: Towards practical large-scale quantum computation
- Measurement-based quantum computation with cluster states
- Quantum Computing with Very Noisy Devices
- Strong quantum computational advantage using a superconducting quantum processor
- Suppressing quantum errors by scaling a surface code logical qubit
- Multi-party entanglement in graph states
- Hamiltonian Simulation by Qubitization
- Optimal Hamiltonian Simulation by Quantum Signal Processing
- Quantum error correction below the surface code threshold
- Roads towards fault-tolerant universal quantum computation
- Surface code quantum computing by lattice surgery
- A tunable coupling scheme for implementing high-fidelity two-qubit gates
- Cluster-state quantum computation
- 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
- Even more efficient quantum computations of chemistry through tensor hypercontraction
- 3D integrated superconducting qubits
- Automated optimization of large quantum circuits with continuous parameters
- Magic State Distillation: Not as Costly as You Think
- Heisenberg-limited ground state energy estimation for early fault-tolerant quantum computers
- Fast simulation of stabilizer circuits using a graph state representation
- Reliably assessing the electronic structure of cytochrome P450 on today's classical computers and tomorrow's quantum computers
- Strange metallicity in the doped Hubbard model
- Improving wafer-scale Josephson junction resistance variation in superconducting quantum coherent circuits
- Digital simulation of non-Abelian anyons with 68 programmable superconducting qubits
- Poking holes and cutting corners to achieve Clifford gates with the surface code
- Fault-Tolerant High Level Quantum Circuits: Form, Compilation and Description
- Benchmark study of the two-dimensional Hubbard model with auxiliary-field quantum Monte Carlo method
- Chemistry Beyond the Scale of Exact Diagonalization on a Quantum-Centric Supercomputer
- Lattice Surgery with a Twist: Simplifying Clifford Gates of Surface Codes
- Relaxing Hardware Requirements for Surface Code Circuits using Time-dynamics
- Comparing neural network based decoders for the surface code
- Floating tunable coupler for scalable quantum computing architectures
- High-coherence superconducting qubits made using industry-standard, advanced semiconductor manufacturing
- Efficient Fully-Coherent Quantum Signal Processing Algorithms for Real-Time Dynamics Simulation
- Quantum algorithms: A survey of applications and end-to-end complexities
- Coupler-Assisted Controlled-Phase Gate with Enhanced Adiabaticity
- Shorter quantum circuits via single-qubit gate approximation
- Projected Density Matrix Embedding Theory with Applications to the Two-Dimensional Hubbard Model
- Modular Superconducting Qubit Architecture with a Multi-chip Tunable Coupler
- Universal Fault-Tolerant Quantum Computing with Stabiliser Codes
- Alternating Bias Assisted Annealing of Amorphous Oxide Tunnel Junctions
- Pipelined correlated minimum weight perfect matching of the surface code
- Simulating both parity sectors of the Hubbard Model with Tensor Networks
- Compilation of algorithm-specific graph states for quantum circuits
- Single-Step Parity Check Gate Set for Quantum Error Correction
- Design and testing of the New Muon Lab cryogenic system at Fermilab
- Thermodynamics of the disordered Hubbard model studied via numerical linked-cluster expansions
- Cryogenic Thermal Modeling of Microwave High Density Signaling
- A Substrate Scheduler for Compiling Arbitrary Fault-tolerant Graph States
- Optimal Scheduling of Graph States via Path Decompositions