1352 search results - page 201 / 271 » Fault-Tolerant Quantum Computation |
135
Voted
PDP
2010
IEEE
16 years 4 days ago
2010
IEEE
AbstractāAs computing capabilities have increased, the coupling of computational models has become an increasingly viable and therefore important way of improving the physical ļ¬...
140
Voted
STOC
2002
ACM
16 years 5 months ago
2002
ACM
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...
162
click to vote
ISMVL
2008
IEEE
15 years 11 months ago
2008
IEEE
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...
169
Voted
FCT
2007
Springer
15 years 11 months ago
2007
Springer
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 ...
130
click to vote
ICALP
2005
Springer
15 years 10 months ago
2005
Springer
We consider the problem of testing the commutativity of a black-box group speciļ¬ed by its k generators. The complexity (in terms of k) of this problem was ļ¬rst considered by Pa...