SCCS Colloquium

The SCCS Colloquium is a forum giving students, guests, and members of the chair the opportunity to present their research insights, results, and challenges. Do you need ideas for your thesis topic? Do you want to meet your potential supervisor? Do you want to discuss your research with a diverse group of researchers, rehearse your conference talk, or simply cheer for your colleagues? Then this is the right place for you (and you are also welcome to bring your friends along).

Upcoming talks

Rajat Arunachala Chandavar: Exponential Advantage in Symmetry Classification using Quantum Enhanced Algorithms

SCCS Colloquium |


The identification of different types of symmetries in an unknown quantum process is a crucial step in understanding its dynamics. Typically, this is achieved by iteratively performing the following steps: preparation of an initial state, evolution of the state over the process, and measurement of the evolved state. Such conventional algorithms require an exponential number of accesses to the process in terms of the number of qubits. Recently, a more efficient quantum-enhanced algorithm has been proposed. This algorithm stores quantum information about the evolved state using a quantum memory. This enables the possibility of multiple accesses to the quantum process before measurement, unlike conventional algorithms that require a measurement after each access. Building on previous work, this thesis extends the quantum-enhanced algorithm to classify different forms of time-reversal and particle-hole symmetry in an unknown quantum process. We theoretically prove that this algorithm has constant complexity in terms of number of accesses, offering an exponential advantage over conventional algorithms. By implementing it on a quantum simulator, we validate its functionality and demonstrate that even in the presence of noise in the quantum process, we can achieve symmetry classification with a reasonable number of accesses. These results highlight how utilizing quantum computational resources dramatically enhances our ability to learn symmetries.

Master thesis presentation. Rajat is advised by Niclas Schillo (Fraunhofer IAO) and Prof. Dr. Christian Mendl.


You don't want to miss a talk? Subscribe to our mailing list and our Colloquium calendar .

Contribute a talk

To register and schedule a talk, you should fill the form Colloquium Registration at least two weeks before the earliest preferred date. Keep in mind that we only have limited slots, so please plan your presentation early. In special cases, contact colloquium@mailsccs.in.tum.de.

Colloquium sessions are now on-campus. We have booked room MI 02.07.023 for SS2024. You can either bring your own laptop or send us the slides as a PDF ahead of time. The projector only has an HDMI connection, so please bring your own adapters if necessary.

Do you want to attend but cannot make it in person? We now have a hybrid option. Simply join us through this BBB room: https://bbb.in.tum.de/shu-phv-eyq-rad

We invite students doing their Bachelor's or Master's thesis, as well as IDP, Guided Research, or similar projects at SCCS to give one 20min presentation to discuss their results and potential future work. The time for this is typically after submitting your final text. Check also with your study program regarding any requirements for a final presentation of your project work.

New: In regular times, we will now have slots for presenting early stage projects (talk time 2-10min). This is an optional opportunity for getting additional feedback early and there is no strict timeline.

Apart from students, we also welcome doctoral candidates and guests to present their projects.

During the colloquium, things usually go as follows:

  • 10min before the colloquium starts, the speakers setup their equipment with the help of the moderator. The moderator currently is Ana Cukarska. Make sure to be using an easily identifiable name in the online session's waiting room.
  • The colloquium starts with an introduction to the agenda and the moderator asks the speaker's advisor/host to put the talk into context.
  • Your talk starts. The scheduled time for your talk is normally 20min with additional 5-10min for discussion.
  • The moderator keeps track of the time and will signal 5 min before the end of time.
  • During the discussion session, the audience can ask questions, which are meant for clarification or for putting the talk into context. The audience can also ask questions in the chat.
  • Congratulations! Your talk is over and it's now time to celebrate! Have you already tried the parabolic slides that bring you from the third floor to the Magistrale?

Do you remember a talk that made you feel very happy for attending? Do you also remember a talk that confused you? What made these two experiences different?

Here are a few things to check if you want to improve your presentation:

  • What is the main idea that you want people to remember after your presentation? Do you make it crystal-clear? How quickly are you arriving to it?
  • Which aspects of your work can you cover in the given time frame, with a reasonable pace and good depth?
  • What can you leave out (but maybe have as back-up slides) to not confuse or overwhelm the audience?
  • How are you investing the crucial first two minutes of your presentation?
  • How much content do you have on your slides? Is all of it important? Will the audience know which part of a slide to look at? Will somebody from the last row be able to read the content? Will somebody with limited experience in your field have time to understand what is going on?
  • Are the figures clear? Are you explaining the axes or any other features clearly?

In any case, make sure to start preparing your talk early enough so that you can potentially discuss it, rehearse it, and improve it.

Here are a few good videos to find out more:

Did you know that the TUM English Writing Center can also help you with writing good slides?

Work with us!

Do your thesis/student project in Informatics / Mathematics / Physics: Student Projects at the SCCS.