UMBC ebiquity
arXiv:1912.02362 [quant-ph]
Quantum-Assisted Greedy Algorithms
December 5, 2019
We show how to leverage quantum annealers to better select candidates in greedy algorithms. Unlike conventional greedy algorithms that employ problem-specific heuristics for making locally optimal choices at each stage, we use quantum annealers that sample from the ground state of Ising Hamiltonians at cryogenic temperatures and use retrieved samples to estimate the probability distribution of problem variables. More specifically, we look at each spin in the Ising model as a random variable and contract all problem variables whose corresponding uncertainties are negligible. Our empirical results on a D-Wave 2000Q quantum processor revealed that the proposed quantum-assisted greedy algorithm (QAGA) can find remarkably better solutions, compared to the state-of-the-art techniques in the realm of quantum annealing.
Article
arXiv
Downloads: 542 downloads