Andrew Childs

Andrew MacGregor Childs
Nationality USA
Fields Computer science, Physics
Institutions University of Maryland
University of Waterloo
Alma mater California Institute of Technology
Massachusetts Institute of Technology
Doctoral advisor Edward Farhi
Doctoral students Robin Kothari, Laura Mančinska, Māris Ozols, Zak Webb
Website
http://www.cs.umd.edu/~amchilds/

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.[1]

Biography

Andrew Childs received a doctorate in physics from MIT in 2004, advised by Edward Farhi.[2] His thesis was on Quantum Information Processing in Continuous Time. [3] 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.[4] 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.[5]

Research

Childs is known for his work on quantum computing, especially on the development of quantum algorithms.[6][7][8] He helped to develop the concept of a quantum walk [9][10][11] [12] leading to an example of exponential quantum speedup and algorithms for spatial search,[13] formula evaluation, and universal computation[14][15] He also developed quantum algorithms for algebraic problems and for simulating quantum systems.

Selected works

References

  1. ↑ http://quics.umd.edu/news/quantum-information-expert-andrew-childs-joins-umd-co-director-quics
  2. ↑ Andrew Childs at the Mathematics Genealogy Project
  3. ↑ A.M. Childs, Quantum information processing in continuous time,Ph.D. thesis, Massachusetts Institute of Technology, 2004, http://dx.doi.org/1721.1/16663
  4. ↑ http://www.iqi.caltech.edu/people.html
  5. ↑ http://www.cifar.ca/andrew-childs
  6. ↑ http://math.nist.gov/quantum/zoo/
  7. ↑ D. Bacon and W. van Dam, Recent progress in quantum algorithms. Communications of the ACM, Vol 53, Pages 84-93, 2010. http://dl.acm.org/citation.cfm?doid=1646353.1646375
  8. ↑ A. Montanaro.Quantum Algorithms: an overview,NPJ Quantum Information 2, 15023, 2016, http://www.nature.com/articles/npjqi201523
  9. ↑ S. E. Venegas-Andraca, Quantum Walks: a comprehensive review,Quantum Information Processing,Vol 11, Pages 1015-11-6, 2012. http://link.springer.com/article/10.1007%2Fs11128-012-0432-5
  10. ↑ D. Reitnzer, D. Nagaj, and V. Buzek, Quantum Walks, Acta Physica Slovaca Vol 61, 603-725, 2011, http://www.physics.sk/aps/pub.php?y=2011&pub=aps-11-06
  11. ↑ A.Ambainis, Quantum walks and their algorithmic applications, International Journal of Quantum Information, Vol 1, 507, 2003, http://www.worldscientific.com/doi/abs/10.1142/S0219749903000383
  12. ↑ J, Kempe, Quantum random walks: An introductory overview, Contemporary Physics, Vol 44, 307-327, 2003. http://www.tandfonline.com/doi/abs/10.1080/00107151031000110776
  13. ↑ A. M. Childs and J. Goldstone, Spatial search by quantum walk, Phys. Rev. A 70, 022314, 2004, arXiv:quant-ph/0306054.
  14. ↑ A. M. Childs, Universal computation by quantum walk, Phys. Rev. Lett. 102, 180501, 2009, arXiv:0806.1972.
  15. ↑ http://www.tomshardware.co.uk/Scalable-Quantum-Computing-Model,news-42736.html

External links

This article is issued from Wikipedia - version of the Sunday, April 24, 2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.