Superconducting qubits in the millions: The potential and limitations of modularity
S.N. Saadatmand, Tyler L. Wilson, Mark J. Hodson, Mark Field, Simon J. Devitt, Madhav Krishnan Vijayan, Alan Robertson, Thinh P. Le, Jannis Ruh, Alexandru Paler, Arshpreet Singh Maan, Ioana Moflic, Athena Caesura, Josh Y. Mutus
DOI 10.1103/k3d5-v43c · Physical Review Applied
Active bibliographic source — not scientific approval
Bibliographic access preserves source history; it does not approve extracted materials or validate reported claims. Review warnings on each occurrence separately.
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 physical layout, thermal load, and modular connectivity of the system. 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.
Similar papers
Long-range coupling and scalable architecture for superconducting flux qubits
similarity 0.89Austin G. Fowler et al.
Source status unknown — claims are unverified
Integration and Resource Estimation of Cryoelectronics for Superconducting Fault-Tolerant Quantum Computers
similarity 0.88Shiro Kawabata · 2026 · arXiv:2601.03922
Source status unknown — claims are unverified
Fluctuations of Energy-Relaxation Times in Superconducting Qubits
similarity 0.88P. V. Klimov et al.
Source status unknown — claims are unverified
Digitized adiabatic quantum computing with a superconducting circuit
similarity 0.87R. Barends et al. · 2015 · arXiv:1511.03316
Source status unknown — claims are unverified
One-way quantum computing in superconducting circuits
similarity 0.87F. Albarrán-Arriagada et al.
Source status unknown — claims are unverified
Exploiting Dynamic Quantum Circuits in a Quantum Algorithm with Superconducting Qubits
similarity 0.87A. D. Córcoles et al.
Source status unknown — claims are unverified