An Algorithmic Argument for Nonadaptive Query Complexity Lower Bounds on Advised Quantum Computation (Extended Abstract).
Harumichi NishimuraTomoyuki YamakamiPublished in: MFCS (2004)
Keyphrases
- extended abstract
- query complexity
- quantum computation
- concept class
- lower bound
- membership queries
- vc dimension
- equivalence queries
- upper bound
- concept classes
- boolean functions
- dnf formulas
- learning theory
- uniform distribution
- exact learning
- efficient learning
- pac learning
- data complexity
- lower and upper bounds
- learning algorithm
- target concept
- optimal solution
- objective function
- sample complexity
- concept learning
- worst case
- upper and lower bounds
- np hard
- databases
- resource consumption
- query answering
- statistical queries