Quantum Integration Networks for Efficient Monte Carlo in High-Energy Physics

• URL: http://arxiv.org/abs/2510.10501v1
• Date: Sun, 12 Oct 2025 08:48:19 GMT
• Title: Quantum Integration Networks for Efficient Monte Carlo in High-Energy Physics
• Authors: Heechan Yi, Kayoung Ban, Myeonghun Park, Kyoungchul Kong,
• Abstract summary: Quantum circuits can achieve rich expressivity with fewer parameters.<n>We investigate how sampling strategies and loss functions affect integration efficiency within the textbfQuantum Integration Network (QuInt-Net)<n>The results provide new insights into optimizing QuInt-Nets for applications in high energy physics.
• Score: 2.5315729179239637
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Monte Carlo methods play a central role in particle physics, where they are indispensable for simulating scattering processes, modeling detector responses, and performing multi-dimensional integrals. However, traditional Monte Carlo methods often suffer from slow convergence and insufficient precision, particularly for functions with singular features such as rapidly varying regions or narrow peaks. Quantum circuits provide a promising alternative: compared to conventional neural networks, they can achieve rich expressivity with fewer parameters, and the parameter-shift rule provides an exact analytic form for circuit gradients, ensuring precise optimization. Motivated by these advantages, we investigate how sampling strategies and loss functions affect integration efficiency within the \textbf{Quantum Integration Network} (QuInt-Net). We compare adaptive and non-adaptive sampling approaches and examine the impact of different loss functions on accuracy and convergence. Furthermore, we explore three quantum circuit architectures for numerical integration: the data re-uploading model, the quantum signal processing protocol, and deterministic quantum computation with one qubit. The results provide new insights into optimizing QuInt-Nets for applications in high energy physics.

Related papers

• Cavity Mediated Two-Qubit Gate: Tuning to Optimal Performance with NISQ Era Quantum Simulations [0.019999259391104387]
  We study the case of cavity mediated two-qubit gates.<n>We implement simulations with quantum circuits that are able to reliably track the dynamics of the system.<n>Our quantum algorithm, compatible with NISQ (Noisy Intermediate Scale Quantum) era systems, allows us to map out the fidelity of the state transfer operation between qubits.
  arXiv  Detail & Related papers  (2025-12-12T20:43:42Z)
• Grassmann Variational Monte Carlo with neural wave functions [45.935798913942904]
  We formalize the framework introduced by Pfau et al.citepfau2024accurate in terms of Grassmann geometry of the Hilbert space.<n>We validate our approach on the Heisenberg quantum spin model on the square lattice, achieving highly accurate energies and physical observables for a large number of excited states.
  arXiv  Detail & Related papers  (2025-07-14T13:53:13Z)
• Looking elsewhere: improving variational Monte Carlo gradients by importance sampling [41.94295877935867]
  Neural-network quantum states (NQS) offer a powerful and expressive ansatz for representing quantum many-body wave functions.<n>It is well known that some scenarios - such as sharply peaked wave functions emerging in quantum chemistry - lead to high-variance gradient estimators hindering the effectiveness of variational optimizations.<n>In this work we investigate a systematic strategy to tackle those sampling issues by means of adaptively tuned importance sampling.<n>Our approach can reduce the computational cost of vanilla VMC considerably, up to a factor of 100x when targeting highly peaked quantum chemistry wavefunctions.
  arXiv  Detail & Related papers  (2025-07-07T18:00:03Z)
• Unlocking Multi-Dimensional Integration with Quantum Adaptive Importance Sampling [0.0]
  We introduce a quantum algorithm that performs Quantum Adaptive Importance Sampling (QAIS) for Monte Carlo integration of multidimensional functions.<n>As an application, we look at a very sharply peaked loop Feynman integral and at multi-modal benchmark integrals.
  arXiv  Detail & Related papers  (2025-06-24T19:19:06Z)
• Surrogate-guided optimization in quantum networks [0.9148747049384086]
  We propose an optimization algorithm to improve the design and performance of quantum communication networks. Our framework allows for more comprehensive quantum network studies, integrating surrogate-assisted optimization with existing quantum network simulators.
  arXiv  Detail & Related papers  (2024-07-24T11:55:18Z)
• Gravitational-wave matched filtering on a quantum computer [0.0]
  We show the first experimental demonstration of qubit-based matched filtering for a detection of the gravitational-wave signal from a binary black hole merger. With our implementation on superconducting qubits, we obtained a similar signal-to-noise ratio for the binary black hole merger as achievable with classical computation.
  arXiv  Detail & Related papers  (2022-04-08T16:08:40Z)
• Bosonic field digitization for quantum computers [62.997667081978825]
  We address the representation of lattice bosonic fields in a discretized field amplitude basis. We develop methods to predict error scaling and present efficient qubit implementation strategies.
  arXiv  Detail & Related papers  (2021-08-24T15:30:04Z)
• Quantum algorithms for quantum dynamics: A performance study on the spin-boson model [68.8204255655161]
  Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator. variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware. We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
  arXiv  Detail & Related papers  (2021-08-09T18:00:05Z)
• Adaptive pruning-based optimization of parameterized quantum circuits [62.997667081978825]
  Variisy hybrid quantum-classical algorithms are powerful tools to maximize the use of Noisy Intermediate Scale Quantum devices. We propose a strategy for such ansatze used in variational quantum algorithms, which we call "Efficient Circuit Training" (PECT) Instead of optimizing all of the ansatz parameters at once, PECT launches a sequence of variational algorithms.
  arXiv  Detail & Related papers  (2020-10-01T18:14:11Z)
• Autoregressive Transformer Neural Network for Simulating Open Quantum Systems via a Probabilistic Formulation [5.668795025564699]
  We present an approach for tackling open quantum system dynamics. We compactly represent quantum states with autoregressive transformer neural networks. Efficient algorithms have been developed to simulate the dynamics of the Liouvillian superoperator.
  arXiv  Detail & Related papers  (2020-09-11T18:00:00Z)
• Neural Control Variates [71.42768823631918]
  We show that a set of neural networks can face the challenge of finding a good approximation of the integrand. We derive a theoretically optimal, variance-minimizing loss function, and propose an alternative, composite loss for stable online training in practice. Specifically, we show that the learned light-field approximation is of sufficient quality for high-order bounces, allowing us to omit the error correction and thereby dramatically reduce the noise at the cost of negligible visible bias.
  arXiv  Detail & Related papers  (2020-06-02T11:17:55Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.