Scott Aaronson, Robin Kothari, William Kretschmer, Justin Thaler. Quantum Lower Bounds for Approximate Counting via Laurent Polynomials. In Shubhangi Saraf, editor, 35th Computational Complexity Conference, CCC 2020, July 28-31, 2020, Saarbrücken, Germany (Virtual Conference). Volume 169 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. [doi]
@inproceedings{AaronsonKKT20, title = {Quantum Lower Bounds for Approximate Counting via Laurent Polynomials}, author = {Scott Aaronson and Robin Kothari and William Kretschmer and Justin Thaler}, year = {2020}, doi = {10.4230/LIPIcs.CCC.2020.7}, url = {https://doi.org/10.4230/LIPIcs.CCC.2020.7}, researchr = {https://researchr.org/publication/AaronsonKKT20}, cites = {0}, citedby = {0}, booktitle = {35th Computational Complexity Conference, CCC 2020, July 28-31, 2020, Saarbrücken, Germany (Virtual Conference)}, editor = {Shubhangi Saraf}, volume = {169}, series = {LIPIcs}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, isbn = {978-3-95977-156-6}, }