Application
Quantum-Assisted Greedy Algorithms
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(s) of a problem-dependent Ising Hamiltonians at cryogenic temperatures and use retrieved samples to estimate the probability distribution of problem variables.
INDUSTRY : Cross-industry
DISCIPLINE : Algorithms & Tools