Quantum speedups for dynamic programming on n-dimensional lattice graphs.
Adam GlosRyuhei MoriJevgenijs VihrovsPublished in: CoRR (2021)
Keyphrases
- dynamic programming
- orders of magnitude
- multi dimensional
- graph theoretic
- parallel processing
- greedy algorithm
- finding the shortest path
- lattice structure
- graph matching
- graph mining
- coarse to fine
- graph theory
- graph model
- directed graph
- graph databases
- infinite horizon
- state space
- optimal control
- stereo matching
- series parallel
- boolean algebra
- labeled graphs
- evolutionary algorithm