Heterogeneous architectures enable a 138x reduction in physical qubit requirements for fault-tolerant quantum computing under detailed accounting
- 1Q-CTRL
Abstract
Quantum computer hardware is predicted to scale over hundreds of thousands of qubits coming online in the next decade. Despite significant theoretical and experimental QEC progress, quantum computer architecture has suffered a significant gap, with bottom-up physical-device-driven challenges largely disconnected from top-down QEC-code-driven considerations. In this work, we unify these two views, presenting a complete heterogeneous quantum computing architecture incorporating task-specific hardware selection and QEC encoding, and agnostic to code selection or physical qubit parameters. Our approach further enables special-purpose processing modules, and includes a full microarchitecture for fault-tolerant implementation of interfaces between quantum processing units and quantum memories. Using this architecture and a new fully featured compiler functioning across subsystems at the scale of 1,000 logical qubits, we schedule and orchestrate a variety of algorithms down to hardware-specific instructions; a detailed accounting of all operations reveals up to 551x reduction in algorithmic logical error and up to 138x reduction in physical-qubit overhead compared to a monolithic baseline architecture. We then consider the factorization of 2048-bit RSA-integers; using an experimentally demonstrated grid-coupling topology, factoring RSA-2048 requires 381k physical qubits and 9.2 days, which can be reduced to 4.9 days via addition of an algorithm-specific accelerator for the Adder subroutine (requiring 439k qubits). Finally, assuming hypothetical long-range coupling, implementing quantum memory using qLDPC codes reduces the resources required for factoring to just 190k qubits and under 10 days. These results and the tooling we have built indicate that heterogeneous quantum-computer architectures can deliver significant, verifiable benefits on realistic hardware.
Related
- Divide et Impera quantum neural networks for modular hybrid computing architectures
- Nakayama's reduction of quantum topos and Bayesian quantum computing
- Error Suppression in Distributed Quantum Computing with Heterogeneous-Distance Lattice Surgery
- A boundary integral method for computing electron repulsion integrals in heterogeneous dielectric environments
- Low-x parton densities accounting for absorptive effects and exclusive J/ψ and Υ data from the LHC
BibTeX
@article{mundada2026heterogeneous,
title = {{Heterogeneous architectures enable a 138x reduction in physical qubit requirements for fault-tolerant quantum computing under detailed accounting}},
author = {Pranav S. Mundada and Aleksei Khindanov and Yulun Wang and Claire L Edmunds and Paul Coote and Michael Biercuk and Yuval Baum and Michael Robert Hush},
journal = {New Journal of Physics},
year = {2026},
month = oct,
doi = {10.1088/1367-2630/aeb71b},
url = {https://iopscience.iop.org/article/10.1088/1367-2630/aeb71b},
note = {CC BY 4.0},
}
RIS
TY - JOUR
TI - Heterogeneous architectures enable a 138x reduction in physical qubit requirements for fault-tolerant quantum computing under detailed accounting
AU - Pranav S. Mundada
AU - Aleksei Khindanov
AU - Yulun Wang
AU - Claire L Edmunds
AU - Paul Coote
AU - Michael Biercuk
AU - Yuval Baum
AU - Michael Robert Hush
PY - 2026
DA - 2026/10/21
JO - New Journal of Physics
DO - 10.1088/1367-2630/aeb71b
UR - https://iopscience.iop.org/article/10.1088/1367-2630/aeb71b
AB - Quantum computer hardware is predicted to scale over hundreds of thousands of qubits coming online in the next decade. Despite significant theoretical and experimental QEC progress, quantum computer architecture has suffered a significant gap, with bottom-up physical-device-driven challenges largely disconnected from top-down QEC-code-driven considerations. In this work, we unify these two views, presenting a complete heterogeneous quantum computing architecture incorporating task-specific hardware selection and QEC encoding, and agnostic to code selection or physical qubit parameters. Our approach further enables special-purpose processing modules, and includes a full microarchitecture for fault-tolerant implementation of interfaces between quantum processing units and quantum memories. Using this architecture and a new fully featured compiler functioning across subsystems at the scale of 1,000 logical qubits, we schedule and orchestrate a variety of algorithms down to hardware-specific instructions; a detailed accounting of all operations reveals up to 551x reduction in algorithmic logical error and up to 138x reduction in physical-qubit overhead compared to a monolithic baseline architecture. We then consider the factorization of 2048-bit RSA-integers; using an experimentally demonstrated grid-coupling topology, factoring RSA-2048 requires 381k physical qubits and 9.2 days, which can be reduced to 4.9 days via addition of an algorithm-specific accelerator for the Adder subroutine (requiring 439k qubits). Finally, assuming hypothetical long-range coupling, implementing quantum memory using qLDPC codes reduces the resources required for factoring to just 190k qubits and under 10 days. These results and the tooling we have built indicate that heterogeneous quantum-computer architectures can deliver significant, verifiable benefits on realistic hardware.
SN - 1367-2630
ER -