Sciweavers

939 search results - page 8 / 188
» Semantic Abstraction and Quantum Computation
Sort
View
73
Voted
ICALP
2005
Springer
15 years 3 months ago
All Quantum Adversary Methods Are Equivalent
Abstract: The quantum adversary method is one of the most versatile lower-bound methods for quantum algorithms. We show that all known variants of this method are equivalent: spect...
Robert Spalek, Mario Szegedy
74
Voted
ENTCS
2008
80views more  ENTCS 2008»
14 years 9 months ago
Idempotents in Dagger Categories: (Extended Abstract)
d abstract) Peter Selinger1 Department of Mathematics and Statistics Dalhousie University, Halifax, Nova Scotia, Canada Dagger compact closed categories were studied by Abramsky a...
Peter Selinger
STOC
2007
ACM
101views Algorithms» more  STOC 2007»
15 years 10 months ago
Toward a general theory of quantum games
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...
Gus Gutoski, John Watrous
COMPUTER
2002
79views more  COMPUTER 2002»
14 years 9 months ago
A Practical Architecture for Reliable Quantum Computers
wever, by using a simple model of abstract building blocks: quantum bits, gates, and algorithms, and the available implementation technologies--in all their imperfections.7 The bas...
Mark Oskin, Frederic T. Chong, Isaac L. Chuang
STACS
2005
Springer
15 years 3 months ago
Exact Quantum Algorithms for the Leader Election Problem
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...
Seiichiro Tani, Hirotada Kobayashi, Keiji Matsumot...