Open Theses
Interested Bachelor's and Master's students - the best way to discuss possible topics is to contact Prof. Gharibian directly. We do a mix of quantum and classical algorithms and complexity. Here are a few possible recent research directions; this list is not exhaustive.
| Topic | Project Type | Supervisor |
|---|---|---|
| Algorithms and hardness results for near-term noisy quantum computers | BT/MT | Sevag Gharibian |
| Algorithms and hardness results for photonic quantum systems | MT | Sevag Gharibian |
| Algorithms and hardness results for quantum chemistry | MT | Sevag Gharibian |
| Oracle complexity classes (P^NP and related classes) | BT/MT | Sevag Gharibian |
| Total search function complexity classes (TFNP and subclasses) | MT | Sevag Gharibian |