Separating quantum communication and approximate rank

• المؤلفون الرئيسيون: Anshu, Anurag, Garg, Ankit, Kothari, Robin, Ben-David, Shalev, Jain, Rahul, Lee, Troy
• مؤلفون آخرون: School of Physical and Mathematical Sciences
• التنسيق: مقال
• اللغة: English
• منشور في: 2018
• الموضوعات: DRNTU::Science::Mathematics; Communication Complexity; Quantum Computing
• الوصول للمادة أونلاين: https://hdl.handle.net/10356/88427; http://hdl.handle.net/10220/45784

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...