Universal transversal gates with color codes: A simplified approach
Open accessThe DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
Abstract
We provide a simplified yet rigorous presentation of the ideas from Bomb\'{\i}n's paper (arXiv:1311.0879v3). Our presentation is self-contained, and assumes only basic concepts from quantum error correction. We provide an explicit construction of a family of color codes in arbitrary dimensions and describe some of their crucial properties. Within this framework, we explicitly show how to transversally implement the generalized phase gate ${R}_{n}=\text{diag}(1,{e}^{2\ensuremath{\pi}i/{2}^{n}})$, which deviates from the method in the aforementioned paper, allowing an arguably simpler proof. We describe how to implement the Hadamard gate $H$ fault tolerantly using code switching. In three dimensions, this yields, together with the transversal controlled-not (cnot), a fault-tolerant universal gate set ${H,cnot,{R}_{3}}$ without state distillation.
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
Quantum Computation and Quantum Information: 10th Anniversary Edition
Nielsen, M. A., & Chuang, I. L. (2012) · doi:10.1017/cbo9780511976667 · Cited by 8,436
Non-Abelian anyons and topological quantum computation
Nayak, C., Simon, S. H., Stern, A., Freedman, M., & Das Sarma, S. (2008) · Reviews of Modern Physics · doi:10.1103/revmodphys.80.1083 · Cited by 6,861
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
Improved simulation of stabilizer circuits
Aaronson, S., & Gottesman, D. (2004) · Physical Review A · doi:10.1103/physreva.70.052328 · Cited by 1,515
Quantum computations: algorithms and error correction
Kitaev, A. Y. (1997) · Russian Mathematical Surveys · doi:10.1070/rm1997v052n06abeh002155 · Cited by 1,424
Class of quantum error-correcting codes saturating the quantum Hamming bound
Gottesman, D. (1996) · Physical Review A · doi:10.1103/physreva.54.1862 · Cited by 1,227
Preskill, J. (1998) · Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.1998.0167 · Cited by 994
Quantum Error Correction and Orthogonal Geometry
Calderbank, A. R., Rains, E. M., Shor, P. W., & Sloane, N. J. A. (1997) · Physical Review Letters · doi:10.1103/physrevlett.78.405 · Cited by 811
Research works printed but not linked: 18
- 10.1016/S0003-4916(02)00018-0 · DOI · Paper page
- 10.1103/PhysRevB.71.045110 · DOI · Paper page
- P. Shor, 1996, Proceedings of 37th Conference on Foundations of Computer Science
- 10.1103/PhysRevA.64.052309 · DOI · Paper page
- 10.1126/science.1231930 · DOI · Paper page
- 10.1103/PhysRevLett.112.010505 · DOI · Paper page
- 10.1103/PhysRevLett.111.090505 · DOI · Paper page
- 10.1103/PhysRevLett.113.080501 · DOI · Paper page
- 10.1103/PhysRevLett.110.170503 · DOI · Paper page
- 10.1103/PhysRevA.91.012305 · DOI · Paper page
- H. Bombín, 2013, Topological Codes, 10.1017/CBO9781139034807.021 · DOI
- 10.1103/PhysRevB.75.075103 · DOI · Paper page
- D. Gottesman, 1999, Proceedings of the XXII International Colloquium on Group Theoretical Methods in Physics
- R. J. Wilson, 1996, Introduction to Graph Theory
- A. Hatcher, 2002, Algebraic Topology
- 10.1103/PhysRevLett.95.230504 · DOI · Paper page
- F. MacWilliams, 1977, The Theory of Error-Correcting Codes
- 10.1109/18.771249 · DOI · Paper page
Cited by
Logical quantum processor based on reconfigurable atom arrays
Bluvstein, D., Evered, S. J., Geim, A. A., Li, S. H., Zhou, H., Manovitz, T., Ebadi, S., Cain, M., Kalinowski, M., Hangleiter, D., et al. (2024) · Nature · doi:10.1038/s41586-023-06927-3 · Cited by 1,119
“This has important consequences for the allowed transversal gate set 41,93 .”
BackgroundRoads towards fault-tolerant universal quantum computation
Campbell, E. T., Terhal, B. M., & Vuillot, C. (2017) · Nature · doi:10.1038/nature23460 · Cited by 596
Triangular color codes on trivalent graphs with flag qubits
Chamberland, C., Kubica, A., Yoder, T. J., & Zhu, G. (2020) · New Journal of Physics · doi:10.1088/1367-2630/ab68fd · Cited by 105
Self-citationBeverland, M. E., Kubica, A., & Svore, K. M. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.020341 · Cited by 82
Self-citationError rates and resource overheads of repetition cat qubits
Guillaud, J., & Mirrahimi, M. (2021) · Physical Review A · doi:10.1103/physreva.103.042413 · Cited by 55
Metadata
- Authors
- Kubica, A., & Beverland, M. E.
- Venue
- Physical Review A
- Publisher
- American Physical Society (APS)
- Published
- 2015-03-31
- Volume
- 91
- Issue
- 3
- ISSN
- 0556-2791 (ISSN-L)
- 1050-2947
- 1094-1622
- OpenAlex
- W2019836938
- Cited by
- 128
- References
- 17
- FWCI
- 8.76
- Type
- journal article
- Language
- en
- Open access
- bronze
- Licence
- Funders
- National Science Foundation (PHY-1125565)
- Gordon and Betty Moore Foundation (GBMF-12500028)
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Universal transversal gates with color codes: A simplified approach. https://app.cochat.ai/papers/10.1103/physreva.91.032330
- The paper
- Kubica, A., & Beverland, M. E. (2015). Universal transversal gates with color codes: A simplified approach. Physical Review A. https://doi.org/10.1103/physreva.91.032330
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.