88 search results - page 10 / 18 » Quantum lower bounds by quantum arguments |
158
click to vote
STOC
2007
ACM
16 years 6 months 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...
196
click to vote
COCO
2005
Springer
15 years 11 months ago
2005
Springer
Consider a two-party quantum communication protocol for computing some function f : {0, 1}n × {0, 1}n → Z. We show that the first message of P can be compressed to O(k) classi...
132
click to vote
TOC
2008
15 years 5 months ago
2008
Abstract: We give a quantum algorithm for the binary NAND tree problem in the Hamiltonian oracle model. The algorithm uses a continuous time quantum walk with a running time propor...
166
click to vote
ICALP
2004
Springer
15 years 11 months ago
2004
Springer
Quantum algorithms for graph problems are considered, both in the adjacency matrix model and in an adjacency list-like array model. We give almost tight lower and upper bounds for ...
181
click to vote
FCT
2007
Springer
16 years 4 days ago
2007
Springer
We present quantum query complexity bounds for testing algebraic properties. For a set S and a binary operation on S, we consider the decision problem whether S is a semigroup or ...