249 search results - page 8 / 50 » One Complexity Theorist's View of Quantum Computing |
90
Voted
STOC
2006
ACM
15 years 3 months ago
2006
ACM
It has been known for some time that graph isomorphism reduces to the hidden subgroup problem (HSP). What is more, most exponential speedups in quantum computation are obtained by...
105
Voted
EUROCRYPT
2011
Springer
14 years 27 days ago
2011
Springer
We define the BQS-UC model, a variant of the UC model, that deals with protocols in the bounded quantum storage model. We present a statistically secure commitment protocol in th...
STOC
2002
ACM
15 years 9 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...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
A Direct Sum Theorem holds in a model of computation, when for every problem solving some k input instances together is k times as expensive as solving one. We show that Direct Su...
NIPS
2004
14 years 10 months ago
2004
An auditory "scene", composed of overlapping acoustic sources, can be viewed as a complex object whose constituent parts are the individual sources. Pitch is known to be...