Orientation Team Project 25’/’26
Project List
Below are the possible projects your team can work on. Some projects can be worked
on by di9erent groups simultaneously, others are a ‘one-team-only’ kind of project.
Each project has a client that you will be working for (simulated).
Note: you will not be judged on the content of the project, but on the quality of the final
report and presentation (again, not the content of the presentation). Rubrics are
available on Brightspace, but for your mental picture: this course is about developing
skills in teamwork, report writing and presenting. The evaluation happens based on
these, and on the process of working on it (and the project, via an Agile approach).
These projects are listed in arbitrary order.
Project 1: Quantum operation of SnV in diamond
Contacts: Ryoichi Ishihara (R.Ishihara@tudelft.nl, TU Delft)
Tin vacancy (SnV) in diamond have recently attracted attention because of highly efficient
single photon emission. Here the fidelity of spin control is a very important characteristic
value to realize a large-scale quantum computing chip based on the spins in diamond.
The project will characterize the fidelity of quantum operation using SnV in diamond using
pulsed green laser and microwave.First photo-luminescence will be observed from SnV in
diamond and then Rabi oscillation measurement will be performed.
By optimizing measurement setup and microwave pulse shape, the goal is to achieve a
fidelity of >90% using SnV in diamond.
Project 2: Optimizing Stabilizer Quantum Circuits via Minimal Paths on Cayley
Graphs
Contacts: Muhammad Mahmoud (m.o.mahmoud@liacs.leidenuniv.nl), Dimitrios
Thanos (d.thanos@liacs.leidenuniv.nl)
Introduction:
Stabilizer circuits—also known as Clifford circuits—are non-universal quantum circuits
composed of gates from the Clifford group. Quantum gates are mathematically
represented by linear operators, and the Clifford group, being finitely generated, has a
representation as a Cayley graph. Any quantum circuit maps an initial quantum state to a
final state. At the Cayley graph level, this can be viewed as a path between two of its
vertices. Finding a shorter path between the two vertices corresponds to circuit
optimization: reducing the number of gates while preserving the circuit’s overall function.
Such techniques have been effectively applied to CNOT circuits [a]. Although analyzing
more complex circuits leads to prohibitively large Cayley graphs, certain subgroups of the
Clifford group have a manageable size and incorporate a richer set of gates beyond
CNOT [b].
Project Goal:
This project aims to generate and analyze Cayley graphs corresponding to selected,
computationally manageable Clifford subgroups. The student will design and implement
an algorithm that takes a Clifford circuit as input and outputs an optimized version by
identifying a minimal-length path in the associated Cayley graph.
Requirements:
• The student should be able to implement the algorithm using the programming
language of his/her choice.
• A basic understanding of quantum computing principles.
Optional Background:
• Familiarity with basic group theory is beneficial for understanding the algebraic
structures involved.
[a] https://arxiv.org/pdf/2503.01467
[b] https://arxiv.org/pdf/2306.01043
Project 3: A modular Quantum Processing Unit
Contacts: Nadia Haider(S.N.Haider@tudelft.nl , TU Delft)
The aim of this project is to develop a solution that supports the advancement of
modular quantum processing units (QPUs), paving the way for scalable quantum
computing. As the number of qubits increases, so does the likelihood of encountering
faults or performance issues. This growing challenge is driving both the scientific
community and industry to explore modular, multi-chip QPU architectures as an
alternative to monolithic chip designs. The primary objective of this project is to
review various approaches to modular multi-chip QPUs, conduct a comparative
analysis, and propose a suitable solution tailored to superconducting qubit
technology.
Project 4: The Qbead: putting a qubit in everybody's hands
Contacts: Carlos Errando Herranz (C.ErrandoHerranz@tudelft.nl, TU Delft)
Quantum mechanics is hard to understand. That is why we have develped the Qbead:
a small open-source gadget that emulates a qubit. The Qbead visualizes a Bloch
sphere with LEDs representing qubit states and quantum gates generated by hand
movement. In this OTP project you will code new experiments including coherence
measurements or entanglement operations, and develop educational lectures to
explain them.
Project 5: Bound entanglement on a quantum processor
Contacts: Wolfgang LoeSler (loe9ler@physics.leidenuniv.nl, Leiden)
Bound entanglement is a strange form of quantum entanglement - because
distillation of pure entanglement is not possible. These states have probably never
been created and analyzed on a modern quantum processor. A possible plan: First,
learn briefly what PPT and bound entanglement is, then try to make an algorithm (with
partial trace) on a quantum simulator. Probably for the Smolin state (smolin2001) or
divincenzo2000. nordling2010 contains a lot of information.
smolin2001, Four-party unlockable bound entangled
state, http://dx.doi.org/10.1103/PhysRevA.63.032306
divincenzo2000, Evidence for bound entangled states with negative partial
transpose, http://dx.doi.org/10.1103/physreva.61.062312
nordling2010, Generation of the Bound Entangled Smolin State and Entanglement
Witnesses for Low-Dimensional Unitary Invariant
States, https://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-130039
Project 6: Hopfield Networks and the Ising model
Contacts: Björn van Zwol (b.e.van.zwol@liacs.leidenuniv.nl)
The Hopfield Network is an essential type of ‘neural’ network architecture that led to
many breakthroughs in Machine Learning (for which Hopfield was awarded the Nobel
Prize in 2024). It is in many ways equivalent to a physics toy model that is used to
describe magnets (the Ising model), and extensions of the latter eventually led to
Boltzmann machines (the other half of the 2024) Nobel Prize. This project is about
exploring those parallels further, and about gamifying the ‘pattern encoding’ in a
Hopfield network or an Ising model.
Project 7: Javascript quantum game engine
Contacts: Evert van Nieuwenburg (e.p.l.van.nieuwenburg@liacs.leidenuniv.nl)
As quantum games are becoming more and more of an active area, being able to
quickly prototype and run them in browsers becomes a must. In particular, for
quantum games that use simulations of quantum systems under the hood, a flexible
simulator for quantum games needs to be developed. This project will explore
existing approaches (Quantum Forge, Unitary, javascript quantum engines), and use
them to develop a flexible design to a JS quantum game engine.
Project 8: Rock-Paper-Scissors quantum game
Contacts: Marien Raat (raat@lorentz.leidenuniv.nl)
This project is about investigating changes to the Nash Equilibrium for Rock-PaperScissors if both players share an entangled qutrit. Your first steps are to get an
introduction to game theory (Nash equilibria), then the quantum extension (Quantum
Prisonner’s Dilemma), and then repeating the Prisonner’s Dilemma for the game of
Rock-Paper-Scissors.
Project 9: Quantum Intro via Interactive Jupyter Notebook and Battleships
Contacts: Ilse Kuijf (kuijf@lorentz.leidenuniv.nl)
This project aims to develop 2 or 3 interactive jupyter notebooks to teach basic
quantum principles using a game (doesn’t have to be Battleships). The first notebook
should guide the users to making the classical version
Project 10: Quantum Game of Life
Contacts: Jan Krzywda (j.a.krzywda@liacs.leidenuniv.nl)
Conway’s Game of Life has become a fruitful research subject, and is an example of
automata and emergent behaviour. This project is about exploring quantum
extensions of this type of game, and how it relates to computational advantage, new
algorithms and simulations of quantum systems.