4895 search results - page 47 / 979 » Functional Quantum Programming |
127
click to vote
CORR
2006
Springer
15 years 4 months ago
2006
Springer
We give a tight lower bound of ( n) for the randomized one-way communication complexity of the Boolean Hidden Matching Problem [BJK04]. Since there is a quantum one-way communica...
163
click to vote
CORR
2012
Springer
14 years 6 days ago
2012
Springer
A sequence fn(q) is q-holonomic if it satisfies a nontrivial linear recurrence with coefficients polynomials in q and qn . Our main theorem states that q-holonomicity is preserve...
124
click to vote
GLVLSI
2007
IEEE
15 years 10 months ago
2007
IEEE
Compact realizations of reversible logic functions are of interest in the design of quantum computers. Such reversible functions are realized as a cascade of Toffoli gates. In th...
155
click to vote
CAIP
2005
Springer
15 years 10 months ago
2005
Springer
Non-parametric data representation can be done by means of a potential function. This paper introduces a methodology for finding modes of the potential function. Two different me...
132
click to vote
CDC
2009
IEEE
15 years 9 months ago
2009
IEEE
Abstract— We consider the simplest model for controlling the rotation of a molecule by the action of an electric field, namely a quantum planar pendulum. This problem consists i...