152 search results - page 3 / 31 » Robust Polynomials and Quantum Algorithms |
STACS
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. It is well-known that no classical algorithm can solve exactly (i.e., in bounded time without error) the leader election problem in anonymous networks. This paper propose...
ALGORITHMICA
2002
13 years 6 months ago
2002
We obtain the strongest separation between quantum and classical query complexity known to date--specifically, we define a black-box problem that requires exponentially many querie...
FOCS
1998
IEEE
13 years 10 months ago
1998
IEEE
We examine the number T of queries that a quantum network requires to compute several Boolean functions on f0;1gN in the black-box model. We show that, in the blackbox model, the ...
FLOPS
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. This article is a brief and subjective survey of quantum programming language research. 1 Quantum Computation Quantum computing is a relatively young subject. It has its ...
STACS
2009
Springer
14 years 1 months ago
2009
Springer
Motivated by the quantum algorithm for testing commutativity of black-box groups (Magniez and Nayak, 2007), we study the following problem: Given a black-box finite ring by an add...