STACS   2000 Annual Symposium on Theoretical Aspects of Computer Science
Wall of Fame | Most Viewed STACS-2000 Paper
10 years 6 months ago
Average-Case Quantum Query Complexity
Abstract. We compare classical and quantum query complexities of total Boolean functions. It is known that for worst-case complexity, the gap between quantum and classical can be a...
Andris Ambainis, Ronald de Wolf
Disclaimer and Copyright Notice
Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.
1Download preprint from source139
2Download preprint from source109
3Download preprint from source101
4Download preprint from source101
5Download preprint from source97
6Download preprint from source95
7Download preprint from source94
8Download preprint from source94
9Download preprint from source90
10Download preprint from source85
11Download preprint from source81
12Download preprint from source79
13Download preprint from source76
14Download preprint from source75