Quantum learning algorithms imply circuit lower bounds.
Srinivasan ArunachalamAlex Bredariol GriloTom GurIgor Carboni OliveiraAarthi SundaramPublished in: Electron. Colloquium Comput. Complex. (2020)
Keyphrases
- lower bound
- learning algorithm
- logic circuits
- upper bound
- online algorithms
- logic synthesis
- high speed
- sample complexity
- machine learning algorithms
- quantum computing
- branch and bound
- branch and bound algorithm
- optimal solution
- vc dimension
- quantum computation
- objective function
- quantum mechanics
- learning problems
- active learning
- training data
- lower and upper bounds
- supervised learning
- worst case
- learning scheme
- learning models
- low power
- circuit design
- np hard
- lower bounding
- analog circuits
- upper and lower bounds
- analog vlsi
- quantum inspired
- labeled data
- reinforcement learning
- learning rate
- delay insensitive
- digital circuits
- quadratic assignment problem
- back propagation
- linear programming relaxation
- efficient learning
- generalization error