@InProceedings{aaronson_et_al:LIPIcs.CCC.2022.20,
author = {Aaronson, Scott and Ingram, DeVon and Kretschmer, William},
title = {{The Acrobatics of BQP}},
booktitle = {37th Computational Complexity Conference (CCC 2022)},
pages = {20:1--20:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-241-9},
ISSN = {1868-8969},
year = {2022},
volume = {234},
editor = {Lovett, Shachar},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2022.20},
URN = {urn:nbn:de:0030-drops-165820},
doi = {10.4230/LIPIcs.CCC.2022.20},
annote = {Keywords: BQP, Forrelation, oracle separations, Polynomial Hierarchy, query complexity}
}