508 search results - page 69 / 102 » Quantum Computers |
TCS
2002
14 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. ...
LOGCOM
2010
14 years 8 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...
PARA
1994
Springer
15 years 1 months ago
1994
Springer
A model describing the full quantum mechanical three body problem of the hydrogen molecular ion is presented, and some of the numerical results are subsequently discussed. The ove...
102
click to vote
JCSS
2008
14 years 9 months ago
2008
Given a Boolean function f, we study two natural generalizations of the certificate complexity C (f): the randomized certificate complexity RC (f) and the quantum certificate comp...
FOCS
2000
IEEE
15 years 2 months ago
2000
IEEE
We give new bounds on the circuit complexity of the quantum Fourier transform (QFT). We give an upper bound of Ç´ÐÓ Ò · ÐÓ ÐÓ ´½ µµ on the circuit depth for computin...