4 citations · 9 across the 7 of their papers we have counts for
1 paper · 2 filters
Jun Takahashi, Koji Hukushima
The computational complexity conjecture of NP ⊈ BQP implies that there should be an exponentially small energy gap for Quantum Annealing (QA) of NP-hard problems. We aim…