Hartmut Klauck  Home/Search
Context Related
| ias.edu/~klauck/0004100.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: ias.edu/~klauck/ (more) Homepages: H.Klauck |
Rate this article:      (best)Comment on this article |
Abstract: We investigate the power of interaction in two player quantum communication protocols. Our main result is a rounds-communication hierarchy for the pointer jumping function f k . We show that f k needs quantum communication n) if Bob starts the communication and the number of rounds is limited to k (for any constant k). Trivially, if Alice starts, O(k log n) communication in k rounds suces. The lower bound employs a result relating the relative von Neumann entropy between density matrices to... (Update)
Context of citations to this paper: More
...the required communication exponentially. An analogous result has recently been shown for quantum communication [41] see also [36]) ffl Non deterministic communication complexity. A non deterministic protocol has positive acceptance probability on input (x; y) iff f(x;...
...the theorem for 2 2 density matrices, and omit the necessary computations for the 2 2 case from this extended abstract. For details see [15]. All eigenvalues of are real, since the matrix is is Hermitian. Let S be the multiset of all nonnegative eigenvalues of and R...
Cited by: More
Interaction in Quantum Communication and the Complexity of.. - Nayak, Ta-Shma (2000) (Correct)
Quantum Communication and Complexity - de Wolf (2000) (Correct)
Similar documents (at the sentence level):
7.0%: Interaction in Quantum Communication - Klauck, Nayak, Ta-Shma, Zuckerman (Correct)
Active bibliography (related documents): More All
3.0: On quantum and probabilistic communication: Las Vegas and one-way .. - Klauck (2000) (Correct)
1.3: One-Way Communication Complexity And The Neciporuk Lower Bound on .. - Klauck (Correct)
0.5: On the Power of Quantum Proofs - Raz, Shpilka (Correct)
Similar documents based on text: More All
0.3: Rectangle Size Bounds and Threshold Covers in Communication.. - Klauck (2003) (Correct)
0.3: Exponential Separation of Quantum and Classical Communication.. - Raz (1999) (Correct)
0.3: On Quantum and Approximate Privacy - Klauck (2003) (Correct)
Related documents from co-citation: More All
4: Exponential separation of quantum and classical communication complexity - Raz - 1999
4: On quantum and probabilistic communication: Las Vegas and oneway protocols - Klauck - 2000
4: Communication complexity lower bounds by polynomials - Buhrman, de Wolf - 1999
BibTeX entry: (Update)
H. Klauck. On rounds in quantum communication. quant-ph/0004100, 26 Apr 2000. http://citeseer.ist.psu.edu/klauck00rounds.html More
@misc{ klauck00rounds,
author = "H. Klauck",
title = "On rounds in quantum communication",
text = "H. Klauck. On rounds in quantum communication. quant-ph/0004100, 26 Apr
2000.",
year = "2000",
url = "citeseer.ist.psu.edu/klauck00rounds.html" }
Citations (may not include all citations):210 A fast quantum mechanical algorithm for database search - Grover - 1996
167 Quantum Computation and Quantum Information (context) - Nielsen, Chuang - 2000
163 Principles and Practice of Information Theory (context) - Blahut - 1987
118 A Parallel Repetition Theorem - Raz - 1998
68 Communication Complexity (context) - Kushilevitz, Nisan - 1997
57 The Probabilistic Communication Complexity of Set Intersecti.. (context) - Kalyanasundaram, Schnitger - 1992
41 Unconditionally secure quantum bit commitment is impossible (context) - Mayers - 1997
41 Rounds in communication complexity revisited - Nisan, Wigderson - 1993
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. - 1997
34 Communication via one- and two-particle operators on Einstei.. (context) - Bennett, Wiesner - 1992
32 Foundations of Computer Science (context) - Yao, Complexity et al. - 1993
29 Lower Bounds on Communication Complexity (context) - Duris, Galil et al. - 1987
28 Exponential Separation of Quantum and Classical Communicatio.. - Raz - 1999
28 Substituting quantum entanglement for communication (context) - Cleve, Buhrman - 1997
25 Why quantum bit commitment and ideal quantum coin tossing ar.. (context) - Lo, Chau - 1998
19 Communication complexity lower bounds by polynomials - Buhrman, de Wolf - 2001
12 Lower bounds for computation with limited nondeterminism (context) - Klauck - 1998
12 On quantum and probabilistic communication: Las Vegas and on.. - Klauck - 2000
10 Interaction in Quantum Communication and the Complexity of S.. - Klauck, Nayak et al. - 2001
8 Quantum Communication - Kremer - 1995
4 Interaction in Quantum Communication Complexity (context) - Nayak, Ta-Shma et al. - 2000
3 Reducing error probability in quantum algorithms (context) - Buhrman, Cleve et al. - 1999
3 th ACM Symp (context) - Buhrman, Cleve et al. - 1998
3 Classical versus Quantum Communication Complexity (context) - Ta-Shma - 1999
2 Workshop on Boolean Functions and Applications at the 27th I.. (context) - Klauck, Complexity - 2000
2 th ACM Symp (context) - Ponzio, Radhakrishnan et al. - 1999
2 Quantum information theory of entanglement and measurement (context) - Cerf, Adami - 1996
2 erent Modes of Communication (context) - Halstenberg, Reischuk - 1993
www.theory.caltech.edu/people/preskill/ph229
Documents on the same site (http://www.math.ias.edu/~klauck/):
Quantum Time-Space Tradeoffs for Sorting - Klauck (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