105 citations · 165 across the 3 of their papers we have counts for
3 papers
Quantum Annealing and the Satisfiability Problem
Kristen L. Pudenz, Gregory S. Tallant, Todd R. Belote +1
The utility of satisfiability (SAT) as an application focused hard computational problem is well established. We explore the potential of quantum annealing to enhance classical SAT…
Quantum annealing correction for random Ising problems
Kristen L. Pudenz, Tameem Albash, Daniel A. Lidar
We demonstrate that the performance of a quantum annealer on hard random Ising optimization problems can be substantially improved using quantum annealing correction (QAC). Our err…
A Near-Term Quantum Computing Approach for Hard Computational Problems in Space Exploration
Vadim N. Smelyanskiy, Eleanor G. Rieffel, Sergey I. Knysh +5
In this article, we show how to map a sampling of the hardest artificial intelligence problems in space exploration onto equivalent Ising models that then can be attacked using qua…