Lower Bounds on Quantum Multiparty Communication Complexity

Troy Lee, G. Schechtman, A. Shraibman
{"title":"Lower Bounds on Quantum Multiparty Communication Complexity","authors":"Troy Lee, G. Schechtman, A. Shraibman","doi":"10.1109/CCC.2009.24","DOIUrl":null,"url":null,"abstract":"A major open question in communication complexity is if randomized and quantum communication are polynomially related for all total functions. So far, no gap larger than a power of two is known, despite significant efforts. We examine this question in the number-on-the-forehead model of multiparty communication complexity. We show that essentially all lower bounds known on randomized complexity in this model also hold for quantum communication. This includes bounds of size Omega(n/2^k) for the k-party complexity of explicit functions, bounds for the generalized inner product function, and recent work on the multiparty complexity of disjointness. To the best of our knowledge, these are the first lower bounds of any kind on quantum communication in the general number-on-the-forehead model. We show this result in the following way. In the two-party case, there is a lower bound on quantum communication complexity in terms of a norm gamma_2, which is known to subsume nearly all other techniques in the literature. For randomized complexity there is another natural bound in terms of a different norm mu which is also one of the strongest techniques available. A deep theorem in functional analysis, Grothendieck's inequality, implies that gamma_2 and mu are equivalent up to a constant factor. This connection is one of the major obstacles to showing a larger gap between randomized and quantum communication complexity in the two-party case. The lower bound technique in terms of the norm mu was recently extended to the multiparty number-on-the-forehead model. Here we show how the gamma_2 norm can be also extended to lower bound quantum multiparty complexity. Surprisingly, even in this general setting the two lower bounds, on quantum and classical communication, are still very closely related. This implies that separating quantum and classical communication in this setting will require the development of new techniques. The relation between these extensions of mu and gamma_2 is proved by a multi-dimensional version of Grothendieck's inequality.","PeriodicalId":158572,"journal":{"name":"2009 24th Annual IEEE Conference on Computational Complexity","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"21","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 24th Annual IEEE Conference on Computational Complexity","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CCC.2009.24","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 21

Abstract

A major open question in communication complexity is if randomized and quantum communication are polynomially related for all total functions. So far, no gap larger than a power of two is known, despite significant efforts. We examine this question in the number-on-the-forehead model of multiparty communication complexity. We show that essentially all lower bounds known on randomized complexity in this model also hold for quantum communication. This includes bounds of size Omega(n/2^k) for the k-party complexity of explicit functions, bounds for the generalized inner product function, and recent work on the multiparty complexity of disjointness. To the best of our knowledge, these are the first lower bounds of any kind on quantum communication in the general number-on-the-forehead model. We show this result in the following way. In the two-party case, there is a lower bound on quantum communication complexity in terms of a norm gamma_2, which is known to subsume nearly all other techniques in the literature. For randomized complexity there is another natural bound in terms of a different norm mu which is also one of the strongest techniques available. A deep theorem in functional analysis, Grothendieck's inequality, implies that gamma_2 and mu are equivalent up to a constant factor. This connection is one of the major obstacles to showing a larger gap between randomized and quantum communication complexity in the two-party case. The lower bound technique in terms of the norm mu was recently extended to the multiparty number-on-the-forehead model. Here we show how the gamma_2 norm can be also extended to lower bound quantum multiparty complexity. Surprisingly, even in this general setting the two lower bounds, on quantum and classical communication, are still very closely related. This implies that separating quantum and classical communication in this setting will require the development of new techniques. The relation between these extensions of mu and gamma_2 is proved by a multi-dimensional version of Grothendieck's inequality.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
量子多方通信复杂度的下界
通信复杂性的一个主要开放问题是随机通信和量子通信是否对所有总函数都是多项式相关的。到目前为止,尽管付出了巨大的努力,但还没有发现差距大于2的情况。我们在多方通信复杂性的“额上数”模型中检验这个问题。我们表明,在这个模型中,基本上所有已知的随机复杂度的下界也适用于量子通信。这包括大小为ω (n/2^k)的显式函数的k方复杂度的界,广义内积函数的界,以及最近关于不连接的多方复杂度的工作。据我们所知,这是在一般的额上数字模型中量子通信的第一个下界。我们用下面的方式来显示这个结果。在两方的情况下,量子通信的复杂性有一个下限,以规范gamma_2表示,已知它包含了文献中几乎所有其他技术。对于随机复杂度,有另一种自然界,用不同的范数mu表示,这也是最强大的技术之一。泛函分析中的一个深奥的定理,格罗腾迪克不等式,表明在一个常数因子范围内,gamma_2和mu是等价的。这种联系是在两方情况下显示随机通信和量子通信复杂性之间较大差距的主要障碍之一。根据范数mu的下界技术最近被推广到多方额上数模型。这里我们展示了如何将gamma_2范数扩展到下界量子多方复杂性。令人惊讶的是,即使在这种一般情况下,量子和经典通信的两个下界仍然非常密切相关。这意味着,在这种情况下,分离量子通信和经典通信将需要开发新技术。用格罗腾迪克不等式的多维形式证明了这些扩展与γ - 2之间的关系。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Planar Graph Isomorphism is in Log-Space Increasing the Gap between Descriptional Complexity and Algorithmic Probability Every Permutation CSP of arity 3 is Approximation Resistant Lower Bounds on Quantum Multiparty Communication Complexity The Maximum Communication Complexity of Multi-Party Pointer Jumping
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1