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

The DOI matches its Crossref record; 58 of the 58 references it cites were found in a registry or an index.

Achieving quantum supremacy with sparse and noisy commuting quantum computations

Open access

Abstract

The class of commuting quantum circuits known as IQP (instantaneous quantum polynomial-time) has been shown to be hard to simulate classically, assuming certain complexity-theoretic conjectures. Here we study the power of IQP circuits in the presence of physically motivated constraints. First, we show that there is a family of sparse IQP circuits that can be implemented on a square lattice of n qubits in depth O(sqrt(n) log n), and which is likely hard to simulate classically. Next, we show that, if an arbitrarily small constant amount of noise is applied to each qubit at the end of any IQP circuit whose output probability distribution is sufficiently anticoncentrated, there is a polynomial-time classical algorithm that simulates sampling from the resulting distribution, up to constant accuracy in total variation distance. However, we show that purely classical error-correction techniques can be used to design IQP circuits which remain hard to simulate classically, even in the presence of arbitrary amounts of noise of this form. These results demonstrate the challenges faced by experiments designed to demonstrate quantum supremacy over classical computation, and how these challenges can be overcome.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.22331/q-2017-04-25-8

Cites

58 of 58 references verified0 citation errors · 0 not checkable

Statistics

Figures

Figure 1 A standard IQP circuit, and an IQP circuit with depolarising noise. D is a circuit made up of poly( n ) diagonal gates.
Figure 1 A standard IQP circuit, and an IQP circuit with depolarising noise. D is a circuit made up of poly( n ) diagonal gates.CC-BY · From the PDF

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.

A few free checks a day · papers already verified open instantly · results are public

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?

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

  • Graph Theory

    Diestel, R. (1997) · Cited by 5,082

  • Modern Coding Theory

    Richardson, T., & Urbanke, R. (2008) · Cambridge University Press eBooks · doi:10.1017/cbo9780511791338 · Cited by 2,271 · cited 1×

    “Explicit codes which almost achieve Shannon’s nonconstructive bound, and have efficient decoding algorithms, are known; for example, low-density parity check codes and certain concatenated codes [35].”
    Background
  • A Quantum Approximate Optimization Algorithm

    Farhi, E., Goldstone, J., & Gutmann, S. (2014) · arXiv · doi:10.48550/arxiv.1411.4028 · Cited by 1,789 · cited 1×

    “pproximate hs|H⊗n|ψiup to very high accuracy. One particular case which is tempting to address is the \quantum approximate optimization algorithm" (QAOA) invented by Farhi, Goldstone and Gutmann [18,19]. This algorithm has been proposed to oer a route towards proving quantum supremacy [20]. In the simplest versio…”
    Method
  • On the Power of Quantum Computation

    Simon, D. R. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539796298637 · Cited by 1,295

  • 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 · cited 2×

    “notion in itself would be sucient for a complexity-theoretic hardness argument, it is thus plausible that our results could be extended to noncommuting circuits. It should also be noted that recent [7] numerical evidence suggests that anticoncentration can be achieved on a square lattice with circuits of depth O( √ n)…”
    BackgroundSelf-citation
  • Concentration of Measure for the Analysis of Randomized Algorithms

    Dubhashi, D. P., & Panconesi, A. (2009) · Cambridge University Press eBooks · doi:10.1017/cbo9780511581274 · Cited by 945 · cited 2×

    “The degree of v1 is the number of edges incident to v1; each edge is present with probability p; so by a Chernoff bound argument [17]”
    BackgroundMethod
  • Analysis of Boolean Functions

    O'Donnell, R. (2014) · Cambridge University Press eBooks · doi:10.1017/cbo9781139814782 · Cited by 932

  • The computational complexity of linear optics

    Aaronson, S., & Arkhipov, A. (2011) · Proceedings of the forty-third annual ACM symposium on Theory of computing · doi:10.1145/1993636.1993682 · Cited by 874 · cited 6×

    “On the other hand, it was shown by Arkhipov [3] (see also [39]) that if = o(1/n2), the `1 distance between the noisy distribution and the original distribution is o(1).”
    MethodResultInfluential
  • Graph Theory

    Diestel, R. (2010) · Graduate Texts in Mathematics · doi:10.1007/978-3-642-14279-6 · Cited by 714

  • PP is as Hard as the Polynomial-Time Hierarchy

    Toda, S. (1991) · SIAM Journal on Computing · doi:10.1137/0220053 · Cited by 665 · cited 1×

    “If this conjecture holds, then the existence of such a classical sampler would imply collapse of the polynomial hierarchy [42], a complexity-theoretic consequence considered very unlikely; see [11] for more.”
    Background

Show all 51 references

Cited by

See all 191

Metadata

Authors
Bremner, M. J., Montanaro, A., & Shepherd, D. J.
Affiliations
  • University of Technology Sydney (AU)
  • University of Bristol (GB)
  • 3NCSC, Hubble Road, Cheltenham, UK
Venue
Quantum
Published
2017-04-25
Volume
1
Pages
8
ISSN
2521-327X (ISSN-L)
OpenAlex
W2528010580
Cited by
191
References
51
Citations by year
2026: 9 · 2025: 15 · 2024: 22 · 2023: 14 · 2022: 15 · 2021: 26 · 2020: 24 · 2019: 23 · 2018: 27 · 2017: 16
FWCI
14.68
Type
journal article
Language
en
Open access
Locations
  • Quantum (publishedVersion, cc-by)
  • arXiv (Cornell University) (submittedVersion)
  • DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
  • UTS ePRESS (University of Technology Sydney) (submittedVersion)
  • Bristol Research (University of Bristol) (submittedVersion, cc-by)
  • Explore Bristol Research (submittedVersion, cc-by)
  • arXiv (Cornell University) (cc-by)
Funders
  • Engineering and Physical Sciences Research Council (EP/L021005/1)
  • Australian Research Council (FT110101044, CE170100012)
  • Centre of Excellence for Quantum Computation and Communication Technology, Australian Research Council (CE170100012)
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, IQP circuits, noisy quantum circuits, classical simulation, anti-concentration, total variation distance, square lattice

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: Achieving quantum supremacy with sparse and noisy commuting quantum computations. https://app.cochat.ai/papers/10.22331/q-2017-04-25-8
The paper
Bremner, M. J., Montanaro, A., & Shepherd, D. J. (2017). Achieving quantum supremacy with sparse and noisy commuting quantum computations. Quantum. https://doi.org/10.22331/q-2017-04-25-8

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.