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

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

Anticoncentration theorems for schemes showing a quantum speedup

Open access
Hangleiter, Dominik, Bermejo-Vega, Juan, Schwarz, Martin, Eisert, Jens · 2018 · Quantum

Abstract

One of the main milestones in quantum information science is to realise quantum devices that exhibit an exponential computational advantage over classical ones without being universal quantum computers, a state of affairs dubbed quantum speedup, or sometimes "quantum computational supremacy". The known schemes heavily rely on mathematical assumptions that are plausible but unproven, prominently results on anticoncentration of random prescriptions. In this work, we aim at closing the gap by proving two anticoncentration theorems and accompanying hardness results, one for circuit-based schemes, the other for quantum quench-type schemes for quantum simulations. Compared to the few other known such results, these results give rise to a number of comparably simple, physically meaningful and resource-economical schemes showing a quantum speedup in one and two spatial dimensions. At the heart of the analysis are tools of unitary designs and random circuits that allow us to conclude that universal random circuits anticoncentrate as well as an embedding of known circuit-based schemes in a 2D translation-invariant architecture.

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.

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

Integrity signals

Registry

Crossref · 10.22331/q-2018-05-22-65

Cites

71 of 71 references verified0 citation errors · 0 not checkable

Statistics

Figures

Image 1
CC-BY · From the PDF
Figure 2 Quantum quench architecture. Circles denote qubits, lines denote interactions. Blue sites are initialised on | + 〉 ; pink ones on | 0 〉 or | 1 〉 at random; yellow ones on e -i k i p Z/ 8 | + 〉 with random k i ∈ { 0 , 1 , 2 , 3 } . The Hamiltonian evolution (10) implements CZ gates on connected qubit pairs. Qubits are measured in the X basis. .
Figure 2 Quantum quench architecture. Circles denote qubits, lines denote interactions. Blue sites are initialised on | + 〉 ; pink ones on | 0 〉 or | 1 〉 at random; yellow ones on e -i k i p Z/ 8 | + 〉 with random k i ∈ { 0 , 1 , 2 , 3 } . The Hamiltonian evolution (10) implements CZ gates on connected qubit pairs. Qubits are measured in the X basis. .CC-BY · From the PDF
Image 3
CC-BY · From the PDF
Image 4
CC-BY · From the PDF

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.

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

Show all 49 references

Research works printed but not linked: 6

  1. T. Kapourniotis and A. Datta, (2017), arXiv:1703.09568. · arXiv
  2. G. Kuperberg, Theory of Computing 11, 183 (2015). · doi:10.4086/toc.2015.v011a006
  3. A. Bouland, B. Fefferman, C. Nirkhe, and U. Vazirani, (2018), arXiv:1803.04402. · arXiv
  4. M. A. Nielsen and I. L. Chuang, Quantum computation and quantum information, Cambridge Series on Information and the Natural Sciences (Cambridge University Press, 2000).
  5. J. Eisert, M. Friesdorf, and C. Gogolin, Nature Phys 11, 124 (2015), arXiv:1408.5148. · arXiv
  6. S. Aaronson and L. Chen, (2016), arXiv:1612.05903. · arXiv

Cited by

See all 81

Metadata

Authors
Hangleiter, D., Bermejo-Vega, J., Schwarz, M., & Eisert, J.
Affiliations
Freie Universität Berlin (DE)
Venue
Quantum
Published
2018-05-22
Volume
2
Pages
65
ISSN
2521-327X (ISSN-L)
OpenAlex
W2756364467
Cited by
58
References
49
Citations by year
2026: 8 · 2025: 12 · 2024: 7 · 2023: 7 · 2022: 7 · 2021: 7 · 2020: 4 · 2019: 5 · 2018: 1
FWCI
2.39
Type
journal article
Language
en
Open access
Locations
  • Quantum (publishedVersion, cc-by)
  • arXiv (Cornell University) (submittedVersion)
  • DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion)
  • arXiv (Cornell University) (cc-by)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
  • Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum many-body systems
  • Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
Keywords
anti-concentration, quantum advantage, random circuits, unitary designs, quantum quench, quantum simulation, hardness results, two-dimensional quantum systems

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: Anticoncentration theorems for schemes showing a quantum speedup. https://app.cochat.ai/papers/10.22331/q-2018-05-22-65
The paper
Hangleiter, D., Bermejo-Vega, J., Schwarz, M., & Eisert, J. (2018). Anticoncentration theorems for schemes showing a quantum speedup. Quantum. https://doi.org/10.22331/q-2018-05-22-65

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.