Classical-Quantum Separations in Minimal Query Complexity of Boolean Functions.
Chandra Sekhar MukherjeeSubhamoy MaitraPublished in: CoRR (2020)
Keyphrases
- boolean functions
- membership queries
- query complexity
- dnf formulae
- uniform distribution
- dnf formulas
- exact learning
- target concept
- concept class
- equivalence queries
- quantum mechanics
- pac learning
- efficient learning
- data complexity
- concept classes
- read once formulas
- learning algorithm
- linear threshold
- quantum computing
- boolean formula