Separating quantum communication and approximate rank

One of the best lower bound methods for the quantum communication complexity of a function H (with or without shared entanglement) is the logarithm of the approximate rank of the communication matrix of H. This measure is essentially equivalent to the approximate gamma-2 norm and generalized discrep...

全面介紹

Saved in:
書目詳細資料
Main Authors: Anshu, Anurag, Garg, Ankit, Kothari, Robin, Ben-David, Shalev, Jain, Rahul, Lee, Troy
其他作者: School of Physical and Mathematical Sciences
格式: Article
語言:English
出版: 2018
主題:
在線閱讀:https://hdl.handle.net/10356/88427
http://hdl.handle.net/10220/45784
標簽: 添加標簽
沒有標簽, 成為第一個標記此記錄!
機構: Nanyang Technological University
語言: English