Hartmut Klauck, Ashwin Nayak, Amnon Ta-Shma, David Zuckerman  Home/Search
Context
Related
| pages.cpsc.ucalgary.ca/~klauc...ieee.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: pages.cpsc.ucalgary.ca/~klauck... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In some scenarios there are ways of conveying information with much fewer, even exponentially fewer, qubits than possible classically [1], [2], [3]. Moreover, some of these methods have a very simple structure--- they involve only few message exchanges between the communicating parties. It is therefore natural to ask whether every classical protocol may be transformed to a "simpler" quantum protocol---one that has similar e#ciency, but uses fewer message exchanges. (Update)
Similar documents (at the sentence level):
41.4%: Interaction in Quantum Communication and the.. - Klauck, Nayak.. (2001) (Correct)
5.0%: On Rounds in Quantum Communication - Klauck (2000) (Correct)
Active bibliography (related documents): More All
0.5: The Quantum Communication Complexity of Sampling - Ambainis, Schulman, Ta-Shma, .. (1998) (Correct)
0.5: Exponential Lower Bound for 2-Query Locally Decodable Codes .. - Kerenidis, de Wolf (2002) (Correct)
0.5: Exponential Lower Bound for 2-Query Locally Decodable Codes .. - Kerenidis, de Wolf (2003) (Correct)
Similar documents based on text: More All
0.4: Quantum and Classical Strong Direct Product Theorems and.. - Klauck, Spalek, de Wolf (2004) (Correct)
0.3: Quantum and Classical Communication-Space Tradeoffs from.. - Klauck (Correct)
0.3: Extractors from Reed-Muller Codes - Ta-Shma, Zuckerman, Safra (Correct)
BibTeX entry: (Update)
@misc{ klauck-interaction,
author = "Hartmut Klauck and Ashwin Nayak and Amnon Ta-Shma and David Zuckerman",
title = "Interaction in Quantum Communication",
url = "citeseer.ist.psu.edu/632228.html" }
Citations (may not include all citations):202 Wiley Series in Telecommunications (context) - Cover, Thomas et al. - 1991
197 Cambridge University Press (context) - Kushilevitz, Nisan et al. - 1997
167 Quantum Computation and Quantum Information (context) - Nielsen, Chuang - 2000
85 Quantum circuit complexity - Yao - 1993
44 Communication complexity (context) - Papadimitriou, Sipser - 1982
42 On data structures and asymmetric communication complexity - Miltersen, Nisan et al. - 1995
41 Unconditionally secure quantum bit commitment is impossible (context) - Mayers - 1997
41 Rounds in communication complexity revisited - Nisan, Wigderson - 1993
36 Quantum entanglement and the communication complexity of the.. - Cleve, van Dam et al. - 1998
34 Communication via one- and two-particle operators on einstei.. (context) - Bennett, Wiesner - 1992
29 Lower bounds on communication complexity (context) - Duris, Galil et al. - 1987
28 Exponential separation of quantum and classical communicatio.. - Raz - 1999
25 Why quantum bit commitment and ideal quantum coin tossing ar.. (context) - Lo, Chau - 1998
22 Optimal lower bounds for quantum automata and random access .. - Nayak - 1999
20 Fidelity for mixed quantum states (context) - Jozsa - 1994
19 Communication complexity lower bounds by polynomials - Buhrman, de Wolf - 2001
17 Cryptographic distinguishability measures for quantum-mechan.. (context) - Fuchs, Graaf - 1999
12 On quantum and probabilistic communication: Las vegas and on.. - Klauck - 2000
12 Lower bounds for computation with limited nondeterminism (context) - Klauck - 1998
10 Interaction in quantum communication and the complexity of s.. - Klauck, Nayak et al. - 2001
7 Quantum vs. classical communication and computation - Buhrman, Cleve et al. - 1998
6 A new protocol and lower bounds for quantum coin flipping - Ambainis, Schulman et al. - 1998
6 Quantum communication complexity of symmetric predicates - Razborov
5 Lecture notes (context) - Preskill - 1998
4 transition probability' in the state space of a #-algebra (context) - Uhlmann - 1976
4 Quantum search of spatial regions (context) - Aaronson, Ambainis - 2003
3 Lower bounds in the quantum cell probe model (context) - Venkatesh, Sen - 2001
3 The communication complexity of pointer chasing, application.. (context) - Ponzio, Radhakrishnan et al. - 1999
2 Parallelization, amplification, and exponential time simulat.. - Kitaev, Watrous - 2000
1 The quantum communication complexity of the pointer chasing .. (context) - Jain, Radhakrishnan et al. - 2002
1 An optimal randomised cell probe lower bound for approximate.. - Chakrabarti, Regev - 2003
1 Vitesse de convergence pour certains problemes statistiques (context) - Dacunha-Castelle
1 Quantum and approximate privacy - Klauck - 2004
1 A lower bound for bounded round quantum communication comple.. (context) - Jain, Radhakrishnan et al. - 2003
1 Privacy and interaction in quantum communication complexity .. (context) - Jain, Radhakrishnan et al. - 2002
Documents on the same site (http://pages.cpsc.ucalgary.ca/~klauckh/): More
Quantum and Classical Strong Direct Product Theorems and.. - Klauck, Spalek, de Wolf (2004) (Correct)
One-Way Communication Complexity And The Neciporuk Lower Bound on .. - Klauck (Correct)
Quantum and Classical Communication-Space Tradeoffs from.. - 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