Sciweavers

508 search results - page 52 / 102
» Poly-locality in quantum computing
Sort
View
PODC
1999
ACM
14 years 1 months ago
Wait-Free Synchronization in Multiprogrammed Systems: Integrating Priority-Based and Quantum-Based Scheduling
d Abstract) James H. Anderson Department of Computer Science University of North Carolina at Chapel Hill Mark Moiry Department of Computer Science University of Pittsburgh We cons...
James H. Anderson, Mark Moir
PPL
2010
97views more  PPL 2010»
13 years 7 months ago
On the Importance of Being Quantum
Game playing is commonly cited in debates concerning human versus machine intelligence, and Chess is often at the center of such debates. However, the role of Chess in delineating...
Selim G. Akl
STOC
2002
ACM
107views Algorithms» more  STOC 2002»
14 years 9 months ago
Quantum lower bound for the collision problem
The collision problem is to decide whether a function X : {1, . . . , n} {1, . . . , n} is one-to-one or two-to-one, given that one of these is the case. We show a lower bound of...
Scott Aaronson
ISMVL
2008
IEEE
148views Hardware» more  ISMVL 2008»
14 years 3 months ago
Quantum Logic Implementation of Unary Arithmetic Operations
The mathematical property of inheritance for certain unary fixed point operations has recently been exploited to enable the efficient formulation of arithmetic algorithms and circ...
Mitchell A. Thornton, David W. Matula, Laura Spenn...
FCT
2007
Springer
14 years 2 months ago
The Quantum Query Complexity of Algebraic Properties
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 ...
Sebastian Dörn, Thomas Thierauf