Quantum Speedups for Dynamic Programming on n-Dimensional Lattice Graphs.
Adam GlosMartins KokainisRyuhei MoriJevgenijs VihrovsPublished in: MFCS (2021)
Keyphrases
- dynamic programming
- multi dimensional
- orders of magnitude
- graph matching
- state space
- optimal policy
- graph model
- neural network
- single machine
- stereo matching
- multiresolution
- graph partitioning
- undirected graph
- linear programming
- parallel processing
- graph theoretic
- optimal control
- graph clustering
- bipartite graph
- dimensional data
- lattice structure
- series parallel
- boolean algebra
- quantum computing
- quantum inspired
- graph data
- graph databases
- graph mining
- markov decision processes
- random walk
- reinforcement learning
- data mining