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 Strouse, D. J.,
“Levinson's theorem for graphs”,
Journal of Mathematical Physics, vol. 52, no. 8, p. 082102, 2011.
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, 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, 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 Vidal, G.,
“Reversible simulation of bipartite product Hamiltonians”,
IEEE Transactions on Information Theory, vol. 50, no. 6, pp. 1189 - 1197, 2004.
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.