Codes and Protocols for Distilling T , controlled- S , and Toffoli Gates
Open accessThe DOI matches its Crossref record; 36 of the 37 references it cites were found in a registry or an index.
Abstract
We present several different codes and protocols to distill T , controlled- S , and Toffoli (or C C Z ) gates. One construction is based on codes that generalize the triorthogonal codes, allowing any of these gates to be induced at the logical level by transversal T . We present a randomized construction of generalized triorthogonal codes obtaining an asymptotic distillation efficiency γ → 1 . We also present a Reed-Muller based construction of these codes which obtains a worse γ but performs well at small sizes. Additionally, we present protocols based on checking the stabilizers of C C Z magic states at the logical level by transversal gates applied to codes; these protocols generalize the protocols of. Several examples, including a Reed-Muller code for T -to-Toffoli distillation, punctured Reed-Muller codes for T -gate distillation, and some of the check based protocols, require a lower ratio of input gates to output gates than other known protocols at the given order of error correction for the given code size. In particular, we find a 512 T-gate to 10 Toffoli gate code with distance 8 as well as triorthogonal codes with parameters [ [ 887 , 137 , 5 ] ] , [ [ 912 , 112 , 6 ] ] , [ [ 937 , 87 , 7 ] ] with very low prefactors in front of the leading order error terms in those codes.
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
Arikan, E. (2009) · IEEE Transactions on Information Theory · doi:10.1109/tit.2009.2021379 · Cited by 4,476 · cited 1×
“This circuit is the same as the encoding circuit used for polar codes, up to different choices of the input state [24, 25].”
MethodSpencer, J. (1991) · Medical Entomology and Zoology · Cited by 4,310
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 · cited 1×
“This idea of padding is related to the following protocol for distillation [18].”
BackgroundGood quantum error-correcting codes exist
Calderbank, A. R., & Shor, P. W. (1996) · Physical Review A · doi:10.1103/physreva.54.1098 · Cited by 2,516 · cited 1×
“Random constructions [2, 31] guarantee such codes of encoding rate near one in the limit of large code length.”
BackgroundUniversal 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 · cited 5×
“We found that there is a unique d = 5 code that can be obtained by puncturing RM(2, 7); it is [[125, 3, 5]].”
BackgroundMethodInfluentialClass 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 · cited 6×
“To give some numbers when these codes are used in a distillation protocol, consider a in = 10−3 input error rate using the [[912, 112, 6]] code.”
MethodInfluentialQuantum 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 · cited 7×
“The bound was possible since we computed, by brute force, the X-stabilizer’s weight enumerator of [[887, 137, 5]], unpuncturing which yielded [[937, 87, 7]]; while in general this X-stabilizer weight enumerator is very costly to compute as we explained above, it was possible to compute it for a single code example (it…”
BackgroundMethodInfluentialKarzig, T., Knapp, C., Lutchyn, R. M., Bonderson, P., Hastings, M. B., Nayak, C., Alicea, J., Flensberg, K., Plugge, S., Oreg, Y., et al. (2017) · Physical Review B · doi:10.1103/physrevb.95.235305 · Cited by 628 · cited 3×
“This approach begins by implementing the Clifford group to high accuracy using either stabilizer codes [6, 7] or using Majorana fermions [8].”
MethodSelf-citationA constructive proof of the general lovász local lemma
Moser, R. A., & Tardos, G. (2010) · Journal of the ACM · doi:10.1145/1667053.1667060 · Cited by 451 · cited 1×
“14 3, 10, 19, 20, 64, 66, 72, 96, 99, 104, 110, 114, 115, 124 [[112, 16, 3]], A3 = 96, n/k = 7 6, 8, 13, 14, 17, 28, 29, 33, 44, 57, 65, 75, 79, 82, 106, 116 [[109, 19, 3]], A3 = 324, n/k = 5.”
Magic-state distillation with low overhead
Bravyi, S., & Haah, J. (2012) · Physical Review A · doi:10.1103/physreva.86.052329 · Cited by 341 · cited 11×
“We use a generalization of triorthogonal codes [1] to allow this distillation.”
BackgroundMethodInfluentialSelf-citation
Cited by
How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits
Gidney, C., & Ekerå, M. (2021) · Quantum · doi:10.22331/q-2021-04-15-433 · Cited by 830
A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery
Litinski, D. (2019) · Quantum · doi:10.22331/q-2019-03-05-128 · Cited by 408
“Here, we discuss a general procedure that can be applied to any distillation protocol based on an errorcorrecting code with transversal T gates, such as punctured Reed-Muller codes [16, 17] or block codes [18–20].”
BackgroundMethodInfluentialBlueprint for a Scalable Photonic Fault-Tolerant Quantum Computer
Bourassa, J. E., Alexander, R. N., Vasmer, M., Patil, A., Tzitrin, I., Matsuura, T., Su, D., Baragiola, B. Q., Guha, S., Dauphinais, G., et al. (2021) · Quantum · doi:10.22331/q-2021-02-04-392 · Cited by 302
Building a Fault-Tolerant Quantum Computer Using Concatenated Cat Codes
Chamberland, C., Noh, K., Arrangoiz-Arriola, P., Campbell, E. T., Hann, C. T., Iverson, J., Putterman, H., Bohdanowicz, T. C., Flammia, S. T., Keller, A., et al. (2022) · PRX Quantum · doi:10.1103/prxquantum.3.010329 · Cited by 281
A game of surface codes: Large-scale quantum computing with lattice surgery
Litinski, D. (2019) · Refubium (Universitätsbibliothek der Freien Universität Berlin) · doi:10.17169/refubium-4067 · Cited by 252
Metadata
- Authors
- Haah, J., & Hastings, M. B.
- Affiliations
- Microsoft (United States) (US)
- ORCID
- Haah, Jeongwan
- Venue
- Quantum
- Published
- 2018-06-07
- Volume
- 2
- Pages
- 71
- ISSN
- 2521-327X (ISSN-L)
- OpenAlex
- W2755575243
- Cited by
- 79
- References
- 37
- Citations by year
- 2026: 10 · 2025: 16 · 2024: 9 · 2023: 4 · 2022: 11 · 2021: 10 · 2020: 8 · 2019: 7 · 2018: 3
- FWCI
- 3.89
- Type
- journal article
- Language
- en
- Open access
- gold
- doi.org
- Locations
- Quantum (publishedVersion, cc-by)
- arXiv (Cornell University) (submittedVersion)
- DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion)
- arXiv (Cornell University) (cc-by)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
- Physical Sciences › Mathematics › Discrete Mathematics and Combinatorics › Coding theory and cryptography
- Keywords
- magic state distillation, T-gate, Toffoli gate, CCZ gate, Reed-Muller codes, transversal gates, quantum error correction, distillation efficiency
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: Codes and Protocols for Distilling T , controlled- S , and Toffoli Gates. https://app.cochat.ai/papers/10.22331/q-2018-06-07-71
- The paper
- Haah, J., & Hastings, M. B. (2018). Codes and Protocols for Distilling T , controlled- S , and Toffoli Gates. Quantum. https://doi.org/10.22331/q-2018-06-07-71
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.