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-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
Blueprint for a scalable photonic fault-tolerant quantum computer
Bourassa, J. E., Alexander, R. N., Baragiola, B. Q., & Menicucci, N. C. (2024) · Figshare · Cited by 222
Magic State Distillation: Not as Costly as You Think
Litinski, D. (2019) · Quantum · doi:10.22331/q-2019-12-02-205 · Cited by 220
“Still, since it is possible to generate arbitrarily many such protocols based on triorthogonal codes [11, 19],”
BackgroundVirtual Distillation for Quantum Error Mitigation
Huggins, W. J., McArdle, S., O’Brien, T. E., Lee, J., Rubin, N. C., Boixo, S., Whaley, K. B., Babbush, R., & McClean, J. R. (2021) · Physical Review X · doi:10.1103/physrevx.11.041036 · Cited by 205
“[36] Jeongwan Haah and Matthew B Hastings, “Codes and protocols for distilling T , controlled- S , and toffoli gates,” Quantum 2, 71 (2018).”
BackgroundPerspective on the Current State-of-the-Art of Quantum Computing for Drug Discovery Applications
Blunt, N. S., Camps, J., Crawford, O., Izsák, R., Leontica, S., Mirani, A., Moylett, A. E., Scivier, S. A., Sünderhauf, C., Schopf, P., et al. (2022) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.2c00574 · Cited by 192
Kim, I. H., Liu, Y.-H., Pallister, S., Pol, W., Roberts, S., & Lee, E. (2022) · Physical Review Research · doi:10.1103/physrevresearch.4.023019 · Cited by 96
Fault-tolerant magic state preparation with flag qubits
Chamberland, C., & Cross, A. W. (2019) · Quantum · doi:10.22331/q-2019-05-20-143 · Cited by 83
No-Go Theorems for Quantum Resource Purification
Fang, K., & Liu, Z.-W. (2020) · Physical Review Letters · doi:10.1103/physrevlett.125.060405 · Cited by 129
Beverland, M. E., Kubica, A., & Svore, K. M. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.020341 · Cited by 82
Universal Quantum Computing with Twist-Free and Temporally Encoded Lattice Surgery
Chamberland, C., & Campbell, E. T. (2022) · PRX Quantum · doi:10.1103/prxquantum.3.010331 · Cited by 80
Chamberland, C., & Noh, K. (2020) · npj Quantum Information · doi:10.1038/s41534-020-00319-5 · Cited by 71
Towards Low Overhead Magic State Distillation
Krishna, A., & Tillich, J. (2019) · Physical Review Letters · doi:10.1103/physrevlett.123.070507 · Cited by 109
On Optimality of CSS Codes for Transversal T
Rengaswamy, N., Calderbank, R., Newman, M., & Pfister, H. D. (2020) · IEEE Journal on Selected Areas in Information Theory · doi:10.1109/jsait.2020.3012914 · Cited by 91
“This is precisely one of the requirements in the generalized triorthogonality conditions established by Haah and Hastings [13], which is a special case of quasitransversality established earlier by Campbell and Howard [14], in order to ensure that transversal T performs a logical CCZ on a CSS code.”
BackgroundMethodInfluentialError 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
Vasmer, M., & Kubica, A. (2022) · PRX Quantum · doi:10.1103/prxquantum.3.030319 · Cited by 39
Optimized SWAP networks with equivalent circuit averaging for QAOA
Hashim, A., Rines, R., Omole, V., Naik, R., Kreikebaum, J. M., Santiago, D., Chong, F. T., Siddiqi, I. A., & Gokhale, P. (2022) · Physical Review Research · doi:10.1103/physrevresearch.4.033028 · Cited by 54
Real-time processing of stabilizer measurements in a bit-flip code
Ristè, D., Govia, L. C. G., Donovan, B., Fallek, S. D., Kalfus, W. D., Brink, M., Bronn, N. T., & Ohki, T. (2020) · npj Quantum Information · doi:10.1038/s41534-020-00304-y · Cited by 47
Logical Clifford Synthesis for Stabilizer Codes
Rengaswamy, N., Calderbank, R., Kadhe, S., & Pfister, H. D. (2020) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2020.3023419 · Cited by 45
Looped Pipelines Enabling Effective 3D Qubit Lattices in a Strictly 2D Device
Cai, Z., Siegel, A. C., & Benjamin, S. C. (2023) · PRX Quantum · doi:10.1103/prxquantum.4.020345 · Cited by 41
Magic state parity-checker with pre-distilled components
Campbell, E. T., & Howard, M. (2018) · Quantum · doi:10.22331/q-2018-03-14-56 · Cited by 24
Universal limitations on implementing resourceful unitary evolutions
Takagi, R., & Tajima, H. (2020) · Physical Review A · doi:10.1103/physreva.101.022315 · Cited by 22
Optimal two-qubit circuits for universal fault-tolerant quantum computation
Glaudell, A. N., Ross, N. J., & Taylor, J. M. (2021) · npj Quantum Information · doi:10.1038/s41534-021-00424-z · Cited by 32
High-fidelity magic-state preparation with a biased-noise architecture
Singh, S., Darmawan, A. S., Brown, B. J., & Puri, S. (2022) · Physical Review A · doi:10.1103/physreva.105.052410 · Cited by 34
Fault-Tolerant Postselection for Low-Overhead Magic State Preparation
Bombín, H., Pant, M., Roberts, S., & Seetharam, K. (2024) · PRX Quantum · doi:10.1103/prxquantum.5.010302 · Cited by 69
Classical Coding Problem from Transversal T Gates
Rengaswamy, N., Calderbank, R., Newman, M., & Pfister, H. D. (2020) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit44484.2020.9174408 · Cited by 28
“This has close connections to [17].”
BackgroundMitigating Coherent Noise by Balancing Weight-2 Z-Stabilizers
Hu, J., Liang, Q., Rengaswamy, N., & Calderbank, R. (2021) · IEEE Transactions on Information Theory · doi:10.1109/tit.2021.3130155 · Cited by 20
Classification of small triorthogonal codes
Nezami, S., & Haah, J. (2022) · Physical Review A · doi:10.1103/physreva.106.012437 · Cited by 36
Self-citationVuillot, C., & Breuckmann, N. P. (2022) · IEEE Transactions on Information Theory · doi:10.1109/tit.2022.3170846 · Cited by 38
Towers of generalized divisible quantum codes
Haah, J. (2018) · Physical Review A · doi:10.1103/physreva.97.042327 · Cited by 27
“For example, one can consider a classical triply even code, and puncture it so that X-stabilizers have weight a multiple of 8 and X-logical operators have odd weight, to obtain a triorthogonal codes [3, 24].”
Self-citationImplementing fault-tolerant non-Clifford gates using the [[8,3,2]] color code
Menendez, D. H., Ray, A., & Vasmer, M. (2024) · Physical Review A · doi:10.1103/physreva.109.062438 · Cited by 28
Implementing fault-tolerant non-Clifford gates using the [[8,3,2]] color code
Menendez, D. H., Ray, A., & Vasmer, M. (2023) · arXiv · doi:10.48550/arxiv.2309.08663 · Cited by 12
Compilation of a simple chemistry application to quantum error correction primitives
Blunt, N. S., Gehér, G. P., & Moylett, A. E. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.013325 · Cited by 20
“This target failure probability is split evenly, so the probability of errors occurring from faulty | T ⟩ state preparation is at most 0 .”
BackgroundDesigning the Quantum Channels Induced by Diagonal Gates
Hu, J., Liang, Q., & Calderbank, R. (2022) · Quantum · doi:10.22331/q-2022-09-08-802 · Cited by 25
Constant-overhead magic state distillation
Wills, A., Hsieh, M.-H., & Yamasaki, H. (2025) · Nature Physics · doi:10.1038/s41567-025-03026-0 · Cited by 119
“Surface codes, on the other hand, may not directly allow transversal Clifford gates but enable fault-tolerant Clifford gates with the generalized triorthogonality framework of Haah and Hast-ings 25 .”
Magic state distillation and cost analysis in fault-tolerant universal quantum computation
Liu, Y., Ma, Z., Luo, L., Du, C., Fei, Y., Wang, H., Duan, Q., & Yang, J. (2023) · Quantum Science and Technology · doi:10.1088/2058-9565/ace6ca · Cited by 11
Permutation-Invariant Quantum Codes With Transversal Generalized Phase Gates
Kubischta, E., & Teixeira, I. (2024) · IEEE Transactions on Information Theory · doi:10.1109/tit.2024.3487964 · Cited by 26
Code switching revisited: Low-overhead magic state preparation using color codes
Daguerre, L., & Kim, I. H. (2025) · Physical Review Research · doi:10.1103/physrevresearch.7.023080 · Cited by 40
Fault-tolerant quantum speedup from constant depth quantum circuits
Mezher, R., Ghalbouni, J., Dgheim, J., & Markham, D. (2020) · Physical Review Research · doi:10.1103/physrevresearch.2.033444 · Cited by 8
Good Binary Quantum Codes with Transversal CCZ Gate
Nguyen, Q. T. (2025) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/3717823.3718186 · Cited by 43
Climbing the diagonal Clifford hierarchy
Hu, J., Liang, Q., & Calderbank, R. (2025) · Academia quantum. · doi:10.20935/acadquant7957 · Cited by 23
Transversal Clifford and T -Gate Codes of Short Length and High Distance
Jain, S. P., & Albert, V. V. (2025) · IEEE Journal on Selected Areas in Information Theory · doi:10.1109/jsait.2025.3570832 · Cited by 8
“Divisibility of CSS codes is closely related to the logical action induced by transversal phase gates [53, 56–58].”
Geometric Structure and Transversal Logic of Quantum Reed–Muller Codes
Barg, A., Coble, N. J., Hangleiter, D., & Kang, C. (2025) · IEEE Transactions on Information Theory · doi:10.1109/tit.2025.3592631 · Cited by 20
“Much attention has been devoted to meticulously puncturing codes to achieve specific logical operators, for instance, for T state distillation [12], [16], [17], [18], [22].”
Magic state distillation with punctured polar codesPreprint
Krishna, A., & Tillich, J. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1811.03112 · Cited by 15
“Related work: In relation to previous work on magic state distillation, there have been earlier proposals such as [7, 9, 15, 12, 21, 13, 14, 20] that exploit the structure of classical codes to devise magic state distillation protocols.”
MethodA universal circuit set using the S3 quantum double
Chen, L., Ren, Y., Fan, R., & Jaffe, A. M. (2025) · npj Quantum Information · doi:10.1038/s41534-025-01063-4 · Cited by 21
LSQCA: Resource-Efficient Load/Store Architecture for Limited-Scale Fault-Tolerant Quantum Computing
Kobori, T., Suzuki, Y., Ueno, Y., Tanimoto, T., Todo, S., & Tokunaga, Y. (2025) · IEEE International Symposium on High-Performance Computer Architecture (HPCA) · doi:10.1109/hpca61900.2025.00033 · Cited by 26
“Logical H and S operations can also be realized similarly by switching syndrome measurement patterns several times [8], [18], [28], [47].”
Measurement sequences for magic state distillation
Haah, J., & Hastings, M. B. (2021) · Quantum · doi:10.22331/q-2021-01-20-383 · Cited by 5
“A final possibility is “partial error correction”; for example, in [20] it was suggested that for certain large outer codes one might correct if a small number of errors would give the observed syndrome, and discard otherwise (more generally, one may choose some set of observed syndromes to correct and discard on othe…”
BackgroundMethodSelf-citationQuantum Pin CodesPreprint
Vuillot, C., & Breuckmann, N. P. (2019) · arXiv (Cornell University) · Cited by 4
Quantum error correction meets continuous symmetries: fundamental trade-offs and case studiesPreprint
Liu, Z.-W., & Zhou, S. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2111.06360 · Cited by 25
“[42] Jeongwan Haah and Matthew B Hastings, “Codes and protocols for distilling t, controlled-s, and toffoli gates,” Quantum 2, 71 (2018).”
BackgroundQuantum Lego and XP Stabilizer Codes
Shen, R., Wang, Y., & Cao, C. (2025) · Quantum · doi:10.22331/q-2025-10-06-1876 · Cited by 13
Low Overhead Qutrit Magic State Distillation
Prakash, S., & Saha, T. (2025) · Quantum · doi:10.22331/q-2025-06-12-1768 · Cited by 16
“Of these, the lowest known overheads arise from punctured quantum Reed-Solomon codes, which achieve a yield parameter γ = log ⌊ ( p +1) / 3 ⌋ ( p − 1) with a single puncture [13], and sublogarithmic yields with multiple punctures [17] for sufficiently large p .”
InfluentialFault-tolerant quantum computation using low-cost joint measurements
Kang, Y., Lee, J., Ha, J., & Heo, J. (2024) · Quantum Information Processing · doi:10.1007/s11128-024-04389-8 · Cited by 4
Triorthogonal codes and self-dual codes
Shi, M., Lu, H., Kim, J.-L., & Solé, P. (2024) · Quantum Information Processing · doi:10.1007/s11128-024-04485-9 · Cited by 3
“We call such a number the distance of the matrix G , i.e., In the rest of this paper, a triorthogonal code has parameters [[ n , k , d Z ]] if this code encodes k logical qubits into n qubits, and the distance of the corresponding triorthogo-nal matrix is d Z .”
Benchmarking the Ability of a Controller to Execute Quantum Error Corrected Non-Clifford Circuits
Kurman, Y., Ella, L., Szmuk, R., Wertheim, O., Dorschner, B., Stanwyck, S., & Cohen, Y. (2025) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2025.3608053 · Cited by 11
“…including fault-tolerant computation techniques [30], [31], [32], [33], high-fidelity magic state preparation techniques [34], [35], decoding algorithms [25], [26], [36], [37], [38], [39], [40], [41], simulation tools [42], distillation schemes [32], [43], [44], and scaling proposals [31], [32].”
Dynamic Concatenation of Quantum Error Correction in Integrated Quantum Computing Architecture
Sohn, I., Bang, J., & Heo, J. (2019) · Scientific Reports · doi:10.1038/s41598-019-39439-0 · Cited by 5
Unfolded distillation: very low-cost magic state preparation for biased-noise qubits
Ruiz, D., Guillaud, J., Vuillot, C., & Mirrahimi, M. (2026) · npj Quantum Information · doi:10.1038/s41534-026-01197-z · Cited by 20
Triangle Criterion: A Mixed-State Magic Criterion with Applications in Distillation and Detection
Liu, Z., Haug, T., Ye, Q., Liu, Z.-W., & Roth, I. (2026) · PRX Quantum · doi:10.1103/rcpf-8nh9 · Cited by 12
“Such extensions can improve the detection power of the original Triangle Criterion and, at the same time, have a natural operational connection to magic distillation tasks targeting multi-qubit resource states, such as the CCZ state [52, 53].”
Generators and Relations for 3-Qubit Clifford+CS Operators
Bian, X., & Selinger, P. (2023) · Electronic Proceedings in Theoretical Computer Science · doi:10.4204/eptcs.384.7 · Cited by 2
“In [9], Haah and Hastings showed how to construct a faulttolerant CS-gate via magic state distillation.”
BackgroundNon-stabilizerness and entanglement from cat-state injection
Peres, F. C. R., Wagner, R., & Galvão, E. F. (2024) · New Journal of Physics · doi:10.1088/1367-2630/ad1b80 · Cited by 4
“For distillation schemes devoted to the simplest cat state we have considered ( | cat ∗ 2 ⟩ = | CS ⟩ ), we refer the reader to references [78–80].”
BackgroundFast generation of quantum logic gate with Rydberg superatoms
Wang, J., Wang, J., Dong, L., Xiu, X., & Ji, Y. (2025) · Optics & Laser Technology · doi:10.1016/j.optlastec.2025.112812 · Cited by 3
Low-overhead code concatenation approaches for universal quantum computation
Nikahd, E., Zamani, M. S., & Sedighi, M. (2023) · Quantum Information Processing · doi:10.1007/s11128-023-03829-1 · Cited by 4
CS-count-optimal quantum circuits for arbitrary multi-qubit unitaries
Mukhopadhyay, P. (2024) · Scientific Reports · doi:10.1038/s41598-024-64558-8 · Cited by 5
Efficient Simulation of Logical Magic State Preparation Protocols
Surti, S., Daguerre, L., & Kim, I. H. (2026) · PRX Quantum · doi:10.1103/fby6-xjbm · Cited by 26
“Magic state distillation (MSD) protocols [8–18] based on stabilizer codes also propagate circuit-level Pauli errors to an end-of-circuit Clifford error.”
Co-design of CSS Codes and Diagonal Gates
Hu, J., Liang, Q., & Calderbank, R. (2022) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit50566.2022.9834511 · Cited by 1
Logical Noise Bias in Magic State Injection
Fazio, N., Harper, R., & Bartlett, S. D. (2025) · Quantum · doi:10.22331/q-2025-06-24-1779 · Cited by 8
“Finally, in section II C we review the schemes that we use to perform logical tomography of encoded magic state injection.”
Hypergraph States in SU(N)1, N odd prime, Chern-Simons TheoryPreprint
Schnitzer, H. J. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2102.02281
Flexible fault-tolerant gate gadgets
Kubischta, E., & Teixeira, I. (2026) · Physical Review A · doi:10.1103/v37p-4yth
RSA Quantum Cryptanalysis: A Thorough Exploration of n–Bit Attacks and Emerging Factoring Techniques
Wardhani, R. W., Putranto, D. S. C., & Kim, H. (2025) · Lecture notes in computer science · doi:10.1007/978-981-96-5566-3_11
Color Code with a Logical Control- S Gate Using Transversal T Rotations
Brown, B. J. (2025) · Physical Review Letters · doi:10.1103/lwxd-fdlb · Cited by 6
iSwitch: QEC on Demand via In-Situ Encoding of Bare Qubits for Ion Trap Architectures
Yin, K., Fang, X., Chen, Z., Hayes, D., Kaur, E., Nejabati, R., Häffner, H., Campbell, W. C., Hudson, E. R., Palsberg, J., et al. (2026) · International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS) · doi:10.1145/3779212.3790177 · Cited by 14
“The standard approach for realizing these non-Clifford operations, magic state distillation (MSD) [28], [29], [30], consumes a large number of ancilla qubits and significant runtime [31].”
Magic state distillation without measurements and post-selection
Heußen, S. (2025) · APL Quantum · doi:10.1063/5.0280551 · Cited by 5
Quantum phase estimation with optimal confidence interval using three control qubits
Kristjuhan, K., & Berry, D. W. (2026) · Quantum · doi:10.22331/q-2026-08-19-2193 · Cited by 2
“This procedure can be used for preparing the MPS approximation of any state with real-valued amplitudes, making it also applicable to state preparation problems that are not necessarily connected to QPE or DPSS states.”
Sublogarithmic distillation in all prime dimensions using punctured Reed-Muller codes
Saha, T., & Prakash, S. (2026) · Physical Review A · doi:10.1103/tzkz-9p2f · Cited by 6
Survival of the Optimized: An Evolutionary Approach to T-depth Reduction
Ghosh, A., Chatterjee, A., & Ghosh, S. (2026) · Asia and South Pacific Design Automation Conference (ASP-DAC) · doi:10.1109/asp-dac66049.2026.11420525 · Cited by 2
“We evaluate the idea in Section V and conclude the paper in Section VI.”
Non-Clifford quantum gate teleportation with generalized lattice surgery
Wang, Y., & Gu, Y. (2026) · Physical Review A · doi:10.1103/1xq4-856m · Cited by 5
Asymptotically good CSS codes that realize the logical transversal Clifford group fault-tolerantly
Kallupalli, S. M. R., & Kashyap, N. (2026) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit62367.2026.11653742 · Cited by 5
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.