Quantum Sampling Algorithms for Near-Term Devices
Open accessThe DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Abstract
Efficient sampling from a classical Gibbs distribution is an important computational problem with applications ranging from statistical physics over Monte Carlo and optimization algorithms to machine learning. We introduce a family of quantum algorithms that provide unbiased samples by preparing a state encoding the entire Gibbs distribution. We show that this approach leads to a speedup over a classical Markov chain algorithm for several examples, including the Ising model and sampling from weighted independent sets of two different graphs. Our approach connects computational complexity with phase transitions, providing a physical interpretation of quantum speedup. Moreover, it opens the door to exploring potentially useful sampling algorithms on near-term quantum devices, as the algorithm for sampling from independent sets on certain graphs can be naturally implemented using Rydberg atom arrays.
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
Lloyd, S. (1996) · Science · doi:10.1126/science.273.5278.1073 · Cited by 3,088 · cited 1×
“Consequently, time evolution under these quantum Hamiltonians can be implemented using Hamiltonian simulation [47].”
MethodProbing many-body dynamics on a 51-atom quantum simulator
Bernien, H., Schwartz, S., Keesling, A., Levine, H., Omran, A., Pichler, H., Choi, S., Zibrov, A. S., Endres, M., Greiner, M., et al. (2017) · Nature · doi:10.1038/nature24622 · Cited by 2,460
Self-citationQuantum computational advantage using photons
Zhong, H.-S., Wang, H., Deng, Y.-H., Chen, M.-C., Peng, L.-C., Luo, Y.-H., Qin, J., Wu, D., Ding, X., Hu, Y., et al. (2020) · Science · doi:10.1126/science.abe8770 · Cited by 2,405
Quantum phases of matter on a 256-atom programmable quantum simulator
Ebadi, S., Wang, T. T., Levine, H., Keesling, A., Semeghini, G., Omran, A., Bluvstein, D., Samajdar, R., Pichler, H., Ho, W. W., et al. (2021) · Nature · doi:10.1038/s41586-021-03582-4 · Cited by 995
Self-citationQuantum Phases of Matter on a 256-Atom Programmable Quantum Simulator
Ebadi, S., Wang, T. T., Levine, H., Keesling, A., Semeghini, G., Omran, A., Bluvstein, D., Samajdar, R., Pichler, H., Ho, W. W., et al. (2020) · arXiv · doi:10.48550/arxiv.2012.12281 · Cited by 995
Self-citationThe 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
Quantum simulation of 2D antiferromagnets with hundreds of Rydberg atoms
Scholl, P., Schuler, M., Williams, H. J., Eberharter, A. A., Barredo, D., Schymik, K.-N., Lienhard, V., Henry, L.-P., Lang, T. C., Lahaye, T., et al. (2021) · Nature · doi:10.1038/s41586-021-03585-1 · Cited by 688
Criticality, the Area Law, and the Computational Power of Projected Entangled Pair States
Verstraete, F., Wolf, M. M., Perez-Garcia, D., & Cirac, J. I. (2006) · Physical Review Letters · doi:10.1103/physrevlett.96.220601 · Cited by 580 · cited 4×
“Any such Markov chain can be mapped onto a socalled parent Hamiltonian Hq(β) with the unique ground state |ψ(β)〉 [23].”
BackgroundMethodInfluentialAdiabatic quantum state generation and statistical zero knowledge
Aharonov, D., & Ta-Shma, A. (2003) · Proceedings of the thirty-fifth annual ACM symposium on Theory of computing · doi:10.1145/780542.780546 · Cited by 322 · cited 2×
“[24] Aharonov, D.”
MethodTemme, K., Osborne, T. J., Vollbrecht, K. G., Poulin, D., & Verstraete, F. (2011) · Nature · doi:10.1038/nature09770 · Cited by 305
On the complexity and verification of quantum random circuit sampling
Bouland, A., Fefferman, B., Nirkhe, C., & Vazirani, U. (2019) · Nature Physics · doi:10.1038/s41567-018-0318-2 · Cited by 287
Thermalization in Nature and on a Quantum Computer
Riera, A., Gogolin, C., & Eisert, J. (2012) · Physical Review Letters · doi:10.1103/physrevlett.108.080402 · Cited by 189 · cited 2×
“oped previously [12–22].”
Quantum Approach to Classical Statistical Mechanics
Somma, R. D., Batista, C. D., & Ortiz, G. (2007) · Physical Review Letters · doi:10.1103/physrevlett.99.030603 · Cited by 87
Quantum Optimization for Maximum Independent Set Using Rydberg Atom Arrays
Pichler, H., Wang, S.-T., Zhou, L., Choi, S., & Lukin, M. D. (2018) · arXiv · doi:10.48550/arxiv.1808.10816 · Cited by 35
Self-citation
Cited by
Quantum Phases of Matter on a 256-Atom Programmable Quantum Simulator
Ebadi, S., Wang, T. T., Levine, H., Keesling, A., Semeghini, G., Omran, A., Bluvstein, D., Samajdar, R., Pichler, H., Ho, W. W., et al. (2020) · arXiv · doi:10.48550/arxiv.2012.12281 · Cited by 995
Self-citationQuantum phases of matter on a 256-atom programmable quantum simulator
Ebadi, S., Wang, T. T., Levine, H., Keesling, A., Semeghini, G., Omran, A., Bluvstein, D., Samajdar, R., Pichler, H., Ho, W. W., et al. (2021) · Nature · doi:10.1038/s41586-021-03582-4 · Cited by 995
Self-citationQuantum optimization of maximum independent set using Rydberg atom arrays
Ebadi, S., Keesling, A., Cain, M., Wang, T. T., Levine, H., Bluvstein, D., Semeghini, G., Omran, A., Liu, J.-G., Samajdar, R., et al. (2022) · Science · doi:10.1126/science.abo6587 · Cited by 430
Self-citationQuantum science with optical tweezer arrays of ultracold atoms and molecules
Kaufman, A. M., & Ni, K.-K. (2021) · Nature Physics · doi:10.1038/s41567-021-01357-2 · Cited by 374
Challenges and opportunities in quantum optimization
Abbas, A., Ambainis, A., Augustino, B., Bärtschi, A., Buhrman, H., Coffrin, C., Cortiana, G., Dunjko, V., Egger, D. J., Elmegreen, B. G., et al. (2024) · Nature Reviews Physics · doi:10.1038/s42254-024-00770-9 · Cited by 201
Metadata
- Authors
- Wild, D. S., Sels, D., Pichler, H., Zanoci, C., & Lukin, M. D.
- Venue
- Physical Review Letters
- Publisher
- American Physical Society (APS)
- Published
- 2021-09-02
- Volume
- 127
- Issue
- 10
- Pages
- 100504-100504
- ISSN
- 0031-9007 (ISSN-L)
- 1079-7114
- OpenAlex
- W3031497571
- Cited by
- 31
- References
- 14
- FWCI
- 2.12
- 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.