Tour de gross: A modular quantum computer based on bivariate bicycle codes Article Swipe
YOU?
·
· 2025
· Open Access
·
· DOI: https://doi.org/10.48550/arxiv.2506.03094
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.
Related Topics
- Type
- preprint
- Language
- en
- Landing Page
- http://arxiv.org/abs/2506.03094
- https://arxiv.org/pdf/2506.03094
- OA Status
- green
- Cited By
- 1
- OpenAlex ID
- https://openalex.org/W4415135947
Raw OpenAlex JSON
- OpenAlex ID
-
https://openalex.org/W4415135947Canonical identifier for this work in OpenAlex
- DOI
-
https://doi.org/10.48550/arxiv.2506.03094Digital Object Identifier
- Title
-
Tour de gross: A modular quantum computer based on bivariate bicycle codesWork title
- Type
-
preprintOpenAlex work type
- Language
-
enPrimary language
- Publication year
-
2025Year of publication
- Publication date
-
2025-06-03Full publication date if available
- Authors
-
Theodore J. Yoder, Eddie Schoute, Patrick Rall, Emily Pritchett, Jay Gambetta, Andrew W. Cross, Malcolm S. Carroll, Michael E. BeverlandList of authors in order
- Landing page
-
https://arxiv.org/abs/2506.03094Publisher landing page
- PDF URL
-
https://arxiv.org/pdf/2506.03094Direct link to full text PDF
- Open access
-
YesWhether a free full text is available
- OA status
-
greenOpen access status per OpenAlex
- OA URL
-
https://arxiv.org/pdf/2506.03094Direct OA link when available
- Cited by
-
1Total citation count in OpenAlex
- Citations by year (recent)
-
2025: 1Per-year citation counts (last 5 years)
Full payload
| id | https://openalex.org/W4415135947 |
|---|---|
| doi | https://doi.org/10.48550/arxiv.2506.03094 |
| ids.doi | https://doi.org/10.48550/arxiv.2506.03094 |
| ids.openalex | https://openalex.org/W4415135947 |
| fwci | |
| type | preprint |
| title | Tour de gross: A modular quantum computer based on bivariate bicycle codes |
| biblio.issue | |
| biblio.volume | |
| biblio.last_page | |
| biblio.first_page | |
| topics[0].id | https://openalex.org/T10682 |
| topics[0].field.id | https://openalex.org/fields/17 |
| topics[0].field.display_name | Computer Science |
| topics[0].score | 0.9940000176429749 |
| topics[0].domain.id | https://openalex.org/domains/3 |
| topics[0].domain.display_name | Physical Sciences |
| topics[0].subfield.id | https://openalex.org/subfields/1702 |
| topics[0].subfield.display_name | Artificial Intelligence |
| topics[0].display_name | Quantum Computing Algorithms and Architecture |
| topics[1].id | https://openalex.org/T12162 |
| topics[1].field.id | https://openalex.org/fields/17 |
| topics[1].field.display_name | Computer Science |
| topics[1].score | 0.9753999710083008 |
| topics[1].domain.id | https://openalex.org/domains/3 |
| topics[1].domain.display_name | Physical Sciences |
| topics[1].subfield.id | https://openalex.org/subfields/1703 |
| topics[1].subfield.display_name | Computational Theory and Mathematics |
| topics[1].display_name | Cellular Automata and Applications |
| is_xpac | False |
| apc_list | |
| apc_paid | |
| language | en |
| locations[0].id | pmh:oai:arXiv.org:2506.03094 |
| locations[0].is_oa | True |
| locations[0].source.id | https://openalex.org/S4306400194 |
| locations[0].source.issn | |
| locations[0].source.type | repository |
| locations[0].source.is_oa | True |
| locations[0].source.issn_l | |
| locations[0].source.is_core | False |
| locations[0].source.is_in_doaj | False |
| locations[0].source.display_name | arXiv (Cornell University) |
| locations[0].source.host_organization | https://openalex.org/I205783295 |
| locations[0].source.host_organization_name | Cornell University |
| locations[0].source.host_organization_lineage | https://openalex.org/I205783295 |
| locations[0].license | |
| locations[0].pdf_url | https://arxiv.org/pdf/2506.03094 |
| locations[0].version | submittedVersion |
| locations[0].raw_type | text |
| locations[0].license_id | |
| locations[0].is_accepted | False |
| locations[0].is_published | False |
| locations[0].raw_source_name | |
| locations[0].landing_page_url | http://arxiv.org/abs/2506.03094 |
| locations[1].id | doi:10.48550/arxiv.2506.03094 |
| locations[1].is_oa | True |
| locations[1].source.id | https://openalex.org/S4306400194 |
| locations[1].source.issn | |
| locations[1].source.type | repository |
| locations[1].source.is_oa | True |
| locations[1].source.issn_l | |
| locations[1].source.is_core | False |
| locations[1].source.is_in_doaj | False |
| locations[1].source.display_name | arXiv (Cornell University) |
| locations[1].source.host_organization | https://openalex.org/I205783295 |
| locations[1].source.host_organization_name | Cornell University |
| locations[1].source.host_organization_lineage | https://openalex.org/I205783295 |
| locations[1].license | |
| locations[1].pdf_url | |
| locations[1].version | |
| locations[1].raw_type | article |
| locations[1].license_id | |
| locations[1].is_accepted | False |
| locations[1].is_published | |
| locations[1].raw_source_name | |
| locations[1].landing_page_url | https://doi.org/10.48550/arxiv.2506.03094 |
| indexed_in | arxiv, datacite |
| authorships[0].author.id | https://openalex.org/A5002718143 |
| authorships[0].author.orcid | https://orcid.org/0000-0001-9614-2836 |
| authorships[0].author.display_name | Theodore J. Yoder |
| authorships[0].author_position | first |
| authorships[0].raw_author_name | Yoder, Theodore J. |
| authorships[0].is_corresponding | False |
| authorships[1].author.id | https://openalex.org/A5018327737 |
| authorships[1].author.orcid | https://orcid.org/0000-0002-5613-1443 |
| authorships[1].author.display_name | Eddie Schoute |
| authorships[1].author_position | middle |
| authorships[1].raw_author_name | Schoute, Eddie |
| authorships[1].is_corresponding | False |
| authorships[2].author.id | https://openalex.org/A5065493775 |
| authorships[2].author.orcid | |
| authorships[2].author.display_name | Patrick Rall |
| authorships[2].author_position | middle |
| authorships[2].raw_author_name | Rall, Patrick |
| authorships[2].is_corresponding | False |
| authorships[3].author.id | https://openalex.org/A5069411274 |
| authorships[3].author.orcid | |
| authorships[3].author.display_name | Emily Pritchett |
| authorships[3].author_position | middle |
| authorships[3].raw_author_name | Pritchett, Emily |
| authorships[3].is_corresponding | False |
| authorships[4].author.id | https://openalex.org/A5030701195 |
| authorships[4].author.orcid | https://orcid.org/0000-0002-4620-0978 |
| authorships[4].author.display_name | Jay Gambetta |
| authorships[4].author_position | middle |
| authorships[4].raw_author_name | Gambetta, Jay M. |
| authorships[4].is_corresponding | False |
| authorships[5].author.id | https://openalex.org/A5064909614 |
| authorships[5].author.orcid | https://orcid.org/0000-0001-9786-8196 |
| authorships[5].author.display_name | Andrew W. Cross |
| authorships[5].author_position | middle |
| authorships[5].raw_author_name | Cross, Andrew W. |
| authorships[5].is_corresponding | False |
| authorships[6].author.id | https://openalex.org/A5048321503 |
| authorships[6].author.orcid | https://orcid.org/0000-0001-5381-8998 |
| authorships[6].author.display_name | Malcolm S. Carroll |
| authorships[6].author_position | middle |
| authorships[6].raw_author_name | Carroll, Malcolm |
| authorships[6].is_corresponding | False |
| authorships[7].author.id | https://openalex.org/A5119980292 |
| authorships[7].author.orcid | |
| authorships[7].author.display_name | Michael E. Beverland |
| authorships[7].author_position | last |
| authorships[7].raw_author_name | Beverland, Michael E. |
| authorships[7].is_corresponding | False |
| has_content.pdf | True |
| has_content.grobid_xml | True |
| is_paratext | False |
| open_access.is_oa | True |
| open_access.oa_url | https://arxiv.org/pdf/2506.03094 |
| open_access.oa_status | green |
| open_access.any_repository_has_fulltext | False |
| created_date | 2025-10-14T00:00:00 |
| display_name | Tour de gross: A modular quantum computer based on bivariate bicycle codes |
| has_fulltext | False |
| is_retracted | False |
| updated_date | 2025-11-06T06:51:31.235846 |
| primary_topic.id | https://openalex.org/T10682 |
| primary_topic.field.id | https://openalex.org/fields/17 |
| primary_topic.field.display_name | Computer Science |
| primary_topic.score | 0.9940000176429749 |
| primary_topic.domain.id | https://openalex.org/domains/3 |
| primary_topic.domain.display_name | Physical Sciences |
| primary_topic.subfield.id | https://openalex.org/subfields/1702 |
| primary_topic.subfield.display_name | Artificial Intelligence |
| primary_topic.display_name | Quantum Computing Algorithms and Architecture |
| cited_by_count | 1 |
| counts_by_year[0].year | 2025 |
| counts_by_year[0].cited_by_count | 1 |
| locations_count | 2 |
| best_oa_location.id | pmh:oai:arXiv.org:2506.03094 |
| best_oa_location.is_oa | True |
| best_oa_location.source.id | https://openalex.org/S4306400194 |
| best_oa_location.source.issn | |
| best_oa_location.source.type | repository |
| best_oa_location.source.is_oa | True |
| best_oa_location.source.issn_l | |
| best_oa_location.source.is_core | False |
| best_oa_location.source.is_in_doaj | False |
| best_oa_location.source.display_name | arXiv (Cornell University) |
| best_oa_location.source.host_organization | https://openalex.org/I205783295 |
| best_oa_location.source.host_organization_name | Cornell University |
| best_oa_location.source.host_organization_lineage | https://openalex.org/I205783295 |
| best_oa_location.license | |
| best_oa_location.pdf_url | https://arxiv.org/pdf/2506.03094 |
| best_oa_location.version | submittedVersion |
| best_oa_location.raw_type | text |
| best_oa_location.license_id | |
| best_oa_location.is_accepted | False |
| best_oa_location.is_published | False |
| best_oa_location.raw_source_name | |
| best_oa_location.landing_page_url | http://arxiv.org/abs/2506.03094 |
| primary_location.id | pmh:oai:arXiv.org:2506.03094 |
| primary_location.is_oa | True |
| primary_location.source.id | https://openalex.org/S4306400194 |
| primary_location.source.issn | |
| primary_location.source.type | repository |
| primary_location.source.is_oa | True |
| primary_location.source.issn_l | |
| primary_location.source.is_core | False |
| primary_location.source.is_in_doaj | False |
| primary_location.source.display_name | arXiv (Cornell University) |
| primary_location.source.host_organization | https://openalex.org/I205783295 |
| primary_location.source.host_organization_name | Cornell University |
| primary_location.source.host_organization_lineage | https://openalex.org/I205783295 |
| primary_location.license | |
| primary_location.pdf_url | https://arxiv.org/pdf/2506.03094 |
| primary_location.version | submittedVersion |
| primary_location.raw_type | text |
| primary_location.license_id | |
| primary_location.is_accepted | False |
| primary_location.is_published | False |
| primary_location.raw_source_name | |
| primary_location.landing_page_url | http://arxiv.org/abs/2506.03094 |
| publication_date | 2025-06-03 |
| publication_year | 2025 |
| referenced_works_count | 0 |
| abstract_inverted_index.a | 5, 53, 91 |
| abstract_inverted_index.12 | 29 |
| abstract_inverted_index.We | 0, 51, 106 |
| abstract_inverted_index.an | 80 |
| abstract_inverted_index.be | 88 |
| abstract_inverted_index.in | 18, 112 |
| abstract_inverted_index.of | 45, 60, 82, 94 |
| abstract_inverted_index.on | 11, 97, 102 |
| abstract_inverted_index.to | 57 |
| abstract_inverted_index.we | 32, 73 |
| abstract_inverted_index.18, | 31 |
| abstract_inverted_index.For | 21 |
| abstract_inverted_index.and | 30, 39, 117 |
| abstract_inverted_index.can | 87 |
| abstract_inverted_index.the | 2, 41, 46, 58, 61, 98 |
| abstract_inverted_index.two | 22 |
| abstract_inverted_index.LDPC | 15 |
| abstract_inverted_index.code | 104, 113 |
| abstract_inverted_index.rate | 44 |
| abstract_inverted_index.sets | 38 |
| abstract_inverted_index.than | 101 |
| abstract_inverted_index.that | 79 |
| abstract_inverted_index.with | 27, 90 |
| abstract_inverted_index.based | 10 |
| abstract_inverted_index.codes | 16, 26 |
| abstract_inverted_index.error | 43 |
| abstract_inverted_index.given | 92 |
| abstract_inverted_index.order | 81 |
| abstract_inverted_index.prior | 19 |
| abstract_inverted_index.these | 71 |
| abstract_inverted_index.under | 48 |
| abstract_inverted_index.work. | 20 |
| abstract_inverted_index.larger | 84 |
| abstract_inverted_index.noise. | 50 |
| abstract_inverted_index.number | 93 |
| abstract_inverted_index.qubits | 96 |
| abstract_inverted_index.adapted | 56 |
| abstract_inverted_index.bicycle | 3, 25, 62, 99 |
| abstract_inverted_index.circuit | 49, 68, 115 |
| abstract_inverted_index.develop | 52 |
| abstract_inverted_index.further | 108 |
| abstract_inverted_index.logical | 36, 42, 85 |
| abstract_inverted_index.modular | 6 |
| abstract_inverted_index.perform | 74 |
| abstract_inverted_index.present | 1 |
| abstract_inverted_index.quantum | 7, 14, 67 |
| abstract_inverted_index.surface | 103 |
| abstract_inverted_index.through | 110 |
| abstract_inverted_index.advances | 111 |
| abstract_inverted_index.circuits | 86 |
| abstract_inverted_index.designs, | 116 |
| abstract_inverted_index.enabling | 64 |
| abstract_inverted_index.estimate | 40 |
| abstract_inverted_index.explicit | 34 |
| abstract_inverted_index.physical | 95 |
| abstract_inverted_index.resource | 76 |
| abstract_inverted_index.specific | 23 |
| abstract_inverted_index.strategy | 55 |
| abstract_inverted_index.bivariate | 24 |
| abstract_inverted_index.computing | 8 |
| abstract_inverted_index.construct | 33 |
| abstract_inverted_index.distances | 28 |
| abstract_inverted_index.estimates | 77 |
| abstract_inverted_index.framework | 9 |
| abstract_inverted_index.magnitude | 83 |
| abstract_inverted_index.universal | 66 |
| abstract_inverted_index.anticipate | 107 |
| abstract_inverted_index.end-to-end | 75 |
| abstract_inverted_index.execution. | 69 |
| abstract_inverted_index.high-rate, | 12 |
| abstract_inverted_index.identified | 17 |
| abstract_inverted_index.Integrating | 70 |
| abstract_inverted_index.compilation | 54, 118 |
| abstract_inverted_index.components, | 72 |
| abstract_inverted_index.constraints | 59 |
| abstract_inverted_index.implemented | 89 |
| abstract_inverted_index.instruction | 37 |
| abstract_inverted_index.large-scale | 65 |
| abstract_inverted_index.techniques. | 119 |
| abstract_inverted_index.architecture | 100 |
| abstract_inverted_index.improvements | 109 |
| abstract_inverted_index.instructions | 47 |
| abstract_inverted_index.low-overhead | 13 |
| abstract_inverted_index.architecture, | 4, 63 |
| abstract_inverted_index.demonstrating | 78 |
| abstract_inverted_index.architectures. | 105 |
| abstract_inverted_index.constructions, | 114 |
| abstract_inverted_index.fault-tolerant | 35 |
| cited_by_percentile_year | |
| countries_distinct_count | 0 |
| institutions_distinct_count | 8 |
| citation_normalized_percentile |