I work on extending the results of my Honours Project (BSc thesis), where based on existing work, I designed a new classical (non-quantum) algorithm that can efficiently generate samples from an ideal shallow (logarithmic depth) Boson Sampling experiment. I am looking for ways to make this algorithm more efficient, especially by reuse of partial results, in the sense of dynamic programming.Boson Sampling is a Quantum Optical experiment that is considered one of the possibilities to demonstrate Quantum Advantage. Classically generating samples, that is simulating the process on a non-quantum computer, is important to verify the experiment, as well as to set the bar higher for Quantum Advantage.

For the second year now, I hold Teaching Support roles in the course "INF2C Introduction to Computer Systems" for second year Informatics students. This is a course introducing the students to digital computing systems, architecture, and the interface between hardware and software.As a Tutor, I hold in person tutorial sessions for a group of students, where I help them understand the material presented in the lectures. We typically go over a sheet of problems for that particular week, and students attempt to solve these, ask questions about anything that puzzles them, and I am there to steer them towards understanding. The tutorials focus on the conceptual understanding.As a Demonstrator, I hold online programming labs, where students can get 1-on-1 support with their lab exercises, as well as advice with assessed coursework. This is the practical aspect of the course, and here I help students learn how to program in MIPS assembly, as well as C. As Demonstrator, I also give some early feedback on the coursework prior to its release.A part of the roles is also supporting the students online, answering questions on the online Q&A forum of the course.

I worked with Sam Lindley and Daniel Hillerström in the Links programming language group within the Laboratory for the Foundations of Computer Science. I implemented a new pretty printer for types that produces output successfully parsed by Links, and I worked on the syntactic sugar for the Type & Effect system of Links. I contributed also example and benchmark programs in Links, ultimately implementing a handler-heavy solution of the N-body problem. After finishing the internship, I also presented my work the research group.