Andris Ambainis is a Professor at University of Latvia. He is a full member of the Latvian Academy of Sciences and a winner of its Grand Medal, the highest Latvian award for achievements in research. He studies quantum algorithms, quantum complexity theory and other topics in the theory of quantum computing. Andris Ambainis is an author of more than 100 publications, including 24 papers at STOC and FOCS, the two top conferences in theoretical computer science. He has coordinated two EU FP7 projects (QCS and QALGO), with each of the two projects involving organisations from 7 countries and currently holds an ERC Advanced Grant, MQC (Methods for Quantum Computing).
What can we compute with a quantum computer?
Quantum computers are a new type of computers based on quantum physics – the branch of physics that describe the laws of physics on the level of individual atoms or particles. A quantum computer would be able to solve tasks that are very difficult for conventional computers, from modelling chemical reactions to breaking widely used cryptosystems. These possibilities have resulted in a considerable interest in building a quantum computer, from both major companies (Google, IBM, Microsoft) to startups.
We will survey the possibilities of quantum computers and the results of Latvian scientists in this direction. We will describe the applications of quantum computers to search problems and our method – search by quantum walk. We will also describe quantum algorithms for solving systems of linear equations and their applications to machine learning.