Separating quantum communication and approximate rank

• Main Authors: Anshu, Anurag, Garg, Ankit, Kothari, Robin, Ben-David, Shalev, Jain, Rahul, Lee, Troy
• Other Authors: School of Physical and Mathematical Sciences
• Format: Article
• Language: English
• Published: 2018
• Subjects: DRNTU::Science::Mathematics; Communication Complexity; Quantum Computing
• Online Access: 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...