See this document in CiteSeerX!

Quantum Entanglement and the Communication Complexity of the Inner Product Function (1998)  (Make Corrections)  (36 citations)
Richard Cleve, Wim van Dam, Michael Nielsen, Alain Tapp
Lecture Notes in Computer Science



  Home/Search   Context   Related

 
View or download:
cpsc.ucalgary.ca/~cl...inner_product.ps
cpsc.ucalgary.ca/~...ner_product_qph.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  cpsc.ucalgary.ca/~...publications (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: . We consider the communication complexity of the binary inner product function in a variation of the two-party scenario where the parties have an a priori supply of particles in an entangled quantum state. We prove linear lower bounds for both exact protocols, as well as for protocols that determine the answer with bounded-error probability. Our proofs employ a novel kind of "quantum" reduction from a quantum information theory problem to the problem of computing the inner product. The... (Update)

Cited by:   More
Quantum vs. Classical Communication and Computation - Buhrman, Cleve, Wigderson (1998)   (Correct)
A quantum Goldreich-Levin theorem - With Cryptographic Applications   (Correct)
Interaction in Quantum Communication and the.. - Klauck, Nayak.. (2003)   (Correct)

Similar documents (at the sentence level):
63.0%:   Quantum Entanglement and the Communication Complexity.. - Cleve, van Dam.. (1998)   (Correct)
12.7%:   Quantum Information Theory - Nielsen (1998)   (Correct)

Active bibliography (related documents):   More   All
0.9:   quant-ph/9708019 - Mar Quantum Entanglement   (Correct)
0.2:   A Study Of Entanglement In Quantum Information Theory - Verstraete (2002)   (Correct)
0.2:   On quantum and probabilistic communication: Las Vegas and one-way .. - Klauck (2000)   (Correct)

Similar documents based on text:   More   All
1.0:   Quantum Entanglement and Topological Entanglement - Kauffman, Lomonaco, Jr.   (Correct)
0.8:   The Quantum Entanglement of Bipolar Sequences - Matthew Parker University (2001)   (Correct)
0.6:   Extracting Quantum Entanglement (General Entanglement.. - Ambainis, Smith, Yang (2002)   (Correct)

Related documents from co-citation:   More   All
25:   Quantum circuit complexity - Yao - 1993
21:   A fast quantum mechanical algorithm for database search - Grover - 1996
21:   Cambridge university Press (context) - Kushilevitz, Nisan - 1996

BibTeX entry:   (Update)

R. Cleve, W. van Dam, M. Nielsen, A. Tapp, Quantum Entanglement and the Communication Complexity of the Inner Product Function, (Online preprint quant-ph/970801), QCQC 98, (Feb. 1998). http://citeseer.ist.psu.edu/article/cleve98quantum.html   More

@article{ cleve99quantum,
    author = "Richard Cleve and Wim van Dam and Michael Nielsen and Alain Tapp",
    title = "Quantum Entanglement and the Communication Complexity of the Inner Product Function",
    journal = "Lecture Notes in Computer Science",
    volume = "1509",
    pages = "61--74",
    year = "1999",
    url = "citeseer.ist.psu.edu/article/cleve98quantum.html" }
Citations (may not include all citations):
2319   Elements of Information Theory (context) - Cover, Thomas - 1991
197   Cambridge University Press (context) - Kushilevitz, Nisan et al. - 1997
173   Quantum Complexity Theory - Bernstein, Vazirani - 1997
166   Some complexity questions related to distributed computing (context) - Yao - 1979
102   Strengths and weaknesses of quantum computing - Bennett, Bernstein et al. - 1997
85   Quantum circuit complexity - Yao - 1993
59   Can quantum-mechanical description of physical reality be co.. (context) - Einstein, Podolsky et al. - 1935
55   Teleporting an unknown quantum state via dual classical and .. - Bennett, Brassard et al. - 1993
36   Quantum Entanglement and Communication Complexity - Buhrman, Cleve et al. - 1997
34   Communication via one- and two-particle operators on Einstei.. (context) - Bennett, Wiesner - 1992
28   Substituting quantum entanglement for communication (context) - Cleve, Buhrman - 1997
25   Bounds for the Quantity of Information Transmitted by a Quan.. (context) - Holevo - 1973
8   Quantum Communication - Kremer - 1995
8   Entropy inequalities (context) - Araki, Lieb - 1970
6   Limitation on the amount of accessible information in a quan.. - Schumacher, Westmoreland et al. - 1996
5   Superfast quantum algorithms for coin weighing and binary se.. (context) - Terhal, Smolin - 1997
5   Unbiased bits from weak sources of randomness and probabilis.. (context) - Chor, Goldreich - 1988



The graph only includes citing articles where the year of publication is known.


Documents on the same site (http://www.cpsc.ucalgary.ca/~cleve/publications.html):   More
Quantum Algorithms Revisited - Cleve, Ekert, Macchiavello, Mosca (1997)   (Correct)
Schumacher's Quantum Data Compression as a Quantum Computation - Cleve, DiVincenzo (1996)   (Correct)
Interpolating Arithmetic Read-Once Formulas in Parallel - Bshouty, Cleve   (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