50 search results - page 3 / 10 » Average-Case Quantum Query Complexity |
ALT
2006
Springer
14 years 3 months ago
2006
Springer
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 setti...
AIEDAM
2008
13 years 6 months ago
2008
Although it is known that quantum computers can solve certain computational problems exponentially faster than classical computers, only a small number of quantum algorithms have ...
ALGORITHMICA
2010
13 years 6 months ago
2010
In this paper, we give a lower bound of (n(d-1)/2 ) on the quantum query complexity for finding a fixed point of a discrete Brouwer function over grid [1 : n]d . Our bound is near...
STACS
2009
Springer
14 years 1 months ago
2009
Springer
Motivated by the quantum algorithm for testing commutativity of black-box groups (Magniez and Nayak, 2007), we study the following problem: Given a black-box finite ring by an add...
COCO
2001
Springer
13 years 10 months ago
2001
Springer
Motivated by recent work on quantum black-box query complexity, we consider quantum versions of two wellstudied models of learning Boolean functions: Angluin’s model of exact le...