A. M. Childs, Kothari, R., Ozols, M., and Roetteler, M.,
“Easy and hard functions for the Boolean hidden shift problem”,
Proceedings of TQC 2013, vol. 22, pp. 50-79, 2013.
A. M. Childs, Cleve, R., Jordan, S. P., and Yeung, D.,
“Discrete-query quantum algorithm for NAND trees”,
Theory of Computing, vol. 5, no. 1, pp. 119 - 123, 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, Su, Y., Tran, M. C., Wiebe, N., and Zhu, S.,
“Theory of Trotter Error with Commutator Scaling”,
Phys. Rev. X, vol. 11, no. 1, p. 49, 2021.
A. M. Childs, van Dam, W., Hung, S. - H., and Shparlinski, I. E.,
“Optimal quantum algorithm for polynomial interpolation”,
43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016), vol. 55, p. 16:1--16:13, 2016.
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, Leung, D., Mancinska, L., and Ozols, M.,
“A framework for bounding nonlocality of state discrimination”,
Communications in Mathematical Physics, vol. 323, no. 3, pp. 1121 - 1153, 2013.
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, Gosset, D., and Webb, Z.,
“Universal computation by multi-particle quantum walk”,
Science, vol. 339, no. 6121, pp. 791 - 794, 2013.