515 search results - page 79 / 103 » Classically-controlled Quantum Computation |
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. ...
LOGCOM
2010
13 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...
IROS
2008
IEEE
14 years 4 months ago
2008
IEEE
— This paper is concerned with the use of a spherical projection model to design optimal visual features for visual servoing. Here two special targets are considered: a sphere ma...
IPL
2010
13 years 8 months ago
2010
Control dependence forms the basis for many program analyses, such as program slicing. Recent work on control dependence analysis has led to new definitions of dependence that cat...