The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
Improved Classical Simulation of Quantum Circuits Dominated by Clifford Gates
Open accessAbstract
We present a new algorithm for classical simulation of quantum circuits over the Clifford+T gate set. The runtime of the algorithm is polynomial in the number of qubits and the number of Clifford gates in the circuit but exponential in the number of T gates. The exponential scaling is sufficiently mild that the algorithm can be used in practice to simulate medium-sized quantum circuits dominated by Clifford gates. The first demonstrations of fault-tolerant quantum circuits based on 2D topological codes are likely to be dominated by Clifford gates due to a high implementation cost associated with logical T gates. Thus our algorithm may serve as a verification tool for near-term quantum computers which cannot in practice be simulated by other means. To demonstrate the power of the new method, we performed a classical simulation of a hidden shift quantum algorithm with 40 qubits, a few hundred Clifford gates, and nearly 50 T gates.
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
ASH, R. B. (1966) · Cited by 3,990
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
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
Self-citationImproved simulation of stabilizer circuits
Aaronson, S., & Gottesman, D. (2004) · Physical Review A · doi:10.1103/physreva.70.052328 · Cited by 1,515
Topological Quantum Distillation
Bombin, H., & Martin-Delgado, M. A. (2006) · Physical Review Letters · doi:10.1103/physrevlett.97.180501 · Cited by 700
Exact and approximate unitary 2-designs and their application to fidelity estimation
Dankert, C., Cleve, R., Emerson, J., & Livine, E. (2009) · Physical Review A · doi:10.1103/physreva.80.012304 · Cited by 685
Simulating Quantum Computation by Contracting Tensor Networks
Markov, I. L., & Shi, Y. (2008) · SIAM Journal on Computing · doi:10.1137/050644756 · Cited by 472
Quantum codes on a lattice with boundary
Bravyi, S. B., & Kitaev, A. Y. (1998) · arXiv · doi:10.48550/arxiv.quant-ph/9811052 · Cited by 394
Self-citationMethodology 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
Classification of Topologically Protected Gates for Local Stabilizer Codes
Bravyi, S. B., & König, R. (2013) · Physical Review Letters · doi:10.1103/physrevlett.110.170503 · Cited by 263
Self-citationFast and efficient exact synthesis of single-qubit unitaries generated by clifford and T gates
Kliuchnikov, V., Maslov, D., & Mosca, M. (2012) · Quantum information & computation · doi:10.26421/qic13.7-8-4 · Cited by 255
Classical simulation of quantum computation, the gottesman-Knill theorem, and slightly beyond
den Nest, M. V. (2010) · Quantum Information and Computation · doi:10.26421/qic10.3-4-6 · Cited by 233
Estimating Outcome Probabilities of Quantum Circuits Using Quasiprobabilities
Pashayan, H., Wallman, J. J., & Bartlett, S. D. (2015) · Physical Review Letters · doi:10.1103/physrevlett.115.070501 · Cited by 210
Quantum Algorithms for Some Hidden Shift Problems
van Dam, W., Hallgren, S., & Ip, L. (2006) · SIAM Journal on Computing · doi:10.1137/s009753970343141x · Cited by 186
Lagrangian representation for fermionic linear optics
Bravyi, S. (2005) · Quantum Information and Computation · doi:10.26421/qic5.3-3 · Cited by 172
Self-citationStabilizer states and Clifford operations for systems of arbitrary dimensions and modular arithmetic
Hostens, E., Dehaene, J., & Moor, B. D. (2005) · Physical Review A · doi:10.1103/physreva.71.042315 · Cited by 137
Efficient Clifford+T approximation of single-qubit operators
Selinger, P. (2015) · Quantum Information and Computation · doi:10.26421/qic15.1-2-10 · Cited by 131
Fault-tolerant logical gates in quantum error-correcting codes
Pastawski, F., & Yoshida, B. (2015) · Physical Review A · doi:10.1103/physreva.91.012305 · Cited by 129
On the geometry of stabilizer states
García, H. J., Markov, I. L., & Cross, A. W. (2014) · Quantum Information and Computation · doi:10.26421/qic14.7-8-9 · Cited by 126
Surface code implementation of block code state distillation
Fowler, A. G., Devitt, S. J., & Jones, C. (2013) · Scientific Reports · doi:10.1038/srep01939 · Cited by 99
Cited by
Characterizing quantum supremacy in near-term devices
Boixo, S., Isakov, S. V., Smelyanskiy, V. N., Babbush, R., Ding, N., Jiang, Z., Bremner, M. J., Martinis, J. M., & Neven, H. (2018) · Nature Physics · doi:10.1038/s41567-018-0124-x · Cited by 1,175
Quantum information processing with superconducting circuits: a review
Wendin, G. (2017) · Reports on Progress in Physics · doi:10.1088/1361-6633/aa7e1a · Cited by 890
Quantum computational supremacy
Harrow, A. W., & Montanaro, A. (2017) · Nature · doi:10.1038/nature23458 · Cited by 702
Cai, Z., Babbush, R., Benjamin, S. C., Endo, S., Huggins, W. J., Li, Y., McClean, J. R., & O’Brien, T. E. (2023) · Reviews of Modern Physics · doi:10.1103/revmodphys.95.045005 · Cited by 591
Practical Quantum Error Mitigation for Near-Future Applications
Endo, S., Benjamin, S. C., & Li, Y. (2018) · Physical Review X · doi:10.1103/physrevx.8.031027 · Cited by 562
Metadata
- Authors
- Bravyi, S., & Gosset, D.
- Venue
- Physical Review Letters
- Publisher
- American Physical Society (APS)
- Published
- 2016-06-20
- Volume
- 116
- Issue
- 25
- Pages
- 250501-250501
- ISSN
- 0031-9007 (ISSN-L)
- 1079-7114
- OpenAlex
- W2299781645
- Cited by
- 320
- References
- 20
- FWCI
- 12.73
- 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.