A. M. Childs,
“Universal computation by quantum walk”,
Physical Review Letters, vol. 102, no. 18, 2009.
A. M. Childs, Farhi, E., and Gutmann, S.,
“An example of the difference between quantum and classical random walks”,
Quantum Information Processing, vol. 1, no. 1/2, pp. 35 - 43, 2001.
A. M. Childs and van Dam, W.,
“Quantum algorithms for algebraic problems”,
Reviews of Modern Physics, vol. 82, no. 1, pp. 1 - 52, 2010.
A. M. Childs, Gosset, D., and Webb, Z.,
“Universal computation by multi-particle quantum walk”,
Science, vol. 339, no. 6121, pp. 791 - 794, 2013.
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 and Strouse, D. J.,
“Levinson's theorem for graphs”,
Journal of Mathematical Physics, vol. 52, no. 8, p. 082102, 2011.
A. M. Childs, Jao, D., and Soukharev, V.,
“Constructing elliptic curve isogenies in quantum subexponential time”,
Journal of Mathematical Cryptology, vol. 8, no. 1, pp. 1 - 29, 2014.
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 and Wiebe, N.,
“Product Formulas for Exponentials of Commutators”,
Journal of Mathematical Physics, vol. 54, no. 6, p. 062202, 2013.
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.