Hey!

I’m Tom Magorsch, I’m a physicist mainly interested in Particle Phenomenology, and the application of Machine Learning and Quantum Computing to HEP problems.
  • Currently I am at the TU Munich working on non-equilibrium physics in heavy ion collisions and new computational techniques to treat them.
  • Also, I am part of the ML4SCI-Organization, where I participated in Google Summer of Code.
  • We have a little project going on over at sheepanddice.de which I sometimes work on in my free time
News:

Gradient estimator in Variational Monte Carlo

I recently tried to derive the formula for the gradient estimator in Variational Monte Carlo and got confused trying to obtain the common covariance formula $\partial_\Theta\braket{E} = 2\text{Re}\text{Cov}[(\partial_\Theta\log\psi)^*, E_l]$ in the case of complex wavefunctions. At first, to me it seemed like the direct derivative of the estimator was missing (which vanishes for real wavefunctions). Indeed most derivations in the literature seem to assume real wavefunctions, however it turns out this direct part gives a similar term included in the score based part which eventually lets us simplify the estimator to the real part of the covariance formula. Since I found the full derivation non-trivial I will give it here in case anyone else out there is confused as well. ...

February 12, 2025 · 5 min · Tom Magorsch

Bottomonium suppression as an open quantum system

We recently put out a paper on bottomonium suppression in the quark gluon plasma 2403.15545. This is a project I’ve been working on for some time now and I want to show real quick what we have been doing. Quarkonium suppression Heavy ion collisions are experiments where two heavy nuclei are collided. Such experiments are conducted e.g. at CERN. In these collisions a state of matter called the quark gluon plasma is created. The quark gluon plasma is a hot liquid like state of matter, where light quarks, the fundamental building blocks of matter do bind to composite particles. Such a condition is assumed to have existed in the early universe shortly after the big bang, where matter was condensed to a tight space. ...

April 11, 2024 · 5 min · Tom Magorsch

GSoC 23 | Quantum Generative Adversarial Networks for HEP event generation the LHC

This is a summary of my 2023 GSoC project with the ML4SCI-organization. In my project I designed and implemented a Quantum Generative Adversarial Network for the generation of HEP experiment data. The full code for all my work can be found on Github. In the following post I will outline my work and describe some parts of the implementation and the results Event generation in HEP experiments In high energy physics experiements like they are conducted at CERN, an integral part of the analysis process is the comparison of measurements with results expected based on predictions from our theory of nature, the Standard Model of particle physics. Generating these predictions is usually done by Monte Carlo simulations. Since these simulations are very demaning, there has been a vast amount of work on generative machine learning models e.g. (No matching key was found for `Oliveira2017` in the references. Please make sure to provide an available ID in your `bib.json` file.No matching key was found for `Butter2019` in the references. Please make sure to provide an available ID in your `bib.json` file.No matching key was found for `Hariri2021` in the references. Please make sure to provide an available ID in your `bib.json` file.) . The main incentive is to speed up the simulation process by training a generative model like a GAN, from which one can then cheaply sample from. ...

October 12, 2023 · 8 min · Tom Magorsch

Quantum GANs

This year I’m participating in the Google Summer of Code again. Just like last year I’m working with the ML4SCI organization. In this years project I am working on Quantum Generative Adversarial Networks. GANs Generative Adversarial Networks (GANs) are a class of unsupervised machine learning models proposed in (No matching key was found for `Goodfellow2014` in the references. Please make sure to provide an available ID in your `bib.json` file.) . GANs aim to train a generator $G(z,\Theta_g)$ with a latent space $z$ and parameters $\Theta_g$ to replicate a reference probability distribution when sampling from the latent space $z$. ...

July 29, 2023 · 8 min · Tom Magorsch

NERSC Open Hackathon 2022 | Multi-GPU quantum circuit simulation in Pennylane

The past month I have been participating in the NERSC Open Hackathon hosted together with NVIDIA. Throughout the event we had access to the Perlmutter compute system and worked together with mentors on scaling our scientific software projects on GPUs. During the event I worked on scaling the training of VQCs in Pennylane to multiple GPUs. A word of thanks goes to the organizers and all the mentors who helped us throghout the event. ...

December 18, 2022 · 5 min · Tom Magorsch

GSoC 22 | Quantum Autoencoders for HEP Analysis at the LHC

This is a summary of my 2022 GSoC project with ML4SCI. The ML4SCI organization accustoms different projects of machine learning applied to scientific problems, many connected to high-energy physics. A big thank you to Sergei Gleyzer for the supervision and support. Abstract The Standard Model of particle physics is a theory that describes the fundamental particles and the interactions between them. While it has extensively been tested and was able to correctly predict experiments to an impressive degree, there are multiple reasons to believe that it cannot be a complete description of nature. In the search for physics beyond the Standard Model (BSM), even though the large hadron collider (LHC) produced a large amount of data, no conclusive evidence of new physics could be found yet. A promising method to uncover new physics in the large amount of data is the use of anomaly detection techniques, which can be used to tag anomalous events. A well-known method of deep anomaly detection is the use of autoencoders, which have been applied to the task of anomaly tagging in HEP data before. In my project study the use of quantum machine learning models for the task of anomaly tagging, to investigate if quantum computers can enhance these analyses. ...

September 21, 2022 · 14 min · Tom Magorsch

Data re-uploading

An important motivation for deep learning was the Universal Approximation Theorem which shows, that neural networks can theoretically approximate any function. When it comes to quantum machine learning, a similar statement can be made. Surprisingly a single qubit is sufficient, to perform the classification of arbitrary data distributions. Universal Approximation Theorem The Universal Approximation Theorem (there are many versions with different constraints) states that the functions which can be expressed by a neural network with a single hidden layer and arbitrarily many units are dense in the space of continuous functions. Considering a classification problem, we might have functions $f: I_m \to \Reals$, where $I_m = [0,1]^m$. The output of a neural network with a single hidden layer may be written as $$h(\vec{x}) = \sum^{N}_{i=1}\alpha_i\sigma(\vec{w}_i\vec{x} + b_i), \tag{1}$$ where $\vec{w}_i$ and $b_i$ are the weights and biases of the hidden layer and $\alpha_i$ the weights of the output layer. The function $\sigma$ is the non-linear activation function. The function $h$ being dense in the continuous functions $f$ means, that for every $\epsilon$ we can choose the parameters in Eq. $(1)$ so that $$|h(\vec{x}) - f(\vec{x})| < \epsilon \ \ \text{for all} \ \ \vec{x}.$$ This is a very powerful statement and enables neural networks to tackle very complex problems. ...

September 15, 2022 · 8 min · Tom Magorsch

Quantum Natural Gradient Descent

When training Variational Quantum Algorithms we aim to find a point in the parameter space that minimizes a particular cost function, just like in the case of classical deep learning. Using the parameter-shift rule, we are able to compute the gradient of a Parametrized Quantum Circuit (PQC) and can therefore use that gradient descent method proven in classical machine learning. However vanilla gradient descent can face difficulties in practical training which can be circumvented with Quantum Natural Gradient Descent (QNG). ...

August 27, 2022 · 7 min · Tom Magorsch

Quantum Autoencoder

In my GSoC project, I explore the use of Quantum Autoencoders for the analysis of LHC data. Autoencoders are an unsupervised learning technique, which learns a smaller latent representation of data. The quantum analog of a classical autoencoder equally aims to learn a smaller representation of data. A naive Quantum Autoencoder My first idea for a Quantum circuit closely follows the architecture of a classical autoencoder. The structure of the circuit is conceptually sketched in the following figure. Here the Autoencoder has an input dimension of three and compresses the data to a single qbit. ...

July 12, 2022 · 6 min · Tom Magorsch

Hello World! | Hello GSoC!

This year I’m participating in the Google Summer of Code with the ML4SCI organization. My project proposal deals with a quantum variational autoencoder (QVAE) for the anaysis of particle physics data. Such unsupervised learning paradigms can be used to search for new physics in a model-agnostic way (No matching key was found for `Kasieczka2021` in the references. Please make sure to provide an available ID in your `bib.json` file.) . These models are thereby trained on Standard Model data and search for anomalous events that deviate from the known physics. With the rise of NISQ-devices (No matching key was found for `Preskill2018` in the references. Please make sure to provide an available ID in your `bib.json` file.) the question comes up if quantum machine learning can enhance classical machine learning applications to hep problems. ...

June 12, 2022 · 1 min · Tom Magorsch