Codes and Protocols for Distilling T , controlled- S , and Toffoli Gates
Open accessThe DOI matches its Crossref record; 37 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-citationUniversal Fault-Tolerant Quantum Computation with Only Transversal Gates and Error Correction
Paetznick, A., & Reichardt, B. W. (2013) · Physical Review Letters · doi:10.1103/physrevlett.111.090505 · Cited by 242 · cited 1×
“There are many proposed protocols to distill magic states: for T gates from T gates [1–3, 5, 9, 10], for Toffoli gates from T -gates [2, 11–15], for Fourier states from Toffoli gates [16], CCZ(Toffoli) states from CCZ gates [17].”
BackgroundLow-overhead constructions for the fault-tolerant Toffoli gate
Jones, C. (2013) · Physical Review A · doi:10.1103/physreva.87.022328 · Cited by 204 · cited 5×
“It requires[12, 23] 4 high-quality T -gates to produce a single high-quality CCZ state, so this protocol’s efficiency is comparable, if the goal is to produce CCZ states, to a protocol that uses only 85.”
MethodInfluentialMultilevel distillation of magic states for quantum computing
Jones, C. (2013) · Physical Review A · doi:10.1103/physreva.87.042305 · Cited by 126 · cited 2×
“There are normal codes of encoding rate greater than 2/3 and code distance 4 or higher on tens of qubits, including quantum BCH codes [[63, 45, 4]] [30] and “H-codes” of parameters [[k2 + 4k + 4, k2, 4]] where k is even [10].”
BackgroundBravyi, S. B., Terhal, B. M., & Leemhuis, B. (2010) · New Journal of Physics · doi:10.1088/1367-2630/12/8/083039 · Cited by 109
Efficient Polar Coding of Quantum Information
Renes, J. M., Dupuis, F., & Renner, R. (2012) · Physical Review Letters · doi:10.1103/physrevlett.109.050504 · Cited by 92 · 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].”
MethodCampbell, E. T., & Howard, M. (2017) · Physical Review A · doi:10.1103/physreva.95.022316 · Cited by 91 · cited 9×
“A protocol of similar performance based on a generalized triorthogonal matrix was presented in [15].”
BackgroundMethodInfluentialFault-Tolerant Postselected Quantum Computation: Schemes
Knill, E. H. (2004) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0402171 · Cited by 72 · cited 2×
“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.”
BackgroundQuantum BCH CodesPreprint
Grassl, M., & Beth, T. (1999) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/9910060 · Cited by 72 · cited 3×
“The resulting [[512, 30, 8]] code is the following.”
BackgroundMethodWeight enumerator for second-order Reed-Muller codes
Sloane, N. J. A., & Berlekamp, E. R. (1970) · IEEE Transactions on Information Theory · doi:10.1109/tit.1970.1054553 · Cited by 66
Magic state distillation with low space overhead and optimal asymptotic input count
Haah, J., Hastings, M. B., Poulin, D., & Wecker, D. (2017) · Quantum · doi:10.22331/q-2017-10-03-31 · Cited by 62 · cited 6×
“[2] we use inner codes to measure various stabilizers of the magic state.”
BackgroundMethodInfluentialSelf-citationUnifying Gate Synthesis and Magic State Distillation
Campbell, E. T., & Howard, M. (2017) · Physical Review Letters · doi:10.1103/physrevlett.118.060501 · Cited by 53
Distilling one-qubit magic states into Toffoli states
Eastin, B. (2013) · Physical Review A · doi:10.1103/physreva.87.032321 · Cited by 50 · cited 2×
“This protocol was given in [15], and is similar to those of [11, 12]”
MethodMagic-state distillation with the four-qubit code
Meier, A. M., Eastin, B., & Knill, E. (2013) · Quantum Information and Computation · doi:10.26421/qic13.3-4-2 · Cited by 46
Reducing the quantum-computing overhead with complex gate distillation
Duclos-Cianci, G., & Poulin, D. (2015) · Physical Review A · doi:10.1103/physreva.91.042315 · Cited by 44
Fault-Tolerant Postselected Quantum Computation: Threshold Analysis
Knill, E. H. (2004) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0404104 · Cited by 43 · cited 7×
“73 10, 15, 16, 17, 32, 39, 40, 41, 48, 59, 66, 69, 72, 81, 100, 102, 108, 120, 126 [[118, 10, 4]], A4 = 210, n/k = 11.”
BackgroundMethodInfluentialEfficient rate-adaptive reconciliation for continuous-variable quantum key distribution
Wang, X., Zhang, Y.-C., Li, Z., Xu, B., Yu, S., & Guo, H. (2017) · Quantum Information and Computation · doi:10.26421/qic17.13-14 · Cited by 38
Quantum Error Correction for Complex and Majorana Fermion QubitsPreprint
Vijay, S., & Fu, L. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1703.00459 · Cited by 34 · cited 1×
“In this table, the base code prior to puncturing is RM(2, 7) = [128, 29, 32].”
Composite Toffoli gate with two-round error detection
Jones, C. (2013) · Physical Review A · doi:10.1103/physreva.87.052334 · Cited by 32 · cited 3×
“The overall circuit is very similar to quadratic protocol in Jones [13] in which the same choice of logical operators are used, but control-(TXT †)⊗4 is applied on the code, followed by syndrome measurement and then π/2 rotation along x-axis on the Bloch sphere.”
MethodResultWeight polarization and divisibility
Ward, H. N. (1990) · Discrete Mathematics · doi:10.1016/0012-365x(90)90015-a · Cited by 26
Distillation protocols for Fourier states in quantum computing
Jones, C. (2014) · Quantum Information and Computation · doi:10.26421/qic14.7-8-2 · Cited by 25 · cited 4×
“In case of the Reed-Muller codes, we see A4([[16, 6, 4]]) = 140, A4([[32, 20, 4]]) = 620, and A4([[64, 50, 4]]) = 2604.”
BackgroundMethodInfluentialRestrictions on weight distribution of Reed-Muller codes
Berlekamp, E. R., & Sloane, N. J. A. (1969) · Information and Control · doi:10.1016/s0019-9958(69)90150-8 · Cited by 17 · cited 1×
“It is also known[22] that all weights of RM(2m/3,m) between d and 2d are of the form 2d− 2i for some i, so that the next weight after d is equal to 3d/2.”
BackgroundOptimal realizations of simplified Toffoli gates
Song, G., & Klappenecker, A. (2004) · Quantum Information and Computation · doi:10.26421/qic4.5-2 · Cited by 11
Magic-state distillation with the four-qubit code
Meier, A. M., Eastin, B., & Knill, E. (2012) · arXiv · doi:10.48550/arxiv.1204.4221 · Cited by 2
A Class of Quantum Error-Correcting Codes Saturating the Quantum Hamming BoundPreprint
Gottesman, D. (1996) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/9604038 · 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.”
MethodInfluentialUniversal Quantum Computation with ideal Clifford gates and noisy ancillas
Bravyi, S., & Kitaev, A. (2004) · arXiv · doi:10.48550/arxiv.quant-ph/0403025 · 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]].”
BackgroundMethodInfluentialQuantum Error Correction and Orthogonal Geometry
Calderbank, A. R., Rains, E. M., Shor, P. W., & Sloane, N. J. A. (1996) · arXiv · doi:10.48550/arxiv.quant-ph/9605005 · 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…”
BackgroundMethodInfluentialGood Quantum Error-Correcting Codes Exist
Calderbank, A. R., & Shor, P. W. (1995) · arXiv · doi:10.48550/arxiv.quant-ph/9512032 · cited 1×
“Random constructions [2, 31] guarantee such codes of encoding rate near one in the limit of large code length.”
Background
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
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.