Abstract A promising approach to achieve computational supremacy over the classical von Neumann architecture explores and quantum hardware as Ising machines. The minimisation of Hamiltonian is known be NP-hard problem yet not all instances are equivalently hard optimise. Given that operational principles machines suited structure some problems but others, we propose identify computationally sim...

Several physically inspired problems have been proven undecidable; examples are the spectral gap problem and membership for quantum correlations. Most of these results rely on reductions from a handful undecidable problems, such as halting problem, tiling Post correspondence or matrix mortality problem. All common property: they an NP-hard bounded version. This work establishes relation between...