Ronald de Wolf  Home/Search
Context Related
| cwi.nl/~rdewolf/publ/...qccsurvey.ps.gz 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: cwi.nl/~rdewolf/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In the setting of communication complexity, two distributed parties want to compute a function depending on both their inputs, using as little communication as possible. The required communication can sometimes be significantly lowered if we allow the parties the use of quantum communication. We survey the main results of the young area of quantum communication complexity: its relation to teleportation and dense coding, the main examples of fast quantum communication protocols, lower bounds,... (Update)
Cited by: More
On the Power of Quantum Proofs - Raz, Shpilka (Correct)
Active bibliography (related documents): More All
1.2: Quantum and Classical Strong Direct Product Theorems and.. - Klauck, Spalek, de Wolf (2004) (Correct)
0.7: Communication Complexity Lower Bounds by Polynomials - Buhrman, de Wolf (1999) (Correct)
0.7: Quantum Entanglement and Communication Complexity - Buhrman, Cleve, Van Dam (1998) (Correct)
Similar documents based on text: More All
0.7: Some More Quantum Communication Complexity - Quantum Computing Course (Correct)
0.1: Teleportation as a Quantum Computation - Brassard, Braunstein, Cleve (1998) (Correct)
0.0: All Teleportation and Dense Coding Schemes - Werner (2000) (Correct)
BibTeX entry: (Update)
R. de Wolf. Quantum communication and complexity. TCS, 287(1):337-353, 2002. http://citeseer.ist.psu.edu/dewolf00quantum.html More
@misc{ wolf02quantum,
author = "R. de Wolf",
title = "Quantum communication and complexity",
text = "R. de Wolf. Quantum communication and complexity. TCS, 287(1):337-353,
2002.",
year = "2002",
url = "citeseer.ist.psu.edu/dewolf00quantum.html" }
Citations (may not include all citations):210 A fast quantum mechanical algorithm for database search - Grover - 1996
197 Cambridge University Press (context) - Kushilevitz, Nisan - 1997
173 Quantum complexity theory - Bernstein, Vazirani - 1997
167 Quantum Computation and Quantum Information (context) - Nielsen, Chuang - 2000
166 Some complexity questions related to distributive computing (context) - C-C - 1979
152 Probabilistic computations: Toward a unified measure of comp.. (context) - C-C - 1977
126 Rapid solution of problems by quantum computation (context) - Deutsch, Jozsa - 1992
124 Elementary gates for quantum computation - Barenco, Bennett et al. - 1995
102 Strengths and weaknesses of quantum computing - Bennett, Bernstein et al. - 1997
85 Quantum circuit complexity - C-C - 1993
73 Tight bounds on quantum searching - Boyer, Brassard et al. - 1998
70 Quantum computational networks (context) - Deutsch - 1989
66 Complexity classes in communication complexity theory (context) - Babai, Frankl et al. - 1986
59 Can quantummechanical description of physical reality be con.. (context) - Einstein, Podolsky et al. - 1935
57 The probabilistic communication complexity of set intersecti.. (context) - Kalyanasundaram, Schnitger - 1992
55 Teleporting an unknown quantum state via dual classical and .. - Bennett, Brassard et al. - 1993
54 Las Vegas is better than determinism in VLSI and distributed.. (context) - Mehlhorn, Schmidt - 1982
50 the distributional complexity of disjointness (context) - Razborov - 1992
50 Quantum algorithms revisited - Cleve, Ekert et al. - 1998
48 IEEE Transactions on Information Theory (context) - Bennett, Shor et al. - 1998
41 the Einstein-Podolsky-Rosen paradox (context) - Bell - 1965
34 Communication via one- and two-particle operators on Einstei.. (context) - Bennett, Wiesner - 1992
28 Exponential separation of quantum and classical communicatio.. - Raz - 1999
28 Substituting quantum entanglement for communication (context) - Cleve, Buhrman - 1997
25 Bounds for the quantity of information transmitted by a quan.. (context) - Holevo - 1973
25 common random bits in communication complexity (context) - Newman - 1991
22 The quantum communication complexity of sampling - Ambainis, Schulman et al. - 1998
22 Optimal lower bounds for quantum automata and random access .. - Nayak - 1999
21 Grover's quantum searching algorithm is optimal (context) - Zalka - 1999
19 Communication complexity lower bounds by polynomials - Buhrman, de Wolf - 1999
18 Communication Complexity and Parallel Computing (context) - Hromkovic - 1997
16 Bounds for small-error and zero-error quantum algorithms - Buhrman, Cleve et al. - 1999
12 On quantum and probabilistic communication: Las Vegas and on.. - Klauck - 2000
11 Computer Science Department (context) - Kremer, Master's et al. - 1995
10 Quantum entanglement and communication complexity - Buhrman, Cleve et al. - 1997
9 Transactions of the American Mathematical Society (context) - Frankl, Rodl - 1987
7 The cost of exactly simulating quantum entanglement with cla.. - Brassard, Cleve et al. - 1999
6 Quantum Information Theory - Nielsen - 1998
5 Quantum dense coding and a lower bound for 1-way quantum fin.. (context) - Ambainis, Nayak et al. - 1999
4 Interaction in quantum communication complexity (context) - Nayak, Ta-Shma et al. - 2000
4 On rounds in quantum communication - Klauck - 2000
3 and the universal quantum Turing machine (context) - Deutsch, the - 1985
3 Characterization of non-deterministic quantum query and quan.. - de Wolf - 2000
3 Multiparty quantum communication complexity (context) - Buhrman, van Dam et al. - 1999
2 Physicists triumph at Guess my Number (context) - Steane, van Dam - 2000
2 Quantum communication complexity (context) - Klauck - 2000
2 Quantum computing and communication complexity - Buhrman - 2000
1 Security of quantum key distribution (context) - Ben-Or - 1999
1 Quantum entanglement and the communication complexity of the.. (context) - Cleve, van Dam et al. - 1998
1 A single quantum cannot be copied (context) - Wootters, Zurek - 1982
1 Classical versus quantum communication complexity - Ta-Shma - 1999
Documents on the same site (http://www.cwi.nl/~rdewolf/): More
Quantum Computation - Berthiaume (1997) (Correct)
Least Generalizations under Implication - Nienhuys-Cheng, de Wolf (1996) (Correct)
Lower Bounds for Quantum Search and Derandomization - Buhrman, de Wolf (1998) (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