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, 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, 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, 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, Gosset, D., and Webb, Z.,
“Universal computation by multi-particle quantum walk”,
Science, vol. 339, no. 6121, pp. 791 - 794, 2013.
A. M. Childs, Li, T., Liu, J. - P., Wang, C., and Zhang, R.,
“Quantum Algorithms for Sampling Log-Concave Distributions and Estimating Normalizing Constants”,
Advances in Neural Information Processing Systems (NeurIPS 2022), vol. 35, no. 23205, 2022.
A. M. Childs, Maslov, D., Nam, Y., Ross, N. J., and Su, Y.,
“Toward the first quantum simulation with quantum speedup”,
Proceedings of the National Academy of Sciences, vol. 115 , pp. 9456-9461, 2018.
A. M. Childs, Coudron, M., and Gilani, A. Shiraz,
“Quantum Algorithms and the Power of Forgetting”,
14th Innovations in Theoretical Computer Science Conference (ITCS 2023), vol. 251, p. 37:1--37:22, 2023.
]