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...

Full description

Saved in:

Bibliographic Details
Published in:	Communications physics Vol. 5; no. 1; pp. 1 - 10
Main Authors:	Kalinin, Kirill P., Berloff, Natalia G.
Format:	Journal Article
Language:	English
Published:	London Nature Publishing Group UK 12.01.2022 Nature Publishing Group Nature Portfolio
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!