Andris Ambainis
Andris Ambainis | |
---|---|
Born | Daugavpils, Latvia | 18 January 1975
Nationality | Latvian |
Alma mater | University of Latvia University of California, Berkeley |
Known for | Quantum walks Quantum algorithms Quantum complexity theory |
Awards | International Mathematical Olympiad gold medal (1991) |
Scientific career | |
Fields | Quantum information Quantum computing Theoretical computer science |
Institutions | University of Latvia |
Doctoral advisor | Umesh Vazirani |
Andris Ambainis (born 18 January 1975)[1] is a Latvian computer scientist active in the fields of quantum information theory and quantum computing.
Education and career
[edit]Ambainis 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 PhD (2001) from the University of California, Berkeley.[1]
Contributions
[edit]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.
Recognition
[edit]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. Ambainis was an invited speaker at the 2018 International Congress of Mathematicians[4], speaking on mathematical aspects of computer science.
References
[edit]- ^ a b Andris Ambainis' page Archived 2014-05-21 at the Wayback Machine at the Latvian Academy of Sciences.
- ^ Institute for Advanced Study: A Community of Scholars
- ^ Andris Ambainis's results at International Mathematical Olympiad.
- ^ "Invited section lectures", ICM 2018, archived from the original on 2017-10-25, retrieved 2018-08-31
External links
[edit]