Ashwin Nayak, Amnon Ta-Shma  Home/Search
Context Related
| caltech.edu/~nayak/papers/rounds.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: caltech.edu/~nayak/publ (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 exponentially fewer qubits than possible classically [2, 22]. Moreover, these methods have a very simple structure---they involve only few message exchanges between the communicating parties. We consider the question as to whether every classical protocol... (Update)
Cited by: More
Interaction in Quantum Communication and the.. - Klauck, Nayak.. (2001) (Correct)
Similar documents (at the sentence level):
23.8%: Interaction in Quantum Communication - Klauck, Nayak, Ta-Shma, Zuckerman (Correct)
Active bibliography (related documents): More All
0.5: Quantum Communication and Complexity - de Wolf (2000) (Correct)
0.3: On Rounds in Quantum Communication - Klauck (2000) (Correct)
0.3: On Communication Over an Entanglement-Assisted Quantum Channel - Nayak, Salzman (2002) (Correct)
Similar documents based on text: More All
0.5: The Quantum Communication Complexity of Sampling - Ambainis, Schulman, Ta-Shma, .. (1998) (Correct)
0.5: Exponential Separation of Quantum and Classical Communication.. - Raz (1999) (Correct)
0.4: Dense Quantum Coding and a Lower Bound for 1-way.. - Ambainis, Nayak.. (1999) (Correct)
Related documents from co-citation: More All
2: Cambridge university Press (context) - Kushilevitz, Nisan - 1996
2: Communication complexity lower bounds by polynomials - Buhrman, de Wolf - 1999
2: On quantum and probabilistic communication: Las Vegas and oneway protocols - Klauck - 2000
BibTeX entry: (Update)
A. Nayak, A. Ta-Shma, and D. Zuckerman. Interaction in quantum communication and the complexity of set disjointness. Technical report TR 2000-36, DIMACS Center, Rutgers University. Earlier version quant-ph/0005106, 2000. http://citeseer.ist.psu.edu/nayak00interaction.html More
@misc{ nayak00interaction,
author = "A. Nayak and A. Ta-Shma and D. Zuckerman",
title = "Interaction in quantum communication and the complexity of set disjointness",
text = "A. Nayak, A. Ta-Shma, and D. Zuckerman. Interaction in quantum communication
and the complexity of set disjointness. Technical report TR 2000-36, DIMACS
Center, Rutgers University. Earlier version quant-ph/0005106, 2000.",
year = "2000",
url = "citeseer.ist.psu.edu/nayak00interaction.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 - 1997
173 Quantum complexity theory - Bernstein, Vazirani - 1997
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
29 Lower bounds on communication complexity (context) - Duris, Galil et al. - 1987
29 classical communication and computation (context) - Buhrman, Cleve et al. - 1998
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
25 Bounds for the quantity of information transmitted by a quan.. (context) - Holevo
22 The quantum communication complexity of sampling - Ambainis, Schulman et al. - 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 - 1999
17 Cryptographic distinguishability measures for quantum-mechan.. (context) - Fuchs, Graaf - 1999
14 On data structures and asymmetric communication complexity (context) - Miltersen, Nisan et al. - 1995
12 On quantum and probabilistic communication: Las vegas and on.. - Klauck - 2000
10 transition probability (context) - Uhlmann - 1976
4 On rounds in quantum communication - Klauck - 2000
4 The communication complexity of pointer chasing (context) - Ponzio, Radhakrishnan et al. - 1999
1 Papadimitriou and Michael Sipser (context) - Christos - 1982
http://www.theory.caltech.edu/people/preskill/ph229/
Documents on the same site (http://www.cs.caltech.edu/~nayak/publ.html): More
Interaction in Quantum Communication and the.. - Klauck, Nayak.. (2001) (Correct)
Optimal Lower Bounds for Quantum Automata and Random Access Codes - Nayak (1999) (Correct)
Quantum Walk on the Line (Extended Abstract) - Nayak, al. (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