Hartmut Klauck, Ashwin Nayak, Amnon Ta-Shma, David Zuckerman  Home/Search
Context Related
| cs.tau.ac.il/~amno....submitted.siam.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: cs.tau.ac.il/~amnon/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: One of the most intriguing facts about communication using quantum states is that these states cannot be used to transmit more classical bits than the number of qubits used, yet 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. We consider the question as to... (Update)
Cited by: More
Exponential Lower Bound for 2-Query Locally Decodable Codes .. - Kerenidis, de Wolf (2002) (Correct)
On Quantum and Approximate Privacy - Klauck (2003) (Correct)
One-Way Communication Complexity And The Neciporuk Lower Bound on .. - Klauck (Correct)
Similar documents (at the sentence level):
45.9%: Interaction in Quantum Communication - Klauck, Nayak, Ta-Shma, Zuckerman (Correct)
14.5%: Interaction in Quantum Communication and the Complexity of.. - Nayak, Ta-Shma (2000) (Correct)
5.3%: On Rounds in Quantum Communication - Klauck (2000) (Correct)
Active bibliography (related documents): More All
0.3: Information Theory Methods in Communication Complexity - Bar-Yossef, Jayram.. (Correct)
0.3: On quantum and probabilistic communication: Las Vegas and one-way .. - Klauck (2000) (Correct)
0.3: Towards a Formal Definition of Security for Quantum Protocols - Graaf (1997) (Correct)
Related documents from co-citation: More All
8: Quantum Entanglement and the Communication Complexity of the Inner Product Funct.. - Cleve, van Dam et al. - 1998
7: Quantum Computation and Quantum Information (context) - Nielsen, Huang - 2000
6: Communication complexity lower bounds by polynomials - Buhrman, de Wolf - 1999
BibTeX entry: (Update)
H. Klauck, A. Nayak, A. Ta-Shma, and D. Zuckerman, Interaction in quantum communication and the complexity of set disjointness, in Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, 2001, to appear. http://citeseer.ist.psu.edu/klauck03interaction.html More
@inproceedings{ klauck01interaction,
author = "Hartmut Klauck and Ashwin Nayak and Amnon Ta-Shma and David Zuckerman",
title = "Interaction in quantum communication and the complexity of set disjointness",
booktitle = "{ACM} Symposium on Theory of Computing",
pages = "124-133",
year = "2001",
url = "citeseer.ist.psu.edu/klauck03interaction.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
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
37 Quantum circuits with mixed states - Aharonov, Kitaev et al. - 1998
36 Quantum entanglement and the communication complexity of the.. - van Dam, Tapp - 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
7 Quantum vs. classical communication and computation - Buhrman, Cleve et al. - 1998
6 A new protocol and lower bounds for quantum coin flipping - Ambainis - 2001
6 A new protocol and lower bounds for quantum coin flipping - Ambainis, Schulman et al. - 1998
5 Lecture notes (context) - Preskill - 1998
4 transition probability' in the state space of a #-algebra (context) - Uhlmann - 1976
3 The communication complexity of pointer chasing, application.. (context) - Ponzio, Radhakrishnan et al. - 1999
2 Parallelization, amplification, and exponential time simulat.. - Kitaev, Watrous - 2000
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.tau.ac.il/~amnon/): More
Uniform hardness versus randomness tradeoffs for.. - Gutfreund, Shaltiel.. (2003) (Correct)
The Hidden Subgroup Problem And Quantum Computation.. - Hallgren, Russell.. (2003) (Correct)
Extractor Codes - Ta-Shma, Zuckerman (2001) (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