Quantum Lower Bounds for Approximate Counting via Laurent Polynomials.
Scott AaronsonRobin KothariWilliam KretschmerJustin ThalerPublished in: Electron. Colloquium Comput. Complex. (2019)
Keyphrases
- lower bound
- upper bound
- exact solution
- exact and approximate
- branch and bound algorithm
- branch and bound
- objective function
- np hard
- provide an upper bound
- lower bounding
- optimal solution
- worst case
- lower and upper bounds
- low order
- quadratic assignment problem
- neural network
- quantum computation
- data sets
- vc dimension
- learning algorithm
- optimal cost
- quantum computing