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.

“The limitations of nice mutually unbiased bases”, Journal of Algebraic Combinatorics, vol. 25, no. 2, pp. 111 - 123, 2007. ,

“Two-way quantum communication channels”, International Journal of Quantum Information, vol. 04, no. 01, pp. 63 - 83, 2006. ,

“Unified derivations of measurement-based schemes for quantum computation”, Physical Review A, vol. 71, no. 3, 2005. ,

“Spatial search by quantum walk”, Physical Review A, vol. 70, no. 2, 2004. ,

“Spatial search and the Dirac equation”, Physical Review A, vol. 70, no. 4, 2004. ,

“Reversible simulation of bipartite product Hamiltonians”, IEEE Transactions on Information Theory, vol. 50, no. 6, pp. 1189 - 1197, 2004. ,

“Lower bounds on the complexity of simulating quantum gates”, Physical Review A, vol. 68, no. 5, 2003. ,

“Quantum search by measurement”, Physical Review A, vol. 66, no. 3, 2002. ,

“Universal simulation of Hamiltonian dynamics for qudits”, Physical Review A, vol. 66, no. 2, 2002. ,

“An example of the difference between quantum and classical random walks”, Quantum Information Processing, vol. 1, no. 1/2, pp. 35 - 43, 2001. ,