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: | Davide Venturelli, Salvatore Mandrà, Sergey Knysh, Bryan O’Gorman, Rupak Biswas, Vadim Smelyanskiy |
---|---|
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 |
Similar Items
-
From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz
by: Stuart Hadfield, et al.
Published: (2019-02-01) -
Zero-temperature quantum annealing bottlenecks in the spin-glass phase
by: Sergey Knysh
Published: (2016-08-01) -
Dynamics in quantum spin glass systems
by: Bechmann, Michael
Published: (2004) -
Spin-polarized transport in magnetic nanostructures
by: O'Gorman, Brian Curtin
Published: (2011) -
Open-System Quantum Annealing in Mean-Field Models with Exponential Degeneracy*
by: Kostyantyn Kechedzhi, et al.
Published: (2016-05-01)