Carregant...
Carregant...

Vés al contingut (premeu Retorn)

On the query complexity of quantum learners

Autor
Castro, J.
Tipus d'activitat
Document cientificotècnic
Data
2005-06
Codi
LSI-05-28-R
Repositori
http://hdl.handle.net/2117/84843 Obrir en finestra nova
Resum
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 e...
Citació
Castro, J. "On the query complexity of quantum learners". 2005.
Paraules clau
Learning, Quantum protocol, Queries
Grup de recerca
LARCA - Laboratori d'Algorísmia Relacional, Complexitat i Aprenentatge

Participants

Arxius