The DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.
Trading Classical and Quantum Computational Resources
Open accessAbstract
We propose examples of a hybrid quantum-classical simulation where a classical computer assisted by a small quantum processor can efficiently simulate a larger quantum system.First, we consider sparse quantum circuits such that each qubit participates in Oð1Þ two-qubit gates.It is shown that any sparse circuit on n þ k qubits can be simulated by sparse circuits on n qubits and a classical processing that takes time 2 OðkÞ polyðnÞ.Second, we study Pauli-based computation (PBC), where allowed operations are nondestructive eigenvalue measurements of n-qubit Pauli operators.The computation begins by initializing each qubit in the so-called magic state.This model is known to be equivalent to the universal quantum computer.We show that any PBC on n þ k qubits can be simulated by PBCs on n qubits and a classical processing that takes time 2 OðkÞ polyðnÞ.Finally, we propose a purely classical algorithm that can simulate a PBC on n qubits in a time 2 αn polyðnÞ, where α ≈ 0.94.This improves upon the brute-force simulation method, which takes time 2 n polyðnÞ.Our algorithm exploits the fact that n-fold tensor products of magic states admit a low-rank decomposition into n-qubit stabilizer states.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Raussendorf, R., & Briegel, H. J. (2001) · Physical Review Letters · doi:10.1103/physrevlett.86.5188 · Cited by 4,477
Lloyd, S. (1996) · Science · doi:10.1126/science.273.5278.1073 · Cited by 3,088
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
Theory of fault-tolerant quantum computation
Gottesman, D. (1998) · Physical Review A · doi:10.1103/physreva.57.127 · Cited by 947
Power of One Bit of Quantum Information
Knill, E., & Laflamme, R. (1998) · Physical Review Letters · doi:10.1103/physrevlett.81.5672 · Cited by 884
Contextuality supplies the ‘magic’ for quantum computation
Howard, M., Wallman, J., Veitch, V., & Emerson, J. (2014) · Nature · doi:10.1038/nature13460 · Cited by 616
A Meet-in-the-Middle Algorithm for Fast Synthesis of Depth-Optimal Quantum Circuits
Amy, M., Maslov, D., Mosca, M., & Roetteler, M. (2013) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2013.2244643 · Cited by 549
High-threshold universal quantum computation on the surface code
Fowler, A. G., Stephens, A. M., & Groszkowski, P. (2009) · Physical Review A · doi:10.1103/physreva.80.052312 · Cited by 486
Simulating Quantum Computation by Contracting Tensor Networks
Markov, I. L., & Shi, Y. (2008) · SIAM Journal on Computing · doi:10.1137/050644756 · Cited by 472
Cited by
Chitambar, E., & Gour, G. (2019) · Reviews of Modern Physics · doi:10.1103/revmodphys.91.025001 · Cited by 1,276
Quantum Algorithms for Quantum Chemistry and Quantum Materials Science
Bauer, B., Bravyi, S., Motta, M., & Chan, G. K.-L. (2020) · Chemical Reviews · doi:10.1021/acs.chemrev.9b00829 · Cited by 848
Self-citationPractical 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
Application of a Resource Theory for Magic States to Fault-Tolerant Quantum Computing
Howard, M., & Campbell, E. (2017) · Physical Review Letters · doi:10.1103/physrevlett.118.090501 · Cited by 387
Rydberg atom quantum technologies
Adams, C. S., Pritchard, J. D., & Shaffer, J. P. (2020) · Journal of Physics B: Atomic, Molecular and Optical Physics · doi:10.1088/1361-6455/ab52ef · Cited by 380
Metadata
- Authors
- Bravyi, S., Smith, G., & Smolin, J. A.
- Venue
- Physical Review X
- Publisher
- American Physical Society (APS)
- Published
- 2016-06-29
- Volume
- 6
- Issue
- 2
- ISSN
- 2160-3308 (ISSN-L)
- OpenAlex
- W1789015869
- Cited by
- 299
- References
- 27
- FWCI
- 7.19
- Type
- journal article
- Language
- en
- Open access
- gold
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Trading Classical and Quantum Computational Resources. https://app.cochat.ai/papers/10.1103/physrevx.6.021043
- The paper
- Bravyi, S., Smith, G., & Smolin, J. A. (2016). Trading Classical and Quantum Computational Resources. Physical Review X. https://doi.org/10.1103/physrevx.6.021043
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.