Tailoring Fault-Tolerance to Quantum Algorithms Article Swipe
YOU?
·
· 2024
· Open Access
·
· DOI: https://doi.org/10.48550/arxiv.2404.11953
The standard approach to universal fault-tolerant quantum computing is to develop a general purpose quantum error correction mechanism that can implement a universal set of logical gates fault-tolerantly. Given such a scheme, any quantum algorithm can be realized fault-tolerantly by composing the relevant logical gates from this set. However, we know that quantum computers provide a significant quantum advantage only for specific quantum algorithms. Hence, a universal quantum computer can likely gain from compiling such specific algorithms using tailored quantum error correction schemes. In this work, we take the first steps towards such algorithm-tailored quantum fault-tolerance. We consider Trotter circuits in quantum simulation, which is an important application of quantum computing. We develop a solve-and-stitch algorithm to systematically synthesize physical realizations of Clifford Trotter circuits on the well-known $\llbr n,n-2,2 \rrbr$ error-detecting code family. Our analysis shows that this family implements Trotter circuits with essentially optimal depth under reasonable assumptions, thereby serving as an illuminating example of tailored quantum error correction. We achieve fault-tolerance for these circuits using flag gadgets, which add minimal overhead. Importantly, the solve-and-stitch algorithm has the potential to scale beyond this specific example, as illustrated by a generalization to the four-qubit logical Clifford Trotter circuit on the $\llbr 20,4,2 \rrbr$ hypergraph product code, thereby providing a principled approach to tailored fault-tolerance in quantum computing.
Related Topics
- Type
- preprint
- Language
- en
- Landing Page
- http://arxiv.org/abs/2404.11953
- https://arxiv.org/pdf/2404.11953
- OA Status
- green
- Cited By
- 1
- Related Works
- 10
- OpenAlex ID
- https://openalex.org/W4394973396
Raw OpenAlex JSON
- OpenAlex ID
-
https://openalex.org/W4394973396Canonical identifier for this work in OpenAlex
- DOI
-
https://doi.org/10.48550/arxiv.2404.11953Digital Object Identifier
- Title
-
Tailoring Fault-Tolerance to Quantum AlgorithmsWork title
- Type
-
preprintOpenAlex work type
- Language
-
enPrimary language
- Publication year
-
2024Year of publication
- Publication date
-
2024-04-18Full publication date if available
- Authors
-
Zhuangzhuang Chen, Narayanan RengaswamyList of authors in order
- Landing page
-
https://arxiv.org/abs/2404.11953Publisher landing page
- PDF URL
-
https://arxiv.org/pdf/2404.11953Direct 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/2404.11953Direct OA link when available
- Concepts
-
Quantum, Fault tolerance, Computer science, Algorithm, Distributed computing, Physics, Quantum mechanicsTop concepts (fields/topics) attached by OpenAlex
- Cited by
-
1Total citation count in OpenAlex
- Citations by year (recent)
-
2025: 1Per-year citation counts (last 5 years)
- Related works (count)
-
10Other works algorithmically related by OpenAlex
Full payload
| id | https://openalex.org/W4394973396 |
|---|---|
| doi | https://doi.org/10.48550/arxiv.2404.11953 |
| ids.doi | https://doi.org/10.48550/arxiv.2404.11953 |
| ids.openalex | https://openalex.org/W4394973396 |
| fwci | |
| type | preprint |
| title | Tailoring Fault-Tolerance to Quantum Algorithms |
| 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.9954000115394592 |
| 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/T10237 |
| topics[1].field.id | https://openalex.org/fields/17 |
| topics[1].field.display_name | Computer Science |
| topics[1].score | 0.9416999816894531 |
| topics[1].domain.id | https://openalex.org/domains/3 |
| topics[1].domain.display_name | Physical Sciences |
| topics[1].subfield.id | https://openalex.org/subfields/1702 |
| topics[1].subfield.display_name | Artificial Intelligence |
| topics[1].display_name | Cryptography and Data Security |
| topics[2].id | https://openalex.org/T10020 |
| topics[2].field.id | https://openalex.org/fields/17 |
| topics[2].field.display_name | Computer Science |
| topics[2].score | 0.9214000105857849 |
| topics[2].domain.id | https://openalex.org/domains/3 |
| topics[2].domain.display_name | Physical Sciences |
| topics[2].subfield.id | https://openalex.org/subfields/1702 |
| topics[2].subfield.display_name | Artificial Intelligence |
| topics[2].display_name | Quantum Information and Cryptography |
| is_xpac | False |
| apc_list | |
| apc_paid | |
| concepts[0].id | https://openalex.org/C84114770 |
| concepts[0].level | 2 |
| concepts[0].score | 0.5314763188362122 |
| concepts[0].wikidata | https://www.wikidata.org/wiki/Q46344 |
| concepts[0].display_name | Quantum |
| concepts[1].id | https://openalex.org/C63540848 |
| concepts[1].level | 2 |
| concepts[1].score | 0.5095155835151672 |
| concepts[1].wikidata | https://www.wikidata.org/wiki/Q3140932 |
| concepts[1].display_name | Fault tolerance |
| concepts[2].id | https://openalex.org/C41008148 |
| concepts[2].level | 0 |
| concepts[2].score | 0.5089173316955566 |
| concepts[2].wikidata | https://www.wikidata.org/wiki/Q21198 |
| concepts[2].display_name | Computer science |
| concepts[3].id | https://openalex.org/C11413529 |
| concepts[3].level | 1 |
| concepts[3].score | 0.48916104435920715 |
| concepts[3].wikidata | https://www.wikidata.org/wiki/Q8366 |
| concepts[3].display_name | Algorithm |
| concepts[4].id | https://openalex.org/C120314980 |
| concepts[4].level | 1 |
| concepts[4].score | 0.24867954850196838 |
| concepts[4].wikidata | https://www.wikidata.org/wiki/Q180634 |
| concepts[4].display_name | Distributed computing |
| concepts[5].id | https://openalex.org/C121332964 |
| concepts[5].level | 0 |
| concepts[5].score | 0.14455276727676392 |
| concepts[5].wikidata | https://www.wikidata.org/wiki/Q413 |
| concepts[5].display_name | Physics |
| concepts[6].id | https://openalex.org/C62520636 |
| concepts[6].level | 1 |
| concepts[6].score | 0.11619660258293152 |
| concepts[6].wikidata | https://www.wikidata.org/wiki/Q944 |
| concepts[6].display_name | Quantum mechanics |
| keywords[0].id | https://openalex.org/keywords/quantum |
| keywords[0].score | 0.5314763188362122 |
| keywords[0].display_name | Quantum |
| keywords[1].id | https://openalex.org/keywords/fault-tolerance |
| keywords[1].score | 0.5095155835151672 |
| keywords[1].display_name | Fault tolerance |
| keywords[2].id | https://openalex.org/keywords/computer-science |
| keywords[2].score | 0.5089173316955566 |
| keywords[2].display_name | Computer science |
| keywords[3].id | https://openalex.org/keywords/algorithm |
| keywords[3].score | 0.48916104435920715 |
| keywords[3].display_name | Algorithm |
| keywords[4].id | https://openalex.org/keywords/distributed-computing |
| keywords[4].score | 0.24867954850196838 |
| keywords[4].display_name | Distributed computing |
| keywords[5].id | https://openalex.org/keywords/physics |
| keywords[5].score | 0.14455276727676392 |
| keywords[5].display_name | Physics |
| keywords[6].id | https://openalex.org/keywords/quantum-mechanics |
| keywords[6].score | 0.11619660258293152 |
| keywords[6].display_name | Quantum mechanics |
| language | en |
| locations[0].id | pmh:oai:arXiv.org:2404.11953 |
| 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/2404.11953 |
| 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/2404.11953 |
| locations[1].id | doi:10.48550/arxiv.2404.11953 |
| 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.2404.11953 |
| indexed_in | arxiv, datacite |
| authorships[0].author.id | https://openalex.org/A5008344915 |
| authorships[0].author.orcid | https://orcid.org/0000-0002-0336-1181 |
| authorships[0].author.display_name | Zhuangzhuang Chen |
| authorships[0].author_position | first |
| authorships[0].raw_author_name | Chen, Zhuangzhuang |
| authorships[0].is_corresponding | False |
| authorships[1].author.id | https://openalex.org/A5070430560 |
| authorships[1].author.orcid | https://orcid.org/0000-0002-2369-3159 |
| authorships[1].author.display_name | Narayanan Rengaswamy |
| authorships[1].author_position | last |
| authorships[1].raw_author_name | Rengaswamy, Narayanan |
| authorships[1].is_corresponding | False |
| has_content.pdf | False |
| has_content.grobid_xml | False |
| is_paratext | False |
| open_access.is_oa | True |
| open_access.oa_url | https://arxiv.org/pdf/2404.11953 |
| open_access.oa_status | green |
| open_access.any_repository_has_fulltext | False |
| created_date | 2025-10-10T00:00:00 |
| display_name | Tailoring Fault-Tolerance to Quantum Algorithms |
| 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.9954000115394592 |
| 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 |
| related_works | https://openalex.org/W4391375266, https://openalex.org/W2748952813, https://openalex.org/W2051487156, https://openalex.org/W2073681303, https://openalex.org/W2390279801, https://openalex.org/W2358668433, https://openalex.org/W2376932109, https://openalex.org/W2001405890, https://openalex.org/W2382290278, https://openalex.org/W4391913857 |
| 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:2404.11953 |
| 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/2404.11953 |
| 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/2404.11953 |
| primary_location.id | pmh:oai:arXiv.org:2404.11953 |
| 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/2404.11953 |
| 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/2404.11953 |
| publication_date | 2024-04-18 |
| publication_year | 2024 |
| referenced_works_count | 0 |
| abstract_inverted_index.a | 11, 21, 30, 55, 65, 113, 190, 209 |
| abstract_inverted_index.In | 83 |
| abstract_inverted_index.We | 96, 111, 161 |
| abstract_inverted_index.an | 105, 153 |
| abstract_inverted_index.as | 152, 187 |
| abstract_inverted_index.be | 36 |
| abstract_inverted_index.by | 39, 189 |
| abstract_inverted_index.in | 100, 215 |
| abstract_inverted_index.is | 8, 104 |
| abstract_inverted_index.of | 24, 108, 121, 156 |
| abstract_inverted_index.on | 125, 199 |
| abstract_inverted_index.to | 3, 9, 116, 181, 192, 212 |
| abstract_inverted_index.we | 49, 86 |
| abstract_inverted_index.Our | 134 |
| abstract_inverted_index.The | 0 |
| abstract_inverted_index.add | 171 |
| abstract_inverted_index.any | 32 |
| abstract_inverted_index.can | 19, 35, 69 |
| abstract_inverted_index.for | 60, 164 |
| abstract_inverted_index.has | 178 |
| abstract_inverted_index.set | 23 |
| abstract_inverted_index.the | 41, 88, 126, 175, 179, 193, 200 |
| abstract_inverted_index.code | 132 |
| abstract_inverted_index.flag | 168 |
| abstract_inverted_index.from | 45, 72 |
| abstract_inverted_index.gain | 71 |
| abstract_inverted_index.know | 50 |
| abstract_inverted_index.only | 59 |
| abstract_inverted_index.set. | 47 |
| abstract_inverted_index.such | 29, 74, 92 |
| abstract_inverted_index.take | 87 |
| abstract_inverted_index.that | 18, 51, 137 |
| abstract_inverted_index.this | 46, 84, 138, 184 |
| abstract_inverted_index.with | 143 |
| abstract_inverted_index.Given | 28 |
| abstract_inverted_index.code, | 206 |
| abstract_inverted_index.depth | 146 |
| abstract_inverted_index.error | 15, 80, 159 |
| abstract_inverted_index.first | 89 |
| abstract_inverted_index.gates | 26, 44 |
| abstract_inverted_index.scale | 182 |
| abstract_inverted_index.shows | 136 |
| abstract_inverted_index.steps | 90 |
| abstract_inverted_index.these | 165 |
| abstract_inverted_index.under | 147 |
| abstract_inverted_index.using | 77, 167 |
| abstract_inverted_index.which | 103, 170 |
| abstract_inverted_index.work, | 85 |
| abstract_inverted_index.$\llbr | 128, 201 |
| abstract_inverted_index.20,4,2 | 202 |
| abstract_inverted_index.Hence, | 64 |
| abstract_inverted_index.\rrbr$ | 130, 203 |
| abstract_inverted_index.beyond | 183 |
| abstract_inverted_index.family | 139 |
| abstract_inverted_index.likely | 70 |
| abstract_inverted_index.Trotter | 98, 123, 141, 197 |
| abstract_inverted_index.achieve | 162 |
| abstract_inverted_index.circuit | 198 |
| abstract_inverted_index.develop | 10, 112 |
| abstract_inverted_index.example | 155 |
| abstract_inverted_index.family. | 133 |
| abstract_inverted_index.general | 12 |
| abstract_inverted_index.logical | 25, 43, 195 |
| abstract_inverted_index.minimal | 172 |
| abstract_inverted_index.n,n-2,2 | 129 |
| abstract_inverted_index.optimal | 145 |
| abstract_inverted_index.product | 205 |
| abstract_inverted_index.provide | 54 |
| abstract_inverted_index.purpose | 13 |
| abstract_inverted_index.quantum | 6, 14, 33, 52, 57, 62, 67, 79, 94, 101, 109, 158, 216 |
| abstract_inverted_index.scheme, | 31 |
| abstract_inverted_index.serving | 151 |
| abstract_inverted_index.thereby | 150, 207 |
| abstract_inverted_index.towards | 91 |
| abstract_inverted_index.Clifford | 122, 196 |
| abstract_inverted_index.However, | 48 |
| abstract_inverted_index.analysis | 135 |
| abstract_inverted_index.approach | 2, 211 |
| abstract_inverted_index.circuits | 99, 124, 142, 166 |
| abstract_inverted_index.computer | 68 |
| abstract_inverted_index.consider | 97 |
| abstract_inverted_index.example, | 186 |
| abstract_inverted_index.gadgets, | 169 |
| abstract_inverted_index.physical | 119 |
| abstract_inverted_index.realized | 37 |
| abstract_inverted_index.relevant | 42 |
| abstract_inverted_index.schemes. | 82 |
| abstract_inverted_index.specific | 61, 75, 185 |
| abstract_inverted_index.standard | 1 |
| abstract_inverted_index.tailored | 78, 157, 213 |
| abstract_inverted_index.advantage | 58 |
| abstract_inverted_index.algorithm | 34, 115, 177 |
| abstract_inverted_index.compiling | 73 |
| abstract_inverted_index.composing | 40 |
| abstract_inverted_index.computers | 53 |
| abstract_inverted_index.computing | 7 |
| abstract_inverted_index.implement | 20 |
| abstract_inverted_index.important | 106 |
| abstract_inverted_index.mechanism | 17 |
| abstract_inverted_index.overhead. | 173 |
| abstract_inverted_index.potential | 180 |
| abstract_inverted_index.providing | 208 |
| abstract_inverted_index.universal | 4, 22, 66 |
| abstract_inverted_index.algorithms | 76 |
| abstract_inverted_index.computing. | 110, 217 |
| abstract_inverted_index.correction | 16, 81 |
| abstract_inverted_index.four-qubit | 194 |
| abstract_inverted_index.hypergraph | 204 |
| abstract_inverted_index.implements | 140 |
| abstract_inverted_index.principled | 210 |
| abstract_inverted_index.reasonable | 148 |
| abstract_inverted_index.synthesize | 118 |
| abstract_inverted_index.well-known | 127 |
| abstract_inverted_index.algorithms. | 63 |
| abstract_inverted_index.application | 107 |
| abstract_inverted_index.correction. | 160 |
| abstract_inverted_index.essentially | 144 |
| abstract_inverted_index.illustrated | 188 |
| abstract_inverted_index.significant | 56 |
| abstract_inverted_index.simulation, | 102 |
| abstract_inverted_index.Importantly, | 174 |
| abstract_inverted_index.assumptions, | 149 |
| abstract_inverted_index.illuminating | 154 |
| abstract_inverted_index.realizations | 120 |
| abstract_inverted_index.fault-tolerant | 5 |
| abstract_inverted_index.generalization | 191 |
| abstract_inverted_index.systematically | 117 |
| abstract_inverted_index.error-detecting | 131 |
| abstract_inverted_index.fault-tolerance | 163, 214 |
| abstract_inverted_index.fault-tolerance. | 95 |
| abstract_inverted_index.fault-tolerantly | 38 |
| abstract_inverted_index.solve-and-stitch | 114, 176 |
| abstract_inverted_index.fault-tolerantly. | 27 |
| abstract_inverted_index.algorithm-tailored | 93 |
| cited_by_percentile_year | |
| countries_distinct_count | 0 |
| institutions_distinct_count | 2 |
| citation_normalized_percentile |