[1]   Scott Aaronson: Quantum computing, postselection, and probabilistic polynomial-time. Proc. Royal Soc. A, 461(2063):3473–3482, 2005. [doi:10.1098/rspa.2005.1546]

[2]   Scott Aaronson: Oracles are subtle but not malicious. In Proc. 21st IEEE Conf. on Comput. Complexity (CCC’06), pp. 340–354. IEEE Comp. Soc., 2006. [doi:10.1109/CCC.2006.32]

[3]   Scott Aaronson: The learnability of quantum states. Proc. Royal Soc. A, 463(2088):3089–3114, 2007. [doi:10.1098/rspa.2007.0113]

[4]   Scott Aaronson: Yet more errors in papers, May 2017. Available at https://scottaaronson.blog/?p=3256.

[5]   Scott Aaronson and Andrew Drucker: A full characterization of quantum advice. SIAM J. Comput., 43(3):1131–1183, 2014. [doi:10.1137/110856939]

[6]   Avantika Agarwal, Sevag Gharibian, Venkata Koppula, and Dorian Rudolph: Quantum polynomial hierarchies: Karp–Lipton, error reduction, and lower bounds. In Proc. Internat. Symp. Math. Foundations of Comp. Sci. (MFCS’24), pp. 7:1–17. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, 2024. [doi:10.4230/LIPIcs.MFCS.2024.7]

[7]   Sanjeev Arora and Boaz Barak: Computational Complexity: A Modern Approach. Cambridge Univ. Press, 2009. [doi:10.1017/CBO9780511804090]

[8]   Venkatesan T. Chakaravarthy and Sambuddha Roy: Oblivious symmetric alternation. In Proc. 23rd Symp. Theoret. Aspects of Comp. Sci. (STACS’06), pp. 230–241. Springer, 2006. [doi:10.1007/11672142_18]

[9]   Stephen A. Fenner: PP-lowness and a simple definition of AWPP. Theory Computing Sys., 36(2):199–212, 2003. [doi:10.1007/s00224-002-1089-8]

[10]   Lance Fortnow and John Rogers: Complexity limitations on quantum computation. J. Comput. System Sci., 59(2):240–252, 1999. [doi:10.1006/jcss.1999.1651]

[11]   Lance Fortnow, Rahul Santhanam, and Ryan Williams: Fixed-polynomial size circuit bounds. In Proc. 24th IEEE Conf. on Comput. Complexity (CCC’09), pp. 19–26. IEEE Comp. Soc., 2009. [doi:10.1109/CCC.2009.21]

[12]   Karthik Gajulapalli, Zeyong Li, and Ilya Volkovich: Oblivious complexity classes revisited: Lower bounds and hierarchies. In Proc. 44th Found. Softw. Techn. Theoret. Comp. Sci. Conf. (FSTTCS’24), pp. 23:1–19. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, 2024. [doi:10.4230/LIPIcs.FSTTCS.2024.23]

[13]   Oded Goldreich and Or Meir: Input-oblivious proof systems and a uniform complexity perspective on P/poly. ACM Trans. Comput. Theory, 7(4):1–13, 2015. [doi:10.1145/2799645]

[14]   Richard M. Karp and Richard J. Lipton: Some connections between nonuniform and uniform complexity classes. In Proc. 12th STOC, pp. 302–309. ACM Press, 1980. [doi:10.1145/800141.804678]

[15]   Greg Kuperberg: How hard is it to approximate the Jones polynomial? Theory of Computing, 11(6):183–219, 2015. [doi:10.4086/toc.2015.v011a006]

[16]   Lide Li: On the counting functions. Ph. D. thesis, The University of Chicago, 1993. Available at https://www.proquest.com/dissertations-theses/on-counting-functions/docview/304080357/se-2.

[17]   Carsten Lund, Lance Fortnow, Howard Karloff, and Noam Nisan: Algebraic methods for interactive proof systems. J. ACM, 39(4):859–868, 1992. [doi:10.1145/146585.146605]

[18]   Chris Marriott and John Watrous: Quantum Arthur–Merlin games. Comput. Complexity, 14(2):122–152, 2005. [doi:10.1007/s00037-005-0194-x]

[19]   Peter Bro Miltersen, N. V. Vinodchandran, and Osamu Watanabe: Super-polynomial versus half-exponential circuit size in the Exponential Hierarchy. In Proc. 5th Internat. Combinatorics and Computing Conf. (COCOON’99), pp. 210–220. Springer, 1999. [doi:10.1007/3-540-48686-0_21]

[20]   Tomoyuki Morimae and Harumichi Nishimura: Quantum interpretations of AWPP and APP. Quantum Info. Comput., 16(5–6):498–514, 2016. [doi:10.26421/QIC16.5-6-6]

[21]   N. V. Vinodchandran: A note on the circuit complexity of PP. Theoret. Comput. Sci., 347(1–2):415–418, 2005. [doi:10.1016/j.tcs.2005.07.032]

[22]   Mikhail N. Vyali: QMA = PP implies that PP contains PH. Electron. Colloq. Comput. Complexity, TR03-021, 2003. [ECCC]

[23]   John Watrous: Quantum computational complexity, 2008. See also the Encycopedia of Complexity and Systems Science. [arXiv:0804.3401]

[24]   Ryan Williams: Nonuniform ACC circuit lower bounds. J. ACM, 61(1, art. 2):1–32, 2014. [doi:10.1145/2559903]

[25]   Complexity Zoo: BQP/poly, BQP/mpoly, BQP/qpoly, BQP. https://complexityzoo.net/Complexity_Zoo:B. Accessed 13 Mar. 2024.