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. Childs received his doctorate in physics from MIT in 2004.

“Signaling and Scrambling with Strongly Long-Range Interactions”, Physical Review A, vol. 102, no. 010401(R), 2020. ,

“Destructive Error Interference in Product-Formula Lattice Simulation”, Phys. Rev. Lett. , vol. 124, no. 220502, 2020. ,

“Symmetries, graph properties, and quantum speedups”, To appear in Proceedings of the 61st Annual Symposium on Foundations of Computer Science (FOCS 2020), 2020. ,

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

“Non-interactive classical verification of quantum computation”, To appear in the Proceedings of the Eighteenth Theory of Cryptography Conference (TCC 2020), 2020. ,

“Quantum spectral methods for differential equations”, Commun. Math. Phys. , vol. 375, pp. 1427-1457, 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 algorithms and lower bounds for convex optimization”, Quantum, vol. 4, no. 221, 2020. ,

“A Theory of Trotter Error”, 2019. ,

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