131 search results - page 9 / 27 » Adversary lower bounds for nonadaptive quantum algorithms |
144
click to vote
STOC
1997
ACM
15 years 10 months ago
1997
ACM
We examine a class of collective coin- ipping games that arises from randomized distributed algorithms with halting failures. In these games, a sequence of local coin ips is gener...
159
click to vote
ICALP
2001
Springer
15 years 10 months ago
2001
Springer
We consider the quantum complexities of the following three problems: searching an ordered list, sorting an un-ordered list, and deciding whether the numbers in a list are all dis...
180
click to vote
CORR
2011
Springer
15 years 29 days ago
2011
Springer
We show that any quantum algorithm to decide whether a function f : [n] → [n] is a permutation or far from a permutation must make Ω n1/3 /w queries to f, even if the algorith...
155
click to vote
STOC
2002
ACM
16 years 6 months ago
2002
ACM
A randomized algorithm is given that solves the wait-free consensus problem for a shared-memory model with infinitely many processes. The algorithm is based on a weak shared coin ...
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...