Computational complexity continuum within Ising formulation of NP problems

A promising approach to achieve computational supremacy over the classical von Neumann architecture explores classical and quantum hardware as Ising machines. The minimisation of the Ising Hamiltonian is known to be NP-hard problem yet not all problem instances are equivalently hard to optimise. Giv...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Communications physics Ročník 5; číslo 1; s. 1 - 10
Hlavní autori:	Kalinin, Kirill P., Berloff, Natalia G.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	London Nature Publishing Group UK 12.01.2022 Nature Publishing Group Nature Portfolio
Predmet:	639/624/400/2797 639/705/1042 Algorithms Complexity Criteria Electronic systems Graphs Ising model Linear programming Numerical methods Optimization Performance evaluation Physics Physics and Astronomy Rewiring Simulators Spin glasses
ISSN:	2399-3650, 2399-3650
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!