Unified framework for magic state distillation and multiqubit gate synthesis with reduced resource cost
Open accessThe DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
Abstract
The standard approach to fault-tolerant quantum computation is to store information in a quantum error correction code, such as the surface code, and process information using a strategy that can be summarized as distill then synthesize. In the distill step, one performs several rounds of distillation to create high-fidelity logical qubits in a magic state. Each such magic state provides one good $T$ gate. In the synthesize step, one seeks the optimal decomposition of an algorithm into a sequence of many $T$ gates interleaved with Clifford gates. This gate-synthesis problem is well understood for multiqubit gates that do not use any Hadamards. We present an in-depth analysis of a unified framework that realizes one round of distillation and multiqubit gate synthesis in a single step. We call these synthillation protocols, and show they lead to a large reduction in resource overheads. This is because synthillation can implement a general class of circuits using the same number of $T$ states as gate synthesis, yet with the benefit of quadratic error suppression. This general class includes all circuits primarily dominated by control-control-$Z$ gates, such as adders and modular exponentiation routines used in Shor's algorithm. Therefore, synthillation removes the need for a costly round of magic state distillation. We also present several additional results on the multiqubit gate-synthesis problem. We provide an efficient algorithm for synthesizing unitaries with the same worst-case resource scaling as optimal solutions. For the special case of synthesizing controlled unitaries, our techniques are not just efficient but exactly optimal. We observe that the gate-synthesis cost, measured by $T$ count, is often strictly subadditive. Numerous explicit applications of our techniques are also presented.
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
Dennis, E., Kitaev, A., Landahl, A., & Preskill, J. (2002) · Journal of Mathematical Physics · doi:10.1063/1.1499754 · Cited by 1,768
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
Classical and Quantum Computation
Kitaev, A., Shen, A., & Vyalyi, M. (2002) · Graduate Studies in Mathematics · doi:10.1090/gsm/047 · Cited by 1,387
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
Topological Quantum Distillation
Bombin, H., & Martin-Delgado, M. A. (2006) · Physical Review Letters · doi:10.1103/physrevlett.97.180501 · Cited by 700
Restrictions on Transversal Encoded Quantum Gate Sets
Eastin, B., & Knill, E. (2009) · Physical Review Letters · doi:10.1103/physrevlett.102.110502 · Cited by 457
Methodology for quantum logic gate construction
Zhou, X., Leung, D. W., & Chuang, I. L. (2000) · Physical Review A · doi:10.1103/physreva.62.052316 · Cited by 355
Cited by
A quantum engineer's guide to superconducting qubits
Krantz, P., Kjaergaard, M., Yan, F., Orlando, T. P., Gustavsson, S., & Oliver, W. D. (2019) · Applied Physics Reviews · doi:10.1063/1.5089550 · Cited by 2,004
Karzig, 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
Roads towards fault-tolerant universal quantum computation
Campbell, E. T., Terhal, B. M., & Vuillot, C. (2017) · Nature · doi:10.1038/nature23460 · Cited by 596
Self-citationA 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
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
Self-citationMagic State Distillation: Not as Costly as You Think
Litinski, D. (2019) · Quantum · doi:10.22331/q-2019-12-02-205 · Cited by 220
“Many such protocols [8–19] have been developed since magic state distillation was first proposed [6], gradually decreasing the cost of distillation.”
BackgroundInfluentialQuantum 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-citationEfficient magic state factories with a catalyzed | C C Z ⟩ to 2 | T ⟩ transformation
Gidney, C., & Fowler, A. G. (2019) · Quantum · doi:10.22331/q-2019-04-30-135 · Cited by 152
“Over the past decade, thanks to techniques such as block codes [4, 16], bridge compression [14], and many others [19, 8, 9, 25], the cost of magic state distillation has steadily decreased.”
BackgroundCodes and Protocols for Distilling T , controlled- S , and Toffoli Gates
Haah, J., & Hastings, M. B. (2018) · Quantum · doi:10.22331/q-2018-06-07-71 · Cited by 79
“A protocol of similar performance based on a generalized triorthogonal matrix was presented in [15].”
BackgroundMethodInfluentialTowards quantum enhanced adversarial robustness in machine learning
West, M. T., Tsang, S.-L., Low, J. S., Hill, C. D., Leckie, C., Hollenberg, L. C. L., Erfani, S. M., & Usman, M. (2023) · Nature Machine Intelligence · doi:10.1038/s42256-023-00661-1 · Cited by 79
Vasmer, M., & Kubica, A. (2022) · PRX Quantum · doi:10.1103/prxquantum.3.030319 · Cited by 39
“, those based on triorthogonal codes [30, 34, 43].”
Bell Sampling from Quantum Circuits
Hangleiter, D., & Gullans, M. J. (2024) · Physical Review Letters · doi:10.1103/physrevlett.133.020601 · Cited by 28
“We then ask the question: What can we learn from the Bell samples about the circuit preparing the underlying quantum state?”
BackgroundFacilitating practical fault-tolerant quantum computing based on color codes
Zhang, J., Wu, Y.-C., & Guo, G.-P. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.033086 · Cited by 12
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
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].”
Metadata
- Authors
- Campbell, E. T., & Howard, M.
- Venue
- Physical Review A
- Publisher
- American Physical Society (APS)
- Published
- 2017-02-09
- Volume
- 95
- Issue
- 2
- ISSN
- 0556-2791 (ISSN-L)
- 2469-9926
- 2469-9934
- OpenAlex
- W2410653068
- Cited by
- 91
- References
- 21
- FWCI
- 5.25
- Type
- journal article
- Language
- en
- Open access
- green
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.