Saved in:
| Main Authors: | , , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2506.03094 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915322188005376 |
|---|---|
| author | Yoder, Theodore J. Schoute, Eddie Rall, Patrick Pritchett, Emily Gambetta, Jay M. Cross, Andrew W. Carroll, Malcolm Beverland, Michael E. |
| author_facet | Yoder, Theodore J. Schoute, Eddie Rall, Patrick Pritchett, Emily Gambetta, Jay M. Cross, Andrew W. Carroll, Malcolm Beverland, Michael E. |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2506_03094 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Tour de gross: A modular quantum computer based on bivariate bicycle codes Yoder, Theodore J. Schoute, Eddie Rall, Patrick Pritchett, Emily Gambetta, Jay M. Cross, Andrew W. Carroll, Malcolm Beverland, Michael E. Quantum Physics 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. |
| title | Tour de gross: A modular quantum computer based on bivariate bicycle codes |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2506.03094 |