Classical lower bounds from quantum upper bounds.
Shalev Ben-DavidAdam BoulandAnkit GargRobin KothariPublished in: CoRR (2018)
Keyphrases
- upper bound
- lower bound
- quantum computation
- branch and bound
- upper and lower bounds
- quantum mechanics
- worst case
- lower and upper bounds
- np hard
- branch and bound algorithm
- tight bounds
- optimal solution
- generalization error
- quantum probability
- vc dimension
- lower bounding
- objective function
- sample complexity
- quantum computing
- upper bounding
- concept classes
- sample size
- search algorithm
- optimal cost
- quantum inspired
- efficiently computable
- tight upper and lower bounds