Ran Raz  Home/Search
Context Related
| rutgers.edu/~dieter/Semina...razqcc.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: rutgers.edu/~dieter/Semin...index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Communication complexity has become a central complexity model. In that model, we count the amount of communication bits needed between two parties in order to solve certain computational problems. We show that for certain communication complexity problems quantum communication protocols are exponentially faster than classical ones. More explicitly, we give an example for a communication complexity relation (or promise problem) P such that: 1. The quantum communication complexity of P is... (Update)
Cited by: More
A Study Of Entanglement In Quantum Information Theory - Verstraete (2002) (Correct)
Interaction in Quantum Communication and the.. - Klauck, Nayak.. (2003) (Correct)
On the Power of Quantum Proofs - Raz, Shpilka (Correct)
Active bibliography (related documents): More All
0.3: Quantum Computation - Aharonov (1998) (Correct)
0.2: Quantum vs. Classical Communication and Computation - Harry Buhrman Cwi (Correct)
0.2: Quantum Communication and Complexity - de Wolf (2000) (Correct)
Similar documents based on text: More All
0.6: On quantum and probabilistic communication: Las Vegas and one-way .. - Klauck (2000) (Correct)
0.3: On Rounds in Quantum Communication - Klauck (2000) (Correct)
0.3: Quantum Communication Complexity of Symmetric Predicates - Razborov (2002) (Correct)
Related documents from co-citation: More All
20: Cambridge university Press (context) - Kushilevitz, Nisan - 1996
15: Quantum Entanglement and the Communication Complexity of the Inner Product Funct.. - Cleve, van Dam et al. - 1998
14: Quantum circuit complexity - Yao - 1993
BibTeX entry: (Update)
R. Raz. Exponential separation of quantum and classical communication complexity. In Proceedings of 31th STOC, 1999. To appear. http://citeseer.ist.psu.edu/raz99exponential.html More
@inproceedings{ raz99exponential,
author = "Ran Raz",
title = "Exponential separation of quantum and classical communication complexity",
pages = "358--367",
year = "1999",
url = "citeseer.ist.psu.edu/raz99exponential.html" }
Citations (may not include all citations):957 The Probabilistic Method (context) - Alon, Spencer - 1992
197 Cambridge University Press (context) - Kushilevitz, Nisan et al. - 1997
166 Some complexity questions related to distributive computing (context) - Yao - 1979
85 Quantum circuit complexity - Yao - 1993
55 Teleporting an unknown quantum state via dual classical and .. - Bennett, Brassard et al. - 1993
49 Asymptotic Theory of Finite Dimensional Normed Spaces (context) - Milman, Schechtman - 1986
25 Bounds for the quantity of information transmitted by a quan.. (context) - Holevo - 1973
22 The quantum communication complexity of sampling - Ambainis, Schulman et al. - 1998
11 Computer Science Department (context) - Kremer, Communication et al. - 1995
11 Experimental quantum teleportation (context) - Bouwmeester, Pan et al. - 1997
7 Private vs. common random bits in communication complexity - Newman - 1991
5 Quantum cryptography (context) - Hughes, Alde et al. - 1995
3 Dense coding in experimental quantum communication (context) - Mattle, Weinfurter et al. - 1996
1 Lecture notes on quantum information and quantum computation (context) - Preskill
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://dimacs.rutgers.edu/~dieter/Seminar/index.html): More
Pseudorandom generators without the XOR Lemma - Sudan, Trevisan, Vadhan (1999) (Correct)
Pairwise Independence and Derandomization - Luby, Wigderson (1995) (Correct)
Parallelization, Amplification, and Exponential Time.. - Kitaev, Watrous (2000) (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