@InProceedings{chakraborty_et_al:LIPIcs.CCC.2020.32,
author = {Chakraborty, Sourav and Chattopadhyay, Arkadev and Mande, Nikhil S. and Paraashar, Manaswi},
title = {{Quantum Query-To-Communication Simulation Needs a Logarithmic Overhead}},
booktitle = {35th Computational Complexity Conference (CCC 2020)},
pages = {32:1--32:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-156-6},
ISSN = {1868-8969},
year = {2020},
volume = {169},
editor = {Saraf, Shubhangi},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2020.32},
URN = {urn:nbn:de:0030-drops-125842},
doi = {10.4230/LIPIcs.CCC.2020.32},
annote = {Keywords: Quantum query complexity, quantum communication complexity, approximate degree, approximate spectral norm}
}