Tour de gross: A modular quantum computer based on bivariate bicycle codes
Abstract
We present the bicycle architecture, a modular quantum computing framework based on high-rate, low-overhead quantum LDPC codes identified in prior work. For two specific bivariate bicycle codes with distances 12 and 18, we construct explicit fault-tolerant logical instruction sets and estimate the logical error rate of the instructions under circuit noise. We develop a compilation strategy adapted to the constraints of the bicycle architecture, enabling large-scale universal quantum circuit execution. Integrating these components, we perform end-to-end resource estimates demonstrating that an order of magnitude larger logical circuits can be implemented with a given number of physical qubits on the bicycle architecture than on surface code architectures. We anticipate further improvements through advances in code constructions, circuit designs, and compilation techniques.
Cite
@article{arxiv.2506.03094,
title = {Tour de gross: A modular quantum computer based on bivariate bicycle codes},
author = {Theodore J. Yoder and Eddie Schoute and Patrick Rall and Emily Pritchett and Jay M. Gambetta and Andrew W. Cross and Malcolm Carroll and Michael E. Beverland},
journal= {arXiv preprint arXiv:2506.03094},
year = {2025}
}