pith. sign in

arxiv: quant-ph/0309059 · v1 · submitted 2003-09-05 · 🪐 quant-ph

The geometry of quantum learning

classification 🪐 quant-ph
keywords learningquantumalgorithmsconceptproblemstechniquealgorithms--quantumamplification--with
0
0 comments X
read the original abstract

Concept learning provides a natural framework in which to place the problems solved by the quantum algorithms of Bernstein-Vazirani and Grover. By combining the tools used in these algorithms--quantum fast transforms and amplitude amplification--with a novel (in this context) tool--a solution method for geometrical optimization problems--we derive a general technique for quantum concept learning. We name this technique "Amplified Impatient Learning" and apply it to construct quantum algorithms solving two new problems: BATTLESHIP and MAJORITY, more efficiently than is possible classically.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.