scientific article; zbMATH DE number 7204275

DOI10.4230/LIPIcs.CCC.2017.24zbMath1440.68095arXiv1611.05754MaRDI QIDQ5111154

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

Publication date: 26 May 2020

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

lower boundsquantum computingcommunication complexityquantum informationlogrank

Mathematics Subject Classification ID

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

Related Items

A Nearly Optimal Lower Bound on the Approximate Degree of AC$^0$, Upper bounds on communication in terms of approximate rank