Quantum Lower Bound for Approximate Counting Via Laurent Polynomials.
Scott AaronsonPublished in: CoRR (2018)
Keyphrases
- lower bound
- upper bound
- exact solution
- branch and bound algorithm
- exact and approximate
- objective function
- np hard
- branch and bound
- optimal solution
- provide an upper bound
- quantum computation
- quantum computing
- lower and upper bounds
- upper and lower bounds
- worst case
- neural network
- feasible solution
- randomized algorithm
- sufficiently accurate
- information retrieval
- hermite transform