Does quantum annealing outscale classical algorithms on 3D spin glasses?
70No. 127 in all physics · No. 20 in Condensed Matter Physics
Whether quantum annealers reach good low-energy states faster, as problems grow, than the best ordinary computer methods is still argued. The answer depends on which classical methods are used for the comparison.
Status in the literature
Unverified note: it names recent work and was partly written without a live literature search; it awaits a check by an editor.
The beyond-classical dynamics claim of King et al. (Science 2025) was challenged by tensor-network (Tindall et al., arXiv:2503.05693) and variational Monte Carlo (Mauron and Carleo, arXiv:2503.08247) simulations; the approximate-optimization scaling advantage of Munoz-Bauza and Lidar (PRL 2025) concerns 2D hardware-graph instances, not 3D.
No solutions, ideas or subproblems yet.
See also
- Related Asymptotic scaling of coherent quantum annealing in 3D spin glasses
- Related Exponentially small gaps inside the quantum spin-glass phase
- Related Polynomial-time algorithms beating the overlap-gap threshold for independent sets
Details, signature and history
- Kind
- Well-posed question
- Answer
- Yes no
- Topic review
- M. Bernaschi, I. Gonzalez-Adalid Pemartin, V. Martin-Mayor, G. Parisi, The quantum transition of the two-dimensional Ising spin glass, Nature, 2024. Link
- Record
- Revision 1 · imported from the seed collection · compiled by AI, not yet reviewed by an editor
Proof
- Fingerprint
- 67350e215885…
- Public log
- Entry 1,130, in checkpoint 2,123
- In the log by
- Block 969,698, 2026-10-03
This text was in the PubPhys log by that date. The date says nothing about when the problem was first posed.
Comments (0)
Comments are not records: they are not signed, stamped or logged. How comments work
No comments yet.
Sign in to comment.