Computational complexity of three-dimensional Ising spin glass: Lessons from D-wave annealer
Finding an exact ground state of a three-dimensional (3D) Ising spin glass is proven to be an NP-hard problem (i.e., at least as hard as any problem in the nondeterministic polynomial-time (NP) class). Given validity of the exponential time hypothesis, its computational complexity was proven to be n...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
American Physical Society
2025-07-01
|
| Series: | Physical Review Research |
| Online Access: | http://doi.org/10.1103/3bkn-v5rd |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|