Classical and quantum dynamic programming for Subset-Sum and variants.
Jonathan AllcockYassine HamoudiAntoine JouxFelix KlingelhöferMiklos SanthaPublished in: CoRR (2021)
Keyphrases
- dynamic programming
- quantum computation
- quantum mechanics
- greedy algorithm
- quantum probability
- stereo matching
- objective function
- linear programming
- state space
- database
- lagrangian relaxation
- data mining
- dp matching
- databases
- upper bound
- optimal control
- knowledge base
- channel capacity
- quantum computing
- quantum inspired
- square error