Enhanced Fault-Tolerant Quantum Computing ind-Level Systems
Open accessThe DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Abstract
Error-correcting codes protect quantum information and form the basis of fault-tolerant quantum computing. Leading proposals for fault-tolerant quantum computation require codes with an exceedingly rare property, a transversal non-Clifford gate. Codes with the desired property are presented for d-level qudit systems with prime d. The codes use n=d-1 qudits and can detect up to ∼d/3 errors. We quantify the performance of these codes for one approach to quantum computation known as magic-state distillation. Unlike prior work, we find performance is always enhanced by increasing d.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Surface codes: Towards practical large-scale quantum computation
Fowler, A. G., Mariantoni, M., Martinis, J. M., & Cleland, A. N. (2012) · Physical Review A · doi:10.1103/physreva.86.032324 · Cited by 3,059
Gottesman, D., & Chuang, I. L. (1999) · Nature · doi:10.1038/46503 · Cited by 1,860
Universal quantum computation with ideal Clifford gates and noisy ancillas
Bravyi, S., & Kitaev, A. (2005) · Physical Review A · doi:10.1103/physreva.71.022316 · Cited by 1,525
Quantum computing with realistically noisy devices
Knill, E. (2005) · Nature · doi:10.1038/nature03350 · Cited by 1,184
Fault-Tolerant Quantum Computation with High Threshold in Two Dimensions
Raussendorf, R., & Harrington, J. (2007) · Physical Review Letters · doi:10.1103/physrevlett.98.190504 · Cited by 812
Stabilizer Codes and Quantum Error Correction
Gottesman, D. (1997) · arXiv · doi:10.48550/arxiv.quant-ph/9705052 · Cited by 753
Knill, E., Laflamme, R., & Zurek, W. H. (1998) · Science · doi:10.1126/science.279.5349.342 · Cited by 663
Fault-Tolerant Quantum Computation with Constant Error Rate
Aharonov, D., & Ben-Or, M. (2008) · SIAM Journal on Computing · doi:10.1137/s0097539799359385 · Cited by 513
Restrictions on Transversal Encoded Quantum Gate Sets
Eastin, B., & Knill, E. (2009) · Physical Review Letters · doi:10.1103/physrevlett.102.110502 · Cited by 457
A fault-tolerant one-way quantum computer
Raussendorf, R., Harrington, J., & Goyal, K. (2006) · Annals of Physics · doi:10.1016/j.aop.2006.01.012 · Cited by 397
Cited by
A universal qudit quantum processor with trapped ions
Ringbauer, M., Meth, M., Postler, L., Stricker, R., Blatt, R., Schindler, P., & Monz, T. (2022) · Nature Physics · doi:10.1038/s41567-022-01658-0 · Cited by 351
“These numbers compare well against the thresholds for quantum error correction, which for qubits are as high as ∼ 1% [27] and are expected to improve further with qudit dimension [28].”
BackgroundWhy I am optimistic about the silicon-photonic route to quantum computing
Rudolph, T. (2017) · APL Photonics · doi:10.1063/1.4976737 · Cited by 350
A programmable qudit-based quantum processor
Chi, Y., Huang, J., Zhang, Z., Mao, J., Zhou, Z., Chen, X., Zhai, C., Bao, J., Dai, T., Yuan, H., et al. (2022) · Nature Communications · doi:10.1038/s41467-022-28767-x · Cited by 273
Quantum Information Scrambling on a Superconducting Qutrit Processor
Blok, M. S., Ramasesh, V. V., Schuster, T., O’Brien, K., Kreikebaum, J. M., Dahlen, D., Morvan, A., Yoshida, B., Yao, N. Y., & Siddiqi, I. (2021) · Physical Review X · doi:10.1103/physrevx.11.021010 · Cited by 262
Quantum computation with realistic magic-state factories
O'Gorman, J., & Campbell, E. T. (2017) · Physical Review A · doi:10.1103/physreva.95.032338 · Cited by 158
Self-citationQuantum error correction of qudits beyond break-even
Brock, B. L., Singh, S., Eickbusch, A., Sivak, V. V., Ding, A. Z., Frunzio, L., Girvin, S. M., & Devoret, M. H. (2025) · Nature · doi:10.1038/s41586-025-08899-y · Cited by 64
Fernández de Fuentes, I., Botzem, T., Johnson, M. A. I., Vaartjes, A., Asaad, S., Mourik, V., Hudson, F. E., Itoh, K. M., Johnson, B. C., Jakob, A. M., et al. (2024) · Nature Communications · doi:10.1038/s41467-024-45368-y · Cited by 46
Empowering a qudit-based quantum processor by traversing the dual bosonic ladder
Nguyen, L. B., Goss, N., Siva, K., Kim, Y., Younis, E., Qing, B., Hashim, A., Santiago, D. I., & Siddiqi, I. (2024) · Nature Communications · doi:10.1038/s41467-024-51434-2 · Cited by 31
Entanglement transfer, accumulation and retrieval via quantum-walk-based qubit–qudit dynamics
Giordani, T., Innocenti, L., Suprano, A., Polino, E., Paternostro, M., Spagnolo, N., Sciarrino, F., & Ferraro, A. (2021) · New Journal of Physics · doi:10.1088/1367-2630/abdbe1 · Cited by 1
Maximal coin-walker entanglement in a ballistic quantum walk
Zhang, R., Yang, R., Guo, J., Sun, C.-W., Duan, J.-C., Zhou, H., Xie, Z., Xu, P., Gong, Y.-X., & Zhu, S.-N. (2022) · Physical Review A · doi:10.1103/physreva.105.042216 · Cited by 13
Metadata
- Authors
- Campbell, E. T.
- Venue
- Physical Review Letters
- Publisher
- American Physical Society (APS)
- Published
- 2014-12-03
- Volume
- 113
- Issue
- 23
- Pages
- 230501-230501
- ISSN
- 0031-9007 (ISSN-L)
- 1079-7114
- OpenAlex
- W1973237732
- Cited by
- 184
- References
- 15
- FWCI
- 7.92
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.