4895 search results - page 10 / 979 » Functional Quantum Programming |
COCO
2004
Springer
14 years 29 days ago
2004
Springer
In decision tree models, considerable attention has been paid on the effect of symmetry on computational complexity. That is, for a permutation group Γ, how low can the complexit...
ICALP
2007
Springer
14 years 1 months ago
2007
Springer
This paper studies the gap between classical one-way communication complexity C(f) and its quantum counterpart Q(f), under the unbounded-error setting, i.e., it is enough that the ...
CPHYSICS
2006
13 years 7 months ago
2006
The theory of the point and double groups has been widely used in quantum physics to understand the structure and dynamical properties of molecules and solids. In order to constru...
AIPS
2006
13 years 9 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...
COCO
2000
Springer
13 years 12 months ago
2000
Springer
It is known that the classical and quantum query complexities of a total Boolean function f are polynomially related to the degree of its representing polynomial, but the optimal ...