Andrew Childs

amchilds's picture
Professor
3359 Atlantic Building
(301) 405-2329

Andrew Childs is a professor in the Department of Computer Science and the Institute for Advanced Computer Studies (UMIACS). He was a Co-Director of QuICS from 2014-2024, and is the director of the NSF Quantum Leap Challenge Institute for Robust Quantum Simulation.

Childs's research interests are in the theory of quantum information processing, especially quantum algorithms. He has explored the computational power of quantum walk, providing an example of exponential speedup, demonstrating computational universality, and constructing algorithms for problems including search and formula evaluation. Childs has also developed fast quantum algorithms for simulating Hamiltonian dynamics. His other areas of interest include quantum query complexity and quantum algorithms for algebraic problems.

Before coming to UMD, Childs was a DuBridge Postdoctoral Scholar at Caltech from 2004-2007 and a faculty member in Combinatorics & Optimization and the Institute for Quantum Computing at the University of Waterloo from 2007-2014. Childs received his doctorate in physics from MIT in 2004.

Courses

Publications

2024

2023

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.

2022

Q. Zhao, Zhou, Y., Shaw, A. F., Li, T., and Childs, A. M., Hamiltonian simulation with random inputs, Phys. Rev. Lett. 129, 270502, vol. 129, no. 270502, 2022.
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.

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.