Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Journal of Physics Conference Series

Generating muonic force carriers events with classical and quantum neural networks

Tigran Ramazyan, Oriel Kiss, Michele Grossi, E. Kajomovitz, Sofia Vallecorsa

Published Feb 1, 2023• 1 citation
Publisher

Abstract

Abstract Generative models (GM) are promising applications for near-term quantum computers due to the probabilistic nature of quantum mechanics. This work compares a classical conditional generative adversarial network (CGAN) with a quantum circuit Born machine while addressing their strengths and limitations to generate muonic force carriers (MFCs) events. The former uses a neural network as a discriminator to train the generator, while the latter takes advantage of the stochastic nature of measurements in quantum mechanics to generate samples. We consider a muon fixed-target collision between muons produced at the high-energy collisions of the LHC and the detector material of the ForwArd Search ExpeRiment (FASER) or the ATLAS calorimeter. In the ATLAS case, independent muon measurements performed by the inner detector (ID) and muon system (MS) can help observe new force carriers coupled to muons, which are usually not detected. We numerically observed that CGANs could reproduce the complete data set and interpolate to different regimes. Moreover, we show on a simplified problem that Born machines are promising generative models for near-term quantum devices.

DOI
10.1088/1742-6596/2438/1/012089

Related papers

Conditional Born machine for Monte Carlo event generation

Oriel Kiss, Michele Grossi, E. Kajomovitz +1 more

Generative modeling is a promising task for near-term quantum devices, which can use the stochastic nature of quantum measurements as a random source. So-called Born machines are purely quantum models and promise to generate probability distributions in a quantum way, inaccessible to classical computers. This paper presents an application of Born machines to Monte Carlo simulations and extends their reach to multivariate and conditional distributions. Models are run on (noisy) simulators and IBM Quantum superconducting quantum hardware. More specifically, Born machines are used to generate muonic force carrier (MFC) events resulting from scattering processes between muons and the detector material in high-energy physics collider experiments. MFCs are bosons appearing in beyond-the-standard-model theoretical frameworks, which are candidates for dark matter. Empirical evidence suggests that Born machines can reproduce the marginal distributions and correlations of data sets from Monte Carlo simulations.

arXiv:2205.07674•Physical Review A•Aug 22, 2022•25 citations

Learning and inference on generative adversarial quantum circuits

Jinfeng Zeng, Yufeng Wu, Jin-Guo Liu +2 more

Quantum mechanics is inherently probabilistic in light of Born's rule. Using quantum circuits as probabilistic generative models for classical data exploits their superior expressibility and efficient direct sampling ability. However, training of quantum circuits can be more challenging compared to classical neural networks due to the lack of an efficient differentiable learning algorithm. We devise an adversarial quantum-classical hybrid training scheme via coupling a quantum circuit generator and a classical neural network discriminator together. After training, the quantum circuit generative model can infer missing data with quadratic speed-up via amplitude amplification. We numerically simulate the learning and inference of generative adversarial quantum circuits using the prototypical bars-and-stripes dataset. Generative adversarial quantum circuits are a fresh approach to machine learning which may enjoy the practically useful quantum advantage of near-term quantum devices.

arXiv:1808.03425•Physical Review A•May 6, 2019•99 citations

A Full Quantum Generative Adversarial Network Model for High Energy Physics Simulations

Florian Rehm, Sofia Vallecorsa, Michele Grossi +2 more

Abstract The prospect of quantum computing with a potential exponential speed-up compared to classical computing identifies it as a promising method in the search for alternative future High Energy Physics (HEP) simulation approaches. HEP simulations, such as employed at the Large Hadron Collider at CERN, are extraordinarily complex and require an immense amount of computing resources in hardware and time. For some HEP simulations, classical machine learning models have already been successfully developed and tested, resulting in several orders of magnitude speed-up. In this research, we proceed to the next step and explore whether quantum computing can provide sufficient accuracy, and further improvements, suggesting it as an exciting direction of future investigations. With a small prototype model, we demonstrate a full quantum Generative Adversarial Network (GAN) model for generating downsized eight-pixel calorimeter shower images. The advantage over previous quantum models is that the model generates real individual images containing pixel energy values instead of simple probability distributions averaged over a test sample. To complete the picture, the results of the full quantum GAN model are compared to hybrid quantum-classical models using a classical discriminator neural network.

arXiv:2305.07284•Journal of Physics Conference Series•Apr 1, 2026•12 citations

Differentiable learning of quantum circuit Born machines

Jin-Guo Liu, Lei Wang

Quantum circuit Born machines are generative models which represent the probability distribution of classical dataset as quantum pure states. Computational complexity considerations of the quantum sampling problem suggest that the quantum circuits exhibit stronger expressibility compared to classical neural networks. One can efficiently draw samples from the quantum circuits via projective measurements on qubits. However, similar to the leading implicit generative models in deep learning, such as the generative adversarial networks, the quantum circuits cannot provide the likelihood of the generated samples, which poses a challenge to the training. We devise an efficient gradient-based learning algorithm for the quantum circuit Born machine by minimizing the kerneled maximum mean discrepancy loss. We simulated generative modeling of the BARS-AND-STRIPES dataset and Gaussian mixture distributions using deep quantum circuits. Our experiments show the importance of circuit depth and the gradient-based optimization algorithm. The proposed learning algorithm is runnable on near-term quantum device and can exhibit quantum advantages for probabilistic generative modeling.

arXiv:1804.04168•Physical Review A•Dec 19, 2018•337 citations

Quantum generative models

Andrea Delgado, Kathleen E. Hamilton

Quantum generative models harness the probabilistic nature of quantum mechanics to represent and learn complex distributions, offering a novel framework for both classical and quantum data modeling. This chapter introduces foundational architectures such as quantum circuit Born machines, quantum generative adversarial networks, and variational autoencoders, emphasizing their expressivity, training methods, and applications. We explore use cases ranging from anomaly detection to spectral function sampling and discuss key challenges including trainability, noise, and evaluation metrics. The chapter concludes by outlining opportunities for quantum advantage in generative tasks and highlighting emerging strategies for scalable, noise-resilient model training on near-term quantum devices.

Institute of Physics eBooks•Dec 1, 2025•0 citations

A Quantum Generative Adversarial Network model for the Simulation of LHC Calorimeter Data

PHILIP CORSINI

Quantum Computing has emerged as a viable alternative to classical computing for a number of different tasks, with the idea of a potential speedup in mind. One of the most promising fields of research in quantum computing is Quantum Machine Learning. An interesting area of application for Quantum Machine Learning can be found in High Energy Physics: one key component of creating experiments in a particle accelerator like the Large Hadron Collider is the simulation of those experiments beforehand, in order to gain a better understanding of the results actually measured. Those types of simulations, typically based on Monte-Carlo methods, require significant computing resources and, as we approach CERN's High Luminosity Phase, there is a strong need for more efficient and cost controlled simulations. In this thesis a model based on Quantum Generative Adversarial Networks (QGANs) is implemented, with the intention of exploring potential quantum computing advantages within a hybrid machine learning model that is tasked with the generation of calorimeter samples. The model is initially trained on an ideal simulator to ensure that the results are comparable to those of a similar classical model. Finally, the model is modified in order to effectively run on a real quantum device and the training is executed in its entirety on a 54-qubit quantum processor.

•Apr 15, 2026•0 citations
Abstract Generative models (GM) are promising applications for near-term quantum computers due to the probabilistic nature of quantum mechanics. This work compares a classical conditional generative adversarial network (CGAN) with a quantum circuit Born machine while addressing their strengths and limitations to generate muonic force carriers (MFCs) events. The former uses a neural network as a discriminator to train the generator, while the latter takes advantage of the stochastic nature of measurements in quantum mechanics to generate samples. We consider a muon fixed-target collision between muons produced at the high-energy collisions of the LHC and the detector material of the ForwArd Search ExpeRiment (FASER) or the ATLAS calorimeter. In the ATLAS case, independent muon measurements performed by the inner detector (ID) and muon system (MS) can help observe new force carriers coupled to muons, which are usually not detected. We numerically observed that CGANs could reproduce the complete data set and interpolate to different regimes. Moreover, we show on a simplified problem that Born machines are promising generative models for near-term quantum devices.
Generative modeling is a promising task for near-term quantum devices, which can use the stochastic nature of quantum measurements as a random source. So-called Born machines are purely quantum models and promise to generate probability distributions in a quantum way, inaccessible to classical computers. This paper presents an application of Born machines to Monte Carlo simulations and extends their reach to multivariate and conditional distributions. Models are run on (noisy) simulators and IBM Quantum superconducting quantum hardware. More specifically, Born machines are used to generate muonic force carrier (MFC) events resulting from scattering processes between muons and the detector material in high-energy physics collider experiments. MFCs are bosons appearing in beyond-the-standard-model theoretical frameworks, which are candidates for dark matter. Empirical evidence suggests that Born machines can reproduce the marginal distributions and correlations of data sets from Monte Carlo simulations.
Quantum mechanics is inherently probabilistic in light of Born's rule. Using quantum circuits as probabilistic generative models for classical data exploits their superior expressibility and efficient direct sampling ability. However, training of quantum circuits can be more challenging compared to classical neural networks due to the lack of an efficient differentiable learning algorithm. We devise an adversarial quantum-classical hybrid training scheme via coupling a quantum circuit generator and a classical neural network discriminator together. After training, the quantum circuit generative model can infer missing data with quadratic speed-up via amplitude amplification. We numerically simulate the learning and inference of generative adversarial quantum circuits using the prototypical bars-and-stripes dataset. Generative adversarial quantum circuits are a fresh approach to machine learning which may enjoy the practically useful quantum advantage of near-term quantum devices.
Abstract The prospect of quantum computing with a potential exponential speed-up compared to classical computing identifies it as a promising method in the search for alternative future High Energy Physics (HEP) simulation approaches. HEP simulations, such as employed at the Large Hadron Collider at CERN, are extraordinarily complex and require an immense amount of computing resources in hardware and time. For some HEP simulations, classical machine learning models have already been successfully developed and tested, resulting in several orders of magnitude speed-up. In this research, we proceed to the next step and explore whether quantum computing can provide sufficient accuracy, and further improvements, suggesting it as an exciting direction of future investigations. With a small prototype model, we demonstrate a full quantum Generative Adversarial Network (GAN) model for generating downsized eight-pixel calorimeter shower images. The advantage over previous quantum models is that the model generates real individual images containing pixel energy values instead of simple probability distributions averaged over a test sample. To complete the picture, the results of the full quantum GAN model are compared to hybrid quantum-classical models using a classical discriminator neural network.
Quantum circuit Born machines are generative models which represent the probability distribution of classical dataset as quantum pure states. Computational complexity considerations of the quantum sampling problem suggest that the quantum circuits exhibit stronger expressibility compared to classical neural networks. One can efficiently draw samples from the quantum circuits via projective measurements on qubits. However, similar to the leading implicit generative models in deep learning, such as the generative adversarial networks, the quantum circuits cannot provide the likelihood of the generated samples, which poses a challenge to the training. We devise an efficient gradient-based learning algorithm for the quantum circuit Born machine by minimizing the kerneled maximum mean discrepancy loss. We simulated generative modeling of the BARS-AND-STRIPES dataset and Gaussian mixture distributions using deep quantum circuits. Our experiments show the importance of circuit depth and the gradient-based optimization algorithm. The proposed learning algorithm is runnable on near-term quantum device and can exhibit quantum advantages for probabilistic generative modeling.
Quantum generative models harness the probabilistic nature of quantum mechanics to represent and learn complex distributions, offering a novel framework for both classical and quantum data modeling. This chapter introduces foundational architectures such as quantum circuit Born machines, quantum generative adversarial networks, and variational autoencoders, emphasizing their expressivity, training methods, and applications. We explore use cases ranging from anomaly detection to spectral function sampling and discuss key challenges including trainability, noise, and evaluation metrics. The chapter concludes by outlining opportunities for quantum advantage in generative tasks and highlighting emerging strategies for scalable, noise-resilient model training on near-term quantum devices.
Quantum Computing has emerged as a viable alternative to classical computing for a number of different tasks, with the idea of a potential speedup in mind. One of the most promising fields of research in quantum computing is Quantum Machine Learning. An interesting area of application for Quantum Machine Learning can be found in High Energy Physics: one key component of creating experiments in a particle accelerator like the Large Hadron Collider is the simulation of those experiments beforehand, in order to gain a better understanding of the results actually measured. Those types of simulations, typically based on Monte-Carlo methods, require significant computing resources and, as we approach CERN's High Luminosity Phase, there is a strong need for more efficient and cost controlled simulations. In this thesis a model based on Quantum Generative Adversarial Networks (QGANs) is implemented, with the intention of exploring potential quantum computing advantages within a hybrid machine learning model that is tasked with the generation of calorimeter samples. The model is initially trained on an ideal simulator to ensure that the results are comparable to those of a similar classical model. Finally, the model is modified in order to effectively run on a real quantum device and the training is executed in its entirety on a 54-qubit quantum processor.