Quantum Supremacy for Simulating a Translation-Invariant Ising Spin Model
Open accessThe DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
Abstract
We introduce an intermediate quantum computing model built from translation-invariant Ising-interacting spins. Despite being nonuniversal, the model cannot be classically efficiently simulated unless the polynomial hierarchy collapses. Equipped with the intrinsic single-instance-hardness property, a single fixed unitary evolution in our model is sufficient to produce classically intractable results, compared to several other models that rely on implementation of an ensemble of different unitaries (instances). We propose a feasible experimental scheme to implement our Hamiltonian model using cold atoms trapped in a square optical lattice. We formulate a procedure to certify the correct functioning of this quantum machine. The certification requires only a polynomial number of local measurements assuming measurement imperfections are sufficiently small.
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
Quantum Computation and Quantum Information: 10th Anniversary Edition
Nielsen, M. A., & Chuang, I. L. (2012) · doi:10.1017/cbo9780511976667 · Cited by 8,436
Simulating physics with computers
Feynman, R. P. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf02650179 · Cited by 7,691
Raussendorf, R., & Briegel, H. J. (2001) · Physical Review Letters · doi:10.1103/physrevlett.86.5188 · Cited by 4,477
Ladd, T. D., Jelezko, F., Laflamme, R., Nakamura, Y., Monroe, C., & O’Brien, J. L. (2010) · Nature · doi:10.1038/nature08812 · Cited by 3,592
Quantum Algorithm for Linear Systems of Equations
Harrow, A. W., Hassidim, A., & Lloyd, S. (2009) · Physical Review Letters · doi:10.1103/physrevlett.103.150502 · Cited by 3,325
Lloyd, S. (1996) · Science · doi:10.1126/science.273.5278.1073 · Cited by 3,088
Computational Complexity: A Modern Approach
Arora, S., & Barak, B. (2009) · doi:10.1017/cbo9780511804090 · Cited by 1,690
Measurement-based quantum computation on cluster states
Raussendorf, R., Browne, D. E., & Briegel, H. J. (2003) · Physical Review A · doi:10.1103/physreva.68.022312 · Cited by 1,655
Quantum computations: algorithms and error correction
Kitaev, A. Y. (1997) · Russian Mathematical Surveys · doi:10.1070/rm1997v052n06abeh002155 · Cited by 1,424
Classical and Quantum Computation
Kitaev, A., Shen, A., & Vyalyi, M. (2002) · Graduate Studies in Mathematics · doi:10.1090/gsm/047 · Cited by 1,387
Cited by
Quantum computational supremacy
Harrow, A. W., & Montanaro, A. (2017) · Nature · doi:10.1038/nature23458 · Cited by 702
Quantum advantage with shallow circuits
Bravyi, S., Gosset, D., & König, R. (2018) · Science · doi:10.1126/science.aar3106 · Cited by 406
Efficient representation of quantum many-body states with deep neural networks
Gao, X., & Duan, L.-M. (2017) · Nature Communications · doi:10.1038/s41467-017-00705-2 · Cited by 346
Self-citationRényi Entropies from Random Quenches in Atomic Hubbard and Spin Models
Elben, A., Vermersch, B., Dalmonte, M., Cirac, J. I., & Zoller, P. (2018) · Physical Review Letters · doi:10.1103/physrevlett.120.050406 · Cited by 257
Stochastic gradient descent for hybrid quantum-classical optimization
Sweke, R., Wilde, F., Meyer, J., Schuld, M., Faehrmann, P. K., Meynard-Piganeau, B., & Eisert, J. (2020) · Quantum · doi:10.22331/q-2020-08-31-314 · Cited by 219
Achieving quantum supremacy with sparse and noisy commuting quantum computations
Bremner, M. J., Montanaro, A., & Shepherd, D. J. (2017) · Quantum · doi:10.22331/q-2017-04-25-8 · Cited by 191
Nearly Optimal Lattice Simulation by Product Formulas
Childs, A. M., & Su, Y. (2019) · Physical Review Letters · doi:10.1103/physrevlett.123.050503 · Cited by 181
“The lattice Hamiltonians there have similar locality, so our analysis still applies.”
BackgroundInfluentialThe Born supremacy: quantum advantage and training of an Ising Born machine
Coyle, B., Mills, D., Danos, V., & Kashefi, E. (2020) · npj Quantum Information · doi:10.1038/s41534-020-00288-9 · Cited by 155
“Using the decomposition from [51], the relationship between a CZij(α) gate between qubit i and j, and an Ising interaction, exp(iαZi ⊗ Zj) is as follows: CZij(α) = e iα|1〉〈1|i⊗|1〉〈1|j = e iα 4 (1i−Zi)⊗(1j−Zj) = e iα 4 1i⊗1je− iα 4 1i⊗Zje− iα 4 Zi⊗1je iα 4 Zi⊗Zj (22)”
Computational advantage of quantum random sampling
Hangleiter, D., & Eisert, J. (2023) · Reviews of Modern Physics · doi:10.1103/revmodphys.95.035001 · Cited by 145
Anticoncentration theorems for schemes showing a quantum speedup
Hangleiter, D., Bermejo-Vega, J., Schwarz, M., & Eisert, J. (2018) · Quantum · doi:10.22331/q-2018-05-22-65 · Cited by 58
Limitations of Linear Cross-Entropy as a Measure for Quantum Advantage
Gao, X., Kalinowski, M., Chou, C.-N., Lukin, M. D., Barak, B., & Choi, S. (2021) · arXiv · doi:10.48550/arxiv.2112.01657 · Cited by 54
Self-citationPattern Recognition Techniques for Boson Sampling Validation
Agresti, I., Viggianiello, N., Flamini, F., Spagnolo, N., Crespi, A., Osellame, R., Wiebe, N., & Sciarrino, F. (2019) · Physical Review X · doi:10.1103/physrevx.9.011013 · Cited by 50
Fault-tolerant quantum speedup from constant depth quantum circuits
Mezher, R., Ghalbouni, J., Dgheim, J., & Markham, D. (2020) · Physical Review Research · doi:10.1103/physrevresearch.2.033444 · Cited by 8
“In our work, we overcome this problem using our new distillation technique, thereby making the appearance of a hard instance very likely in only a few repetitions of the experiment, a feature called single-instance hardness [22].”
MethodPolynomial-Time Classical Simulation of Noisy IQP Circuits with Constant Depth
Rajakumar, J., Watson, J. D., & Liu, Y.-K. (2025) · Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) · doi:10.1137/1.9781611978322.30 · Cited by 7
“Moreover, sampling IQP circuits can be shown to be equivalent to sampling from the output of certain time-evolved Hamiltonians [GWD17; BV+18].”
Metadata
- Authors
- Gao, X., Wang, S.-T., & Duan, L.-M.
- Venue
- Physical Review Letters
- Publisher
- American Physical Society (APS)
- Published
- 2017-01-27
- Volume
- 118
- Issue
- 4
- Pages
- 040502-040502
- ISSN
- 0031-9007 (ISSN-L)
- 1079-7114
- OpenAlex
- W2517871044
- Cited by
- 93
- References
- 23
- FWCI
- 8.69
- 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.