Quantum and Classical Strong Direct Product Theorems and Optimal Time-Space Tradeoffs (2004)
Cached
Download Links
- [pages.cpsc.ucalgary.ca]
- [homepages.cwi.nl]
- [www.ucw.cz]
- DBLP
Other Repositories/Bibliography
| Venue: | SIAM Journal on Computing |
| Citations: | 36 - 5 self |
BibTeX
@INPROCEEDINGS{Klauck04quantumand,
author = {Hartmut Klauck and Robert Spalek and Ronald De Wolf},
title = {Quantum and Classical Strong Direct Product Theorems and Optimal Time-Space Tradeoffs},
booktitle = {SIAM Journal on Computing},
year = {2004},
pages = {12--21}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
A strong direct product theorem says that if we want to compute k independent instances of a function, using less than k times the resources needed for one instance, then our overall success probability will be exponentially small in k. We establish such theorems for the classical as well as quantum query complexity of the OR function. This implies slightly weaker direct product results for all total functions. We prove a similar result for quantum communication protocols computing k instances of the Disjointness function. Our direct product theorems...
