2661 search results - page 22 / 533 » Quantum Complexity Classes |
104
Voted
STOC
2006
ACM
16 years 28 days ago
2006
ACM
We consider the problem of bounded-error quantum state identification: given either state 0 or state 1, we are required to output `0', `1' or `?' ("don't ...
112
Voted
STACS
2005
Springer
15 years 6 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...
101
click to vote
CORR
2008
Springer
15 years 21 days ago
2008
Springer
We present two general methods for proving lower bounds on the query complexity of nonadaptive quantum algorithms. Both methods are based on the adversary method of Ambainis. We sh...
88
Voted
COCO
2008
Springer
15 years 2 months ago
2008
Springer
: We define quantum expanders in a natural way. We give two constructions of quantum expanders, both based on classical expander constructions. The first construction is algebraic,...
88
Voted
TIT
2002
15 years 7 days ago
2002
We extend a low-rate improvement of the random coding bound on the reliability of a classical discrete memoryless channel (DMC) to its quantum counterpart. The key observation that...