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 |
相似書籍
-
A property of quantum relative entropy with an application to privacy in quantum communication
由: Jain, R., et al.
出版: (2013) -
ONE-SHOT PROTOCOLS FOR COMMUNICATION OVER QUANTUM NETWORKS: ACHIEVABILITY AND LIMITATIONS
由: ANURAG ANSHU
出版: (2018) -
New bounds on classical and quantum one-way communication complexity
由: Jain, R., et al.
出版: (2013) -
On the near-optimality of one-shot classical communication over quantum channels
由: Anshu, Anurag, et al.
出版: (2019) -
A composition theorem for randomized query complexity
由: Anshu, Anurag, et al.
出版: (2018)