S. Gharibian, M. Santha, J. Sikora, A. Sundaram, and J. Yirka, “Quantum generalizations of the polynomial hierarchy with applications to QMA(2),”10.1007/s00037-022-00231-8__Computational Complexity, vol. 31, no. 2, Art. no. 13, 2022, doi:10.1007/s00037-022-00231-8 .

D. Grigoriev, M. Karpinski, F. Meyer auf der Heide, and R. Smolensky, “A lower bound for randomized algebraic decision trees,” computational complexity, pp. 357–375, 1997.