Andris Ambainis

From Wikipedia, the free encyclopedia
Jump to: navigation, search
Andris Ambainis
Andris Ambainis (2009) side.jpg
Born (1975-01-18) 18 January 1975 (age 42)
Daugavpils, Latvia
Nationality Latvian
Fields Quantum information
Quantum computing
Theoretical computer science
Institutions University of Latvia
Alma mater University of Latvia
University of California, Berkeley
Doctoral advisor Umesh Vazirani
Known for Quantum walks
Quantum algorithms
Quantum complexity theory
Notable awards International Mathematical Olympiad gold medal (1991)

Andris Ambainis (born 18 January 1975)[1] is a Latvian computer scientist active in the fields of quantum information theory and quantum computing. He has held past positions at the Institute for Advanced Study at Princeton, New Jersey[2] and the Institute for Quantum Computing at the University of Waterloo. He is currently a professor in the Faculty of Computing at the University of Latvia. He received a Bachelors (1996), Masters (1997), and Doctorate (1997) in Computer Science from the University of Latvia, as well as a Ph.D. (2001) from the University of California, Berkeley.[1] Ambainis has contributed extensively to quantum information processing and foundations of quantum mechanics, mostly through his work on quantum walks and lower bounds for quantum query complexity. In 1991 he received a perfect score and gold medal at the International Mathematical Olympiad.[3] He won an Alfred P. Sloan Fellowship in 2008.


External links[edit]