Andrew Childs



  • Fellow
  • Quantum Information Science


  • University of Maryland
Department of Computer Science, Institute for Advanced Computer Studies and Joint Center for Quantum Information and Computer Science


  • United States


PhD (Physics), Massachusetts Institute of Technology
BS (Physics), California Institute of Technology


Andrew Childs is a computer scientist who studies the theory of quantum information processing, with particular emphasis on algorithms for quantum computers.

His work combines concepts from physics, computer science and mathematics. 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.


University of Waterloo Outstanding Performance Award, 2013

NSERC Discovery Accelerator Supplement Award, 2013–16

Ontario Early Researcher Award, 2011–16

Lee A. Dubridge Postdoctoral Prize Fellowship in Theoretical Physics, Caltech, 2004–07

Andrew M. Lockett III Memorial Award, MIT, 2003

Relevant Publications

Barry, D.W. et al. "Exponential improvement in precision for simulating sparse Hamiltonians." In the Proceedings of the 46th ACM Symposium on Theory of Computing (STOC 2014): 283–92.

Childs, A.M. et al. "Universal computation by multi-particle quantum walk." Science 339 (2013): 791–94.

Childs, A.M. "On the relationship between continuous- and discrete-time quantum walk." Commun. Math. Phys. 294 (2010): 581–603.

Ambainis, A. et al. "Any AND-OR formula of size N can be evaluated in time N^{1/2+o(1)} on a quantum computer." SIAM J. Comput. 39 (2010): 2513–2530.

Childs, A.M. "Universal computation by quantum walk." Phys. Rev. Lett. 102 (2009): 180501.