Quantum Optimization of Fully Connected Spin Glasses
Many NP-hard problems can be seen as the task of finding a ground state of a disordered highly connected Ising spin glass. If solutions are sought by means of quantum annealing, it is often necessary to represent those graphs in the annealer’s hardware by means of the graph-minor embedding technique...
Main Authors: | , , , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
American Physical Society
2015-09-01
|
Series: | Physical Review X |
Online Access: | http://doi.org/10.1103/PhysRevX.5.031040 |