Professor and Co-Director

3359 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). He is also 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.

“Time-dependent Hamiltonian simulation with L1-norm scaling”, Quantum, vol. 4, no. 254, 2020. ,

“Non-interactive classical verification of quantum computation”, Theory of Cryptography Conference (TCC), vol. Lecture Notes in Computer Science 12552, pp. 153-180, 2020. ,

“Nearly optimal time-independent reversal of a spin chain”, accepted for publication in Physical Review Research, 2020. ,

“Quantum Coupon Collector”, Proceedings of the 15th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2020), Leibniz International Proceedings in Informatics, vol. 158, pp. 10:1-10:17, 2020. ,

“Quantum spectral methods for differential equations”, Commun. Math. Phys. , vol. 375, pp. 1427-1457, 2020. ,

“Quantum algorithms and lower bounds for convex optimization”, Quantum, vol. 4, no. 221, 2020. ,

“Nearly optimal lattice simulation by product formulas”, Phys. Rev. Lett. , vol. 123, no. 050503, 2019. ,

“Faster quantum simulation by randomization”, Quantum , vol. 3, no. 182, 2019. ,

“Locality and digital quantum simulation of power-law interactions”, Phys. Rev. X 9, 031006, vol. 9, no. 031006, 2019. ,

“Circuit Transformations for Quantum Architectures”, Proceedings of TQC 2019, LIPIcs, vol. 135 , no. 3, 2019. ,

“Quantum algorithm for multivariate polynomial interpolation”, Proceedings of The Royal Society A, vol. 474, no. 2209, 2018. ,

“Automated optimization of large quantum circuits with continuous parameters”, npj:Quantum Information, vol. 4, no. 23, 2018. ,

“Toward the first quantum simulation with quantum speedup”, Proceedings of the National Academy of Sciences, vol. 115 , pp. 9456-9461, 2018. ,

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

“Quantum algorithm for linear differential equations with exponentially improved dependence on precision”, Communications in Mathematical Physics, vol. 356, no. 3, pp. 1057-1081, 2017. ,

“Efficient simulation of sparse Markovian quantum dynamics”, Quantum Information and Computation, vol. 17, pp. 901-947, 2017. ,

“Optimal quantum algorithm for polynomial interpolation”, 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016), vol. 55, p. 16:1--16:13, 2016. ,

“Optimal state discrimination and unstructured search in nonlinear quantum mechanics”, Physical Review A, vol. 93, no. 2, p. 022314, 2016. ,