Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat

The DOI matches its Crossref record; 36 of the 37 references it cites were found in a registry or an index, and 1 are not checked yet.

On the complexity and verification of quantum random circuit sampling

Overview

Integrity signals

Registry

Crossref · 10.1038/s41567-018-0318-2

Cites

36 of 37 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Citations

Cites

Show all 37 references

Research works printed but not linked: 4

  1. Terhal, B. M. & DiVincenzo, D. P. Adaptive quantum computation, constant depth quantum circuits and Arthur–Merlin games. Quantum Inf. Comput. 4, 134–145 (2004).
  2. Farhi, E. & Harrow, A. W. Quantum supremacy through the quantum approximate optimization algorithm. Preprint at https://arxiv.org/abs/1602.07674 (2016). · arXiv
  3. Boixo, S., Smelyanskiy, V. N. & Neven, H. Fourier analysis of sampling from noisy chaotic quantum circuits. Preprint at https://arxiv.org/abs/1708.01875 (2017). · arXiv
  4. Welch, L. & Berlekamp, E. Error correction for algebraic block codes. US patent 4,633,470 (1986).

Cited by

See all 465

Metadata

Authors
Bouland, A., Fefferman, B., Nirkhe, C., & Vazirani, U.
Affiliations
  • University of California, Berkeley (US)
  • National Institute of Standards and Technology (US)
Corresponding author
Fefferman, Bill
Venue
Nature Physics
Published
2018-10-29
Volume
15
Issue
2
Pages
159-163
ISSN
  • 1745-2473 (ISSN-L)
  • 1745-2481
OpenAlex
W2897579646
Cited by
287
References
37
Citations by year
2026: 27 · 2025: 58 · 2024: 42 · 2023: 42 · 2022: 36 · 2021: 46 · 2020: 28 · 2019: 7 · 2018: 1
FWCI
11.48
Type
journal article
Language
en
Open access
closed
Licence
www.springer.com/tdm (tdm)
Locations
Nature Physics (publishedVersion)
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 › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum many-body systems
Keywords
quantum advantage, average-case hardness, anti-concentration, verification measures, quantum computing, computational complexity, experimental noise

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: On the complexity and verification of quantum random circuit sampling. https://app.cochat.ai/papers/10.1038/s41567-018-0318-2
The paper
Bouland, A., Fefferman, B., Nirkhe, C., & Vazirani, U. (2019). On the complexity and verification of quantum random circuit sampling. Nature Physics. https://doi.org/10.1038/s41567-018-0318-2

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.