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.
A. M. Childs and Gosset, D.,
“Levinson's theorem for graphs II”,
Journal of Mathematical Physics, vol. 53, no. 10, p. 102207, 2012.
A. M. Childs,
“Universal computation by quantum walk”,
Physical Review Letters, vol. 102, no. 18, 2009.
A. M. Childs, Leung, D., Mancinska, L., and Ozols, M.,
“Interpolatability distinguishes LOCC from separable von Neumann measurements”,
Journal of Mathematical Physics, vol. 54, no. 11, p. 112204, 2013.
A. M. Childs, Kothari, R., and Somma, R. D.,
“Quantum algorithm for systems of linear equations with exponentially improved dependence on precision”,
SIAM Journal on Computing, vol. 46, no. 6, pp. 1920-1950, 2017.
A. M. Childs, Gosset, D., and Webb, Z.,
“The Bose-Hubbard model is QMA-complete”,
Proceedings of the 41st International Colloquium on Automata, Languages, and Programming (ICALP 2014), vol. 8572, pp. 308-319, 2014.