✦ LIBER ✦

Lower Bounds for Quantum Communication Complexity

✍ Scribed by Klauck, Hartmut

Book ID: 118181177
Publisher: Society for Industrial and Applied Mathematics
Year: 2007
Tongue: English
Weight: 270 KB
Volume: 37
Category: Article
ISSN: 0097-5397
DOI: 10.1137/s0097539702405620

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Entropy lower bounds for quantum decisio

Entropy lower bounds for quantum decision tree complexity

✍ Yaoyun Shi 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 70 KB

We prove a general lower bound of quantum decision tree complexity in terms of some entropy notion. We regard decision tree computation as a communication process in which the oracle and the computer exchange several rounds of messages, each round consisting of O(log n) bits. Let E(f ) be the Shanno

Property Testing Lower Bounds via Commun

Property Testing Lower Bounds via Communication Complexity

✍ Blais, Eric; Brody, Joshua; Matulef, Kevin 📂 Article 📅 2012 🏛 Springer 🌐 English ⚖ 486 KB

Lower Bounds on the Multiparty Communica

Lower Bounds on the Multiparty Communication Complexity

✍ Pavol Ďuriš; José D.P. Rolim 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 236 KB

Communication complexity towards lower b

Communication complexity towards lower bounds on circuit depth

✍ J. Edmonds; R. Impagliazzo; S. Rudich; J. Sgall 📂 Article 📅 2001 🏛 Springer 🌐 English ⚖ 543 KB

Lower bounds on the complexity of simula

Lower bounds on the complexity of simulating quantum gates

✍ Childs, Andrew M.; Haselgrove, Henry L.; Nielsen, Michael A. 📂 Article 📅 2003 🏛 The American Physical Society 🌐 English ⚖ 68 KB

Lower Bounds for Randomized and Quantum

Lower Bounds for Randomized and Quantum Query Complexity Using Kolmogorov Arguments

✍ Laplante, Sophie; Magniez, Frédéric 📂 Article 📅 2008 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 260 KB