Explicit relation between all lower bound techniques for quantum query complexity.
Loïck MagninJérémie RolandPublished in: STACS (2013)
Keyphrases
- query complexity
- lower bound
- concept class
- upper bound
- vc dimension
- learning theory
- concept classes
- membership queries
- data complexity
- np hard
- objective function
- exact learning
- lower and upper bounds
- optimal solution
- equivalence queries
- worst case
- sample complexity
- concept learning
- efficient learning
- dnf formulas
- upper and lower bounds
- pac learning
- semi supervised learning
- relational databases
- linear programming