On Quantum Perceptron Learning via Quantum Search
This paper corrects a flawed complexity assumption in the quantum version space perceptron algorithm and proposes two new quantum-enhanced cutting-plane algorithms for perceptron learning that leverage Grover's search and quantum walk search to establish improved complexity bounds under idealized conditions.