A modular quantum computer based on Cornucopia codes
Abstract
Ultra-high-rate quantum error correction codes store many logical qubits in a single code block with few physical qubits. A fault-tolerant quantum computer, however, also requires a universal set of logical operations on individually addressable logical qubits, and the ancilla overhead of these operations may erode the advantage of the high encoding rate. Here, we propose the Cornucopia architecture, in which a universal set of logical operations is implemented at low overhead for the Cornucopia codes. In particular, we focus on the [[2844,1426,18]] Cornucopia code as an example and introduce a modular quantum computer built from such code blocks connected by bridges. Each block stores 1,426 logical qubits and serves as a universal logical processor. Exploiting the code's translation symmetry, we construct a family of reusable gadgets that individually address 1,422 logical qubits within each block. These gadgets support three universal logical instruction sets: basic, high-throughput and fixed-extractor. Excluding magic-state factories, a module with sufficient workspace to execute any instruction in the basic set requires an average of 4.1 physical qubits per logical qubit, compared with 3.0 for memory alone. The architecture thus preserves the resource advantage of ultra-high-rate quantum memory while enabling universal logical computation, providing a route towards low-overhead fault-tolerant quantum computers.
Related
- Geometry-optimized hyperbolic codes for modular fault-tolerant quantum architectures
- A collider as a quantum computer
- Discretisation of quantum feedback networks for implementation on a quantum computer
- Quantum computers will not be that different: A blueprint for quantum computer architecture at scale
- Dynamical Mean-Field Theory for Real Materials using Variational Quantum Compressed Time Evolution on a Quantum Computer
BibTeX
@misc{lu2026modular,
title = {{A modular quantum computer based on Cornucopia codes}},
author = {Zhide Lu and Weikang Li and Yinghao Ma and Hanyu Yan and Bingrun Wang and Yixuan Ma and Zheng-Zhi Sun and Dong-Ling Deng},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.19073},
eprint = {2610.19073},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.19073},
}
RIS
TY - UNPB
TI - A modular quantum computer based on Cornucopia codes
AU - Zhide Lu
AU - Weikang Li
AU - Yinghao Ma
AU - Hanyu Yan
AU - Bingrun Wang
AU - Yixuan Ma
AU - Zheng-Zhi Sun
AU - Dong-Ling Deng
PY - 2026
DA - 2026/10/15
PB - arXiv
DO - 10.48550/arxiv.2610.19073
UR - https://arxiv.org/abs/2610.19073
AB - Ultra-high-rate quantum error correction codes store many logical qubits in a single code block with few physical qubits. A fault-tolerant quantum computer, however, also requires a universal set of logical operations on individually addressable logical qubits, and the ancilla overhead of these operations may erode the advantage of the high encoding rate. Here, we propose the Cornucopia architecture, in which a universal set of logical operations is implemented at low overhead for the Cornucopia codes. In particular, we focus on the [[2844,1426,18]] Cornucopia code as an example and introduce a modular quantum computer built from such code blocks connected by bridges. Each block stores 1,426 logical qubits and serves as a universal logical processor. Exploiting the code's translation symmetry, we construct a family of reusable gadgets that individually address 1,422 logical qubits within each block. These gadgets support three universal logical instruction sets: basic, high-throughput and fixed-extractor. Excluding magic-state factories, a module with sufficient workspace to execute any instruction in the basic set requires an average of 4.1 physical qubits per logical qubit, compared with 3.0 for memory alone. The architecture thus preserves the resource advantage of ultra-high-rate quantum memory while enabling universal logical computation, providing a route towards low-overhead fault-tolerant quantum computers.
ER -