Postdoc position in quantum algorithms

Job type: 


Application deadline: 

Tuesday, March 1, 2022

Research group: 

Applications are invited for a postdoctoral position at the Centre for Quantum Computer Science (CQCS), University of Latvia, lead by prof. Andris Ambainis. CQCS is among the strongest European research groups in quantum algorithms and currently consists of 20 researchers (including postdocs and graduate students).

Research in CQCS is centered around quantum algorithms (for example, quantum walks or quantum algorithms for NP-complete problems), quantum complexity theory (for example, maximum possible quantum advantage in the query model), and connections between quantum computing and classical computer science.

We are looking for candidates who would be interested in one of the research topics:

- developing new quantum algorithms for problems in graph theory, optimization and machine learning;

- complexity-theoretic study of quantum algorithms and quantum communication protocols;

- development of a theoretical foundation for near-term quantum computing;

We are interested in candidates with a variety of backgrounds, from quantum computing/quantum information researchers to classical computer scientists interested in exploring quantum computing.

CQCS is a part of several European research projects on quantum algorithms funded via QuantERA initiative:
- QOPT - Quantum Algorithms for Optimization (coordinated by Aleksandrs Belovs, CQCS),
- HQCC - Hybrid Quantum-Classical Computation (coordinated by Andris Ambainis, CQCS),
- QuantHEP - Quantum Algorithms for High Energy Physics (coordinated by Institute of Telecommunications, Lisbon)
and the postdoctoral researcher will be able to participate in these projects.

The appointment would be for 2 years. The starting date is flexible, between September 1, 2022 and January 1, 2023.

Applicants should send their CV (including contact data of possible references) to Andris Ambainis (, by March 1, 2022. Late applications may be considered if the position is not filled.