587 search results - page 91 / 118 » Quantum computation and quantum information |
CORR
2010
Springer
13 years 10 months ago
2010
Springer
In a sampling problem, we are given an input x {0, 1} n , and asked to sample approximately from a probability distribution Dx over poly (n)-bit strings. In a search problem, we ...
TCC
2009
Springer
14 years 10 months ago
2009
Springer
It is well known that general secure function evaluation (SFE) with information-theoretical (IT) security is infeasible in presence of a corrupted majority in the standard model. ...
LCPC
2004
Springer
14 years 3 months ago
2004
Springer
Abstract. Empirical optimizers like ATLAS have been very effective in optimizing computational kernels in libraries. The best choice of parameters such as tile size and degree of l...
IPL
2000
13 years 9 months ago
2000
We give a short and simple proof of Hales and Hallgren's Fourier Sampling Theorem ["Quantum Fourier Sampling Simplified", Proceedings of the Thirty-First Annual ACM...
TCS
2002
13 years 9 months ago
2002
We discuss several complexity measures for Boolean functions: certi cate complexity, sensitivity, block sensitivity, and the degree of a representing or approximating polynomial. ...