Reducing the quantum-computing overhead with complex gate distillation
Open accessThe DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
Abstract
In leading fault-tolerant quantum computing schemes, accurate transformation are obtained by a two-stage process. In a first stage, a discrete, universal set of fault-tolerant operations is obtained by error-correcting noisy transformations and distilling resource states. In a second stage, arbitrary transformations are synthesized to desired accuracy by combining elements of this set into a circuit. Here, we present a scheme which merges these two stages into a single one, directly distilling complex transformations. We find that our scheme can reduce the total overhead to realize certain gates by up to a few orders of magnitude. In contrast to other schemes, this efficient gate synthesis does not require computationally intensive compilation algorithms, and a straightforward generalization of our scheme circumvents compilation and synthesis altogether.
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
Lloyd, S. (1996) · Science · doi:10.1126/science.273.5278.1073 · Cited by 3,088 · cited 2×
“[16] S.”
MethodGottesman, D., & Chuang, I. L. (1999) · Nature · doi:10.1038/46503 · Cited by 1,860 · cited 1×
“This distillation protocol lends itself to a recursive procedure [9] where previously distilled states |Yj〉 for j < k are used to distill states |Yk〉.”
MethodUniversal 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 2×
“[4] S.”
MethodQuantum computations: algorithms and error correction
Kitaev, A. Y. (1997) · Russian Mathematical Surveys · doi:10.1070/rm1997v052n06abeh002155 · Cited by 1,424 · cited 3×
“The cost of synthesizing increases ‘only’ polynomially with log(1/δ) [11, 26], but again for realistic applications, this cost is excessively large.”
BackgroundMethodQuantum computing with realistically noisy devices
Knill, E. (2005) · Nature · doi:10.1038/nature03350 · Cited by 1,184 · cited 2×
“[13] E.”
MethodPreskill, 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 · cited 2×
“[21] J.”
MethodFault-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
Fault-tolerant quantum computation with constant error
Aharonov, D., & Ben-Or, M. (1997) · Proceedings of the twenty-ninth annual ACM symposium on Theory of computing - STOC '97 · doi:10.1145/258533.258579 · Cited by 631
Resilient quantum computation: error models and thresholds
Knill, E., Laflamme, R., & Zurek, W. H. (1998) · Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.1998.0166 · Cited by 346 · cited 1×
“The accuracy threshold theorem [1, 11, 14, 21, 25] states that if a physical device can realize one- and twoqubit operations to an accuracy of approximately 1% [13, 22], then fault-tolerant techniques can be used to reliably quantum-compute with this device for arbitrary long times.”
MethodGate-count estimates for performing quantum chemistry on small quantum computers
Wecker, D., Bauer, B., Clark, B. K., Hastings, M. B., & Troyer, M. (2014) · Physical Review A · doi:10.1103/physreva.90.022305 · Cited by 296
Cited by
Majorana zero modes and topological quantum computation
Sarma, S. D., Freedman, M., & Nayak, C. (2015) · npj Quantum Information · doi:10.1038/npjqi.2015.1 · Cited by 1,180
Roads towards fault-tolerant universal quantum computation
Campbell, E. T., Terhal, B. M., & Vuillot, C. (2017) · Nature · doi:10.1038/nature23460 · Cited by 596
Toward the first quantum simulation with quantum speedup
Childs, A. M., Maslov, D., Nam, Y., Ross, N. J., & Su, Y. (2018) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1801723115 · Cited by 551
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
Random Compiler for Fast Hamiltonian Simulation
Campbell, E. (2019) · Physical Review Letters · doi:10.1103/physrevlett.123.070503 · Cited by 355
Magic 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.”
BackgroundQuantum 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
Beverland, M. E., Kubica, A., & Svore, K. M. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.020341 · Cited by 82
Codes 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
Error 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
T-Count Optimization and Reed–Muller Codes
Amy, M., & Mosca, M. (2019) · IEEE Transactions on Information Theory · doi:10.1109/tit.2019.2906374 · Cited by 49
“Moreover, researchers have recently developed state distillation techniques for these gates, allowing them to be performed fault tolerantly without approximating them over another gate set [23], [31].”
BackgroundDemonstration of logical qubits and repeated error correction with better-than-physical error rates
Paetznick, A., da Silva, M. P., Ryan-Anderson, C., Bello-Rivas, J. M., Campora, J. P., Chernoguzov, A., Dreiling, J. M., Foltz, C., Frachon, F., Gaebler, J. P., et al. (2024) · arXiv · doi:10.48550/arxiv.2404.02280 · Cited by 42
Metadata
- Authors
- Duclos-Cianci, G., & Poulin, D.
- Venue
- Physical Review A
- Publisher
- American Physical Society (APS)
- Published
- 2015-04-13
- Volume
- 91
- Issue
- 4
- ISSN
- 0556-2791 (ISSN-L)
- 1050-2947
- 1094-1622
- OpenAlex
- W1984203445
- Cited by
- 44
- References
- 16
- FWCI
- 6.57
- 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.