Quantum lower bounds for the Goldreich-Levin problem.
Mark AdcockRichard CleveKazuo IwamaRaymond H. PutraShigeru YamashitaPublished in: Inf. Process. Lett. (2006)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- quantum computation
- np hard
- optimal solution
- branch and bound
- lower and upper bounds
- quantum inspired
- quantum computing
- objective function
- worst case
- quadratic assignment problem
- quantum mechanics
- lower bounding
- lagrangian relaxation
- linear programming relaxation
- online algorithms
- channel capacity
- vc dimension
- running times
- max sat
- integer programming
- special case
- quantum evolutionary algorithm