A. M. Childs and Kothari, R.,
“Quantum query complexity of minor-closed graph properties”,
Proc. 28th Symposium on Theoretical Aspects of Computer Science (STACS 2011), Leibniz International Proceedings in Informatics, vol. 9, pp. 661-672, 2011.
A. M. Childs, Hung, S. - H., and Li, T.,
“Quantum query complexity with matrix-vector products”,
Proceedings of the 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021), Leibniz International Proceedings in Informatics, vol. 198, pp. 55:1-55:19, 2021.