Explicit relation between all lower bound techniques for quantum query complexity.
Loïck MagninJérémie RolandPublished in: Electron. Colloquium Comput. Complex. (2012)
Keyphrases
- query complexity
- lower bound
- concept class
- upper bound
- vc dimension
- learning theory
- data complexity
- membership queries
- concept classes
- optimal solution
- dnf formulas
- objective function
- uniform distribution
- concept learning
- np hard
- lower and upper bounds
- databases
- np complete
- upper and lower bounds
- response time
- worst case
- expressive power
- pac learning
- target concept
- semi supervised
- resource consumption
- equivalence queries
- exact learning
- data streams
- machine learning