Amnon Ta-Shma  Home/Search
Context Related
| berkeley.edu/~amno...vs_classical_cc.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: berkeley.edu/~amnon/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Classical Communication complexity has been intensively studied since its conception two decades ago. Recently, its quantum analogue, the quantum communication complexity model, was defined and studied. In this paper we present some of the main results in the area. 1 Introduction The two party communication complexity model, as introduced by Yao [Yao79], consists of two all-powerful players who have private inputs and wish to compute a known function that depends on both inputs. The players ... (Update)
Context of citations to this paper: More
...proofs of some of the central results and references to others. Some other recent surveys of quantum communication complexity are [48,15,35], and a more popular account can be found in [47] Our survey differs from these in being a bit more extensive and up to date. 2...
Cited by: More
Quantum Communication and Complexity - de Wolf (2000) (Correct)
Active bibliography (related documents): More All
0.5: The Quantum Communication Complexity of Sampling - Ambainis, Schulman, Ta-Shma, .. (1998) (Correct)
0.5: Towards Proving Strong Direct Product Theorems - Shaltiel (2001) (Correct)
0.2: Quantum Entanglement and Communication Complexity - Buhrman, Cleve, Van Dam (1998) (Correct)
Similar documents based on text: More All
0.5: Some More Quantum Communication Complexity - Quantum Computing Course (Correct)
0.4: SIGACT News Complexity Theory Column 19 - Lane Hemaspaandra Dept (Correct)
0.4: SIGACT News Complexity Theory Column 38 - Lane Hemaspaandra Dept (Correct)
BibTeX entry: (Update)
A. Ta-Shma. Classical versus quantum communication complexity. ACM SIGACT News (Complexity Column 23), pages 25--34, 1999. http://citeseer.ist.psu.edu/ta-shma99classical.html More
@article{ tashma99classical,
author = "Ta-Shma",
title = "Classical versus Quantum Communication Complexity",
journal = "SIGACTN: SIGACT News (ACM Special Interest Group on Automata and Computability Theory)",
volume = "30",
year = "1999",
url = "citeseer.ist.psu.edu/ta-shma99classical.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
126 Rapid solution of problems by quantum computation (context) - Jozsa - 1992
120 Unbiased bits from sources of weak randomness and probabilis.. - Chor, Goldreich - 1988
102 Strengths and weaknesses of quantum computing - Bennett, Bernstein et al. - 1997
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
58 Lower bounds by probabilistic arguments (context) - Yao - 1983
54 Las Vegas is better than determinism in VLSI and distributed.. (context) - Mehlhorn, Schmidt - 1982
50 the distributional complexity of disjointness (context) - Razborov - 1992
49 Quantum lower bounds by polynomials - Buhrman, Mosca - 1998
36 Quantum entanglement and the communication complexity of the.. - Cleve, van Dam et al. - 1998
28 Exponential separation of quantum and classical communicatio.. - Raz - 1999
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 - Schulman, Vazirani - 1998
22 Towards a strong communication complexity theory or generati.. (context) - Vazirani - 1985
10 Some complexity questions related to distributive computing (context) - Yao - 1979
10 conjecture in communication complexity (context) - Spieker, log - 1995
8 The Hebrew University of Jerusalem (context) - Kremer, Master's - 1995
6 classical communication and computation (context) - Buhrman, Cleve et al. - 1998
2 The probabilistic communication complexity of set intersecti.. (context) - Kalyanasundaram, Schnitger - 1987
Documents on the same site (http://www.icsi.berkeley.edu/~amnon/): More
A note on PCP vs. MIP - Amnon Ta-Shma (1995) (Correct)
Blind, Auditable Membership Proofs - Sander, Ta-Shma, Yung (1999) (Correct)
The Quantum Communication Complexity of Sampling - Ambainis, Schulman, Ta-Shma, .. (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