1 citations · 1 across the 1 of their papers we have counts for
1 paper
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…