H. Buhrman. Quantum computing and communication complexity. EATCS Bulletin, 70:131-141, February 2000. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Quantum Communication and Complexity - de Wolf (2000) (1 citation) (Correct)
....and then cover the main results of quantum communication complexity: upper bounds (Section 5) lower bounds (Section 6) and applications (Section 7) We include proofs of some of the central results and references to others. Some other recent surveys of quantum communication complexity are [48,15,35], and a more popular account can be found in [47] Our survey differs from these in being a bit more extensive and up to date. 2 Quantum Computation In this section we briefly give the relevant background from quantum computation, referring to the book of Nielsen and Chuang [44] for more ....
H. Buhrman. Quantum computing and communication complexity. EATCS Bulletin, pages 131--141, February 2000.
Quantum and Classical Strong Direct Product Theorems and.. - Klauck, Spalek, de Wolf (2004) (Correct)
No context found.
H. Buhrman. Quantum computing and communication complexity. EATCS Bulletin, 70:131-141, February 2000.
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