2661 search results - page 13 / 533 » Quantum Complexity Classes |
86
Voted
AIPS
2006
15 years 2 months ago
2006
This paper presents an adaptation of the standard quantum search technique to enable application within Dynamic Programming, in order to optimise a Markov Decision Process. This i...
114
Voted
ENTCS
2008
15 years 20 days ago
2008
In this paper we define nQML, a functional quantum programming language that follows the "quantum data and control" paradigm. In comparison to Altenkirch and Grattage�...
87
Voted
CORR
2008
Springer
15 years 20 days ago
2008
Springer
Abstract. We define and construct efficient depth-universal and almostsize-universal quantum circuits. Such circuits can be viewed as generalpurpose simulators for central classes ...
111
click to vote
ALGORITHMICA
2010
15 years 22 days 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...
100
click to vote
STACS
2010
Springer
15 years 7 months ago
2010
Springer
In this paper we consider the problem of testing whether two finite groups are isomorphic. Whereas the case where both groups are abelian is well understood and can be solved effi...