Professor and Co-Director

3100F Atlantic Building

(301) 405-2329

Andrew Childs, co-director of QuICS, is a professor in the Department of Computer Science and the Institute for Advanced Computer Studies (UMIACS).

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. He is also a Senior Fellow of the Canadian Institute for Advanced Research.

Childs received his doctorate in physics from MIT in 2004.

“Interpolatability distinguishes LOCC from separable von Neumann measurements”, Journal of Mathematical Physics, vol. 54, no. 11, p. 112204, 2013. ,

“Easy and hard functions for the Boolean hidden shift problem”, Proceedings of TQC 2013, vol. 22, pp. 50-79, 2013. ,

“Universal computation by multi-particle quantum walk”, Science, vol. 339, no. 6121, pp. 791 - 794, 2013. ,

“Product Formulas for Exponentials of Commutators”, Journal of Mathematical Physics, vol. 54, no. 6, p. 062202, 2013. ,

“Levinson's theorem for graphs II”, Journal of Mathematical Physics, vol. 53, no. 10, p. 102207, 2012. ,

“Hamiltonian Simulation Using Linear Combinations of Unitary Operations”, Quantum Information and Computation, vol. 12, no. 11-12, pp. 901-924, 2012. ,

“The quantum query complexity of read-many formulas”, Lecture Notes in Computer Science, vol. 7501, pp. 337-348, 2012. ,

“Levinson's theorem for graphs”, Journal of Mathematical Physics, vol. 52, no. 8, p. 082102, 2011. ,

“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. ,

“Quantum property testing for bounded-degree graphs”, Proc. RANDOM, pp. 365-376, 2010. ,

“Quantum algorithms for algebraic problems”, Reviews of Modern Physics, vol. 82, no. 1, pp. 1 - 52, 2010. ,

“On the relationship between continuous- and discrete-time quantum walk”, Communications in Mathematical Physics, vol. 294, no. 2, pp. 581 - 603, 2010. ,

“Universal computation by quantum walk”, Physical Review Letters, vol. 102, no. 18, 2009. ,

“Discrete-query quantum algorithm for NAND trees”, Theory of Computing, vol. 5, no. 1, pp. 119 - 123, 2009. ,