A. M. Childs, Gosset, D., and Webb, Z.,
“Complexity of the XY antiferromagnet at fixed magnetization”,
Quantum Information and Computation, vol. 16, no. 1-2, pp. 1-18, 2016.
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, Leung, D. W., and Lo, H. - K.,
“Two-way quantum communication channels”,
International Journal of Quantum Information, vol. 04, no. 01, pp. 63 - 83, 2006.
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, Leung, D. W., and Vidal, G.,
“Reversible simulation of bipartite product Hamiltonians”,
IEEE Transactions on Information Theory, vol. 50, no. 6, pp. 1189 - 1197, 2004.
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.
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, 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 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, 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, 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, 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.