Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > DETAIL:

Paper:

TR05-082 | 3rd June 2005 00:00

On the Query Complexity of Quantum Learners

RSS-Feed




TR05-082
Authors: Jorge Castro
Publication: 27th July 2005 22:45
Downloads: 1338
Keywords: 


Abstract:

This paper introduces a framework for quantum exact learning via queries, the so-called quantum protocol. It is shown that usual protocols in the classical learning setting have quantum counterparts. A combinatorial notion, the general halving dimension, is also introduced. Given a quantum protocol and a target concept class, the general halving dimension provides a lower bound on the number of queries that a quantum algorithm needs to learn. For usual protocols, this lower bound is also valid even if only involution oracle teachers are considered. The general halving dimension also approximates the query complexity of ordinary randomized learners. From these bounds we conclude that any quantum polynomially query learnable concept class must be also polynomially learnable in the classical setting.



ISSN 1433-8092 | Imprint