Andris Ambainis, Leonard J. Schulman, et al.  Home/Search
Context Related
| cs.tau.ac.il/~amnon/P...ASTVW.focs98.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cs.tau.ac.il/~amnon/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Sampling is an important primitive in probabilistic and quantum algorithms. In the spirit of communication complexity, given a function f : X and a probability distribution over X Y , we define the sampling complexity of (f, as the minimum number of bits Alice and Bob must communicate for Alice to pick x X and Bob to pick y Y as well as a value z s.t. the resulting distribution of (x, y, z) is close to the distribution (D, f(D)). (Update)
Context of citations to this paper: More
.... quantum states, they can solve certain tasks at a significantly smaller communication cost, when compared to classical protocols [6, 1, 18]. This is especially surprising since an early result due to Holevo [10] later explained in simpler terms by Nayak [16] rules out...
Cited by: More
cs.CC/9904019 - Aug Bounds For (Correct)
Multilinear Formulas and Skepticism of Quantum Computing - Aaronson (2004) (Correct)
On Communication Over an Entanglement-Assisted Quantum Channel - Nayak, Salzman (2002) (Correct)
Similar documents (at the sentence level):
36.7%: The Quantum Communication Complexity of Sampling - Ambainis, Schulman, al. (1998) (Correct)
Active bibliography (related documents): More All
0.3: Classical versus Quantum Communication Complexity - Ta-Shma (1999) (Correct)
0.2: Quantum Entanglement and Communication Complexity - Buhrman, Cleve, Van Dam (1998) (Correct)
0.1: Optimal Lower Bounds for Quantum Automata and Random Access Codes - Nayak (1999) (Correct)
Similar documents based on text: More All
0.5: The Quantum Communication Complexity Of Sampling - Ambainis, Schulman, Ta-Shma, .. (2003) (Correct)
0.3: Computing with Highly Mixed States (Extended Abstract) - Ambainis, al (Correct)
0.3: Quantum Walks On Graphs - Aharonov, Ambainis, Kempe, Vazirani (2000) (Correct)
Related documents from co-citation: More All
14: Cambridge university Press (context) - Kushilevitz, Nisan - 1996
12: Exponential separation of quantum and classical communication complexity - Raz - 1999
10: Communication complexity lower bounds by polynomials - Buhrman, de Wolf - 1999
BibTeX entry: (Update)
A. Ambainis, L. Schulman, A. Ta-Shma, and U. Vazirani. The quantum communication complexity of sampling. In Proceedings of 39th FOCS, 1998. http://citeseer.ist.psu.edu/ambainis98quantum.html More
@inproceedings{ ambainis98quantum,
author = "Andris Ambainis and Leonard J. Schulman and Amnon Ta-Shma and Umesh V. Vazirani and Avi Wigderson",
title = "The Quantum Communication Complexity of Sampling",
booktitle = "{IEEE} Symposium on Foundations of Computer Science",
pages = "342-351",
year = "1998",
url = "citeseer.ist.psu.edu/ambainis98quantum.html" }
Citations (may not include all citations):2441 The Johns Hopkins University Press (context) - Golub, Loan - 1996
210 A fast quantum mechanical algorithm for database search - Grover - 1996
197 Cambridge University Press (context) - Nisan, Kushilevitz - 1997
166 Some complexity questions related to distributive computing (context) - Yao
126 Rapid solution of problems by quantum computation (context) - Deutsch, Jozsa - 1992
93 IEEE Transactions on Information theory (context) - Lovasz, shannon et al. - 1979
85 Quantum circuit complexity - Yao - 1993
68 communication complexity (context) - Wigderson, vs - 1995
66 Complexity classes in communication complexity theory (context) - Babai, Frankl et al. - 1986
37 Quantum circuits with mixed states - Aharonov, Kitaev et al. - 1998
36 Quantum entanglement and the communication complexity of the.. - Cleve, van Dam et al. - 1998
29 classical communication and computation (context) - Buhrman, Cleve et al. - 1998
25 common random bits in communication complexity (context) - Newman - 1991
25 Bounds for the quantity of information transmitted by a quan.. (context) - Holevo - 1973
10 conjecture in communication complexity (context) - Spieker, log - 1995
8 The Hebrew University of Jerusalem (context) - Kremer, Master's - 1995
1 Are quantum automata always space e#cient (context) - Ambainis, Nayak et al.
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.tau.ac.il/~amnon/): More
Uniform hardness versus randomness tradeoffs for.. - Gutfreund, Shaltiel.. (2003) (Correct)
The Hidden Subgroup Problem And Quantum Computation.. - Hallgren, Russell.. (2003) (Correct)
Extractor Codes - Ta-Shma, Zuckerman (2001) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC