computational complexity

We are looking for motivated and talented PhD candidates and postdoctoral researchers for the Institute of Quantum Inspired and Quantum Computing headed by Martin Kliesch at the Hamburg University of Technology, Germany.

Research
The main goal is to explore the theoretical and mathematical foundations of quantum and quantum-inspired optimization.

This goal includes:

We are looking for motivated and talented PhD candidates and postdoctoral researchers for the Institute of Quantum Inspired and Quantum Computing headed by Martin Kliesch at the Hamburg University of Technology, Germany.

Research
The main goal is to explore the theoretical foundations of quantum and quantum-inspired optimization.
This goal includes:

We are looking for motivated and talented PhD students and postdoctoral researchers for the theoretical quantum computing research group of Prof. Martin Kliesch at the Hamburg University of Technology, Germany.

We value creativity, mathematical rigor, and openness to interdisciplinary collaborations.

The theoretical division of Quantum Algorithms, directed by Prof. Leandro Aolita, at the Quantum Research Centre (QRC) of the Technology Innovation Institute (TII), in Abu Dhabi, United Arab Emirates, together with the Quantum Technology Research Group, directed by Junior Professor Martin Kliesch, at the Theoretical Physics Department of the Heinrich-Heine University of Düsseldorf (HHU), Germany, is seeking a highly talented and motivated candidate for a PhD position in quantum algorithms and quantum computation theory. 

We are seeking an extremely well-qualified and motivated researcher at the postdoctoral level to work on notions of quantum system identification and near-term quantum computing. Possible topics include

- randomized benchmarking,
- quantum state and process tomography,
- Hamiltonian learning,
- noise estimation,
- shadow estimation,

- computational complexity,
- expressive power of quantum circuits, or
- applications of near-term quantum computers.

Pages

Subscribe to RSS - computational complexity