11547 search results - page 91 / 2310 » Quantum computing and communication |
133
click to vote
JCC
2008
15 years 4 months ago
2008
: Quantum Monte Carlo (QMC) calculations require the generation of random electronic configurations with respect to a desired probability density, usually the square of the magnitu...
130
click to vote
IPL
2000
15 years 3 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...
134
Voted
TCS
2002
15 years 3 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. ...
105
Voted
LOGCOM
2010
15 years 2 months ago
2010
The algebraic theory of quasi-MV algebras, generalisations of MV algebras arising in quantum computation, is by now rather well-developed. Although it is possible to define sever...
