arXiv:2609.19639
Quantum computers will not be that different: A blueprint for quantum computer architecture at scale
Torsten Hoefler, Matthias Troyer
Abstract
Quantum computers are technologically novel and unusual, but at system scale they should be engineered using many of the same principles that govern classical heterogeneous accelerators. This paper argues that utility-scale quantum architecture is primarily a cost-performance problem across a coupled quantum-classical system, leading to a blueprint for scalable quantum processing unit (QPU) design. Our architecture blueprint is organized around clean logical abstractions, hiding details and complexity of physical qubit modalities below the instruction set architecture (ISA) boundary, and specializes recurring functions aggressively to minimize the cost for utility scale quantum computations. Its low-level implementation through specialized local hardware for control, readout, and quantum error correction (QEC) closely resembles the architecture of high-performance network stacks. One of our main insights is that the design principles and the resulting architecture closely follow established practice from classical computing and networking.
AI Summary
This paper asks how utility-scale quantum computers should be organized as complete quantum–classical systems. Its premise is that, despite the novelty of quantum hardware, system-level architecture should draw on principles used for classical heterogeneous accelerators and high-performance networking. It frames scalable QPU design primarily as a cost–performance problem involving coupled quantum and classical resources, rather than treating the quantum device in isolation. The proposed blueprint centers on a logical instruction set architecture (ISA) that hides physical-qubit modality details below the interface. It combines this abstraction boundary with aggressive specialization of recurring operations. At lower levels, specialized local hardware handles control, readout, and quantum error correction. The abstract draws an analogy between this organization and high-performance network stacks, arguing that established classical design practices provide a basis for organizing these functions at scale. The stated contribution is an architectural blueprint and design argument, rather than a reported experimental demonstration or quantitative performance result. The abstract gives no resource estimates, latency or throughput targets, cost reductions, scaling bounds, or comparisons against alternative architectures. It also does not describe how the blueprint is evaluated or state explicit limitations. Because the full text is unavailable, the evidence supporting the proposed abstraction boundary, the scope of modality independence, and the tradeoffs introduced by specialized local hardware cannot be assessed from the supplied material.
Written by gpt-6.1-sol from the abstract only. Automated: it can be wrong.