6 citations · 18 across the 6 of their papers we have counts for
Showing 2022Show all
2 papers · 1 filter
quant-ph2022★ 6 cited
Many bounded versions of undecidable problems are NP-hard
Andreas Klingler, Mirte van der Eyden, Sebastian Stengele +2
Several physically inspired problems have been proven undecidable; examples are the spectral gap problem and the membership problem for quantum correlations. Most of these results…
cond-mat.stat-mech2022★ 2 cited
The grammar of the Ising model: A new complexity hierarchy
Tobias Reinhart, Gemma De les Coves
How complex is an Ising model? Usually, this is measured by the computational complexity of its ground state energy problem. Yet, this complexity measure only distinguishes between…