131 search results - page 13 / 27 » Adversary lower bounds for nonadaptive quantum algorithms |
STOC
2007
ACM
16 years 15 hour ago
2007
ACM
We study properties of quantum strategies, which are complete specifications of a given party's actions in any multiple-round interaction involving the exchange of quantum in...
124
click to vote
FCT
2005
Springer
15 years 5 months ago
2005
Springer
We present several results on the complexity of various forms of Sperner’s Lemma in the black-box model of computing. We give a deterministic algorithm for Sperner problems over ...
107
click to vote
ICIC
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. We study the approximation of the integration of multivariate functions classes in the quantum model of computation. We first obtain a lower bound of the n-th minimal qu...
DATE
2004
IEEE
15 years 3 months ago
2004
IEEE
We show how to implement an arbitrary two-qubit unitary operation using any of several quantum gate libraries with small a priori upper bounds on gate counts. In analogy to librar...
NDSS
2008
IEEE
15 years 6 months ago
2008
IEEE
Automatic signature generation is necessary because there may often be little time between the discovery of a vulnerability, and exploits developed to target the vulnerability. Mu...