508 search results - page 78 / 102 » Poly-locality in quantum computing |
COCO
2009
Springer
14 years 2 months ago
2009
Springer
—Consider the following Simultaneous Message Passing (SMP) model for computing a relation f ⊆ X ×Y ×Z. In this model Alice, on input x ∈ X and Bob, on input y ∈ Y, send o...
IPL
2000
13 years 7 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 7 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. ...
LOGCOM
2010
13 years 6 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...
DNA
2004
Springer
14 years 28 days ago
2004
Springer
Abstract. Speed of computation and power consumption are the two main parameters of conventional computing devices implemented in microelectronic circuits. As performance of such d...