scientific article; zbMATH DE number 7204275

DOI10.4230/LIPICS.CCC.2017.24MaRDI QIDQ5111154zbMATH OpenFDO

Authors Anurag Anshu, Shalev Ben-David, Ankit Garg, Rahul Jain, Robin Kothari, Troy Lee

Publication date 26 May 2020

Full work available at URL https://arxiv.org/abs/1611.05754

zbMATH Keywords

communication complexitylogranklower boundsquantum computingquantum information

Mathematics Subject Classification ID

Communication complexity, information complexity (68Q11) Quantum algorithms and complexity in the theory of computing (68Q12) Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Quantum computation (81P68)

Recommendations

• Exponential separation of quantum and classical communication complexity
• Upper bounds on communication in terms of approximate rank
• Near-optimal bounds on the bounded-round quantum communication complexity of disjointness
• Tensor rank and strong quantum nondeterminism in multiparty communication
• Exponential separation of quantum communication and classical information
• Exponential separation of quantum and classical one-way communication complexity
• Exponential Separation of Quantum and Classical One-Way Communication Complexity
• Exponential Separation for One-Way Quantum Communication Complexity, with Applications to Cryptography
• scientific article; zbMATH DE number 2086394
• Communication complexity of private simultaneous quantum messages protocols

Cited in

(5)

• Upper bounds on communication in terms of approximate rank
• A nearly optimal lower bound on the approximate degree of \(\mathrm{AC}^0\)
• Nearly optimal separations between communication (or query) complexity and partitions
• Upper bounds on communication in terms of approximate rank
• A hierarchy of constant communication complexity

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111154)