Quantum learning algorithms imply circuit lower bounds.
Srinivasan ArunachalamAlex B. GriloTom GurIgor Carboni OliveiraAarthi SundaramPublished in: FOCS (2022)
Keyphrases
- lower bound
- learning algorithm
- logic circuits
- upper bound
- online algorithms
- branch and bound algorithm
- machine learning algorithms
- objective function
- sample complexity
- machine learning
- np hard
- circuit design
- branch and bound
- quantum computation
- logic synthesis
- vc dimension
- high speed
- back propagation
- learning rate
- reinforcement learning
- analog circuits
- quantum computing
- lower and upper bounds
- generalization error
- low power
- learning problems
- learning models
- supervised learning
- membership queries
- electronic circuits
- optimal solution
- concept class
- quadratic assignment problem
- training data
- analog vlsi
- optimal cost
- quantum mechanics
- active learning
- data structure
- linear programming relaxation
- efficient learning
- delay insensitive
- upper and lower bounds
- scheduling problem
- quantum inspired
- worst case
- online learning