@InProceedings{rosenthal:LIPIcs.ITCS.2021.32,
author = {Rosenthal, Gregory},
title = {{Bounds on the QAC^0 Complexity of Approximating Parity}},
booktitle = {12th Innovations in Theoretical Computer Science Conference (ITCS 2021)},
pages = {32:1--32:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-177-1},
ISSN = {1868-8969},
year = {2021},
volume = {185},
editor = {Lee, James R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2021.32},
URN = {urn:nbn:de:0030-drops-135713},
doi = {10.4230/LIPIcs.ITCS.2021.32},
annote = {Keywords: quantum circuit complexity, QAC^0, fanout, parity, nekomata}
}