NationalityUnited States Academic advisorEdward Farhi

Doctoral advisorEdward Farhi

FieldsComputer science, Physics Doctoral studentsRobin Kothari, Laura Mančinska, Māris Ozols, Zak Webb Alma matersCalifornia Institute of Technology, Massachusetts Institute of Technology Known forQuantum computing, Quantum algorithm, Quantum walk InstitutionsUniversity of Waterloo, University of Maryland, College Park

Quantum algorithms andrew childs useqip 2011

Andrew MacGregor Childs is an American computer scientist and physicist known for his work on quantum computing. He is currently an Associate Professor in the Department of Computer Science and Institute for Advanced Computer Studies at the University of Maryland. He also co-directs the Joint Center for Quantum Information and Computer Science, a partnership between the University of Maryland and the National Institute for Standards and Technology.

Futures series andrew childs postdoc to p i making the transition

Biography

Andrew Childs received a doctorate in physics from MIT in 2004, advised by Edward Farhi. His thesis was on Quantum Information Processing in Continuous Time. After completing his Ph.D., Childs was a DuBridge Postdoctoral Scholar at the Institute for Quantum Information at the California Institute of Technology from 2004–2007. From 2007–2014, he was a faculty member in the Department of Combinatorics and Optimization and the Institute for Quantum Computing at the University of Waterloo. Childs joined the University of Maryland in 2014. He is also a senior fellow of the Canadian Institute for Advanced Research.

Research

Childs is known for his work on quantum computing, especially on the development of quantum algorithms. He helped to develop the concept of a quantum walk leading to an example of exponential quantum speedup and algorithms for spatial search, formula evaluation, and universal computation He also developed quantum algorithms for algebraic problems and for simulating quantum systems.

Selected works

A. M. Childs, R. Cleve, E. Deotto, E. Farhi, S. Gutmann, and D. A. Spielman, (2002). "Exponential algorithmic speedup by a quantum walk". Exponential algorithmic speedup by quantum walk. Proc. th ACM Symposium on Theory of Computing (STOC ), pp. 35. pp. 59–68. arXiv:quant-ph/0209131. doi:10.1145/780542.780552. ISBN 1-58113-674-9.CS1 maint: Uses authors parameter (link)

Childs, Andrew M. (2008). "Universal computation by quantum walk". Physical Review Letters. 102 (18): 180501. arXiv:0806.1972. Bibcode:2009PhRvL.102r0501C. doi:10.1103/PhysRevLett.102.180501. PMID 19518851.

Childs, Andrew M.; Farhi, Edward; Preskill, John (2001). "Robustness of adiabatic quantum computation". Physical Review A. 65 (2002). arXiv:quant-ph/0108048. doi:10.1103/PhysRevA.65.012322.

Ambainis, Andris; Childs, Andrew M.; Reichardt, Ben W.; Spalek, Robert; Zhang, Shengyu (2007). "Any AND-OR Formula of Size N can be Evaluated in time N^{1/2 + o(1)} on a Quantum Computer". 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07). pp. 2513–2530. doi:10.1109/FOCS.2007.57. ISBN 0-7695-3010-9.

Childs, Andrew M.; Gosset, David; Webb, Zak (2012). "Universal computation by multi-particle quantum walk". Science. 339 (6121): 791–794. arXiv:1205.3782. doi:10.1126/science.1229957. PMID 23413349.

Berry, Dominic W.; Childs, Andrew M.; Cleve, Richard; Kothari, Robin; Somma, Rolando D. (2013). "Exponential improvement in precision for simulating sparse Hamiltonians". Proceedings of the 46th Annual ACM Symposium on Theory of Computing – STOC '14. 46. pp. 283–292. arXiv:1312.1414. doi:10.1145/2591796.2591854. ISBN 978-1-4503-2710-7.

Childs, Andrew M. (2008). "On the relationship between continuous- and discrete-time quantum walk". Communications in Mathematical Physics. 294 (2): 581–603. arXiv:0810.0312. doi:10.1007/s00220-009-0930-1.