Flowing Through Hilbert Space: Quantum-Enhanced Generative Models for Lattice Field Theory

• URL: http://arxiv.org/abs/2505.10553v1
• Date: Thu, 15 May 2025 17:58:16 GMT
• Title: Flowing Through Hilbert Space: Quantum-Enhanced Generative Models for Lattice Field Theory
• Abstract summary: We develop a hybrid quantum-classical normalizing flow model to explore quantum-enhanced sampling in such regimes.<n>Our approach embeds parameterized quantum circuits within a classical normalizing flow architecture, leveraging amplitude encoding and quantum entanglement to enhance expressivity in the generative process.
• Score: 0.9208007322096533
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Sampling from high-dimensional and structured probability distributions is a fundamental challenge in computational physics, particularly in the context of lattice field theory (LFT), where generating field configurations efficiently is critical, yet computationally intensive. In this work, we apply a previously developed hybrid quantum-classical normalizing flow model to explore quantum-enhanced sampling in such regimes. Our approach embeds parameterized quantum circuits within a classical normalizing flow architecture, leveraging amplitude encoding and quantum entanglement to enhance expressivity in the generative process. The quantum circuit serves as a trainable transformation within the flow, while classical networks provide adaptive coupling and compensate for quantum hardware imperfections. This design enables efficient density estimation and sample generation, potentially reducing the resources required compared to purely classical methods. While LFT provides a representative and physically meaningful application for benchmarking, our focus is on improving the sampling efficiency of generative models through quantum components. This work contributes toward the development of quantum-enhanced generative modeling frameworks that address the sampling bottlenecks encountered in physics and beyond.

Related papers

• Learnable yet not simulable: a quantum resource theory of learning models [57.695822250391906]
  It remains unclear which quantum resource governs the classical learnability of quantum circuits.<n>We study the expectation-value functions of families of tunable quantum circuits.<n>These results establish a quantitative resource-theoretic framework for delineating the boundary between classical simulation and learning.
  arXiv  Detail & Related papers  (2026-08-03T14:48:03Z)
• Balancing Expressivity and Learnability in Quantum Kernel Bandit Optimization [50.880384999888044]
  We develop misspecified GP bandit algorithms and derive regret bounds that characterize the trade-off between approximation error and information gain.<n>Our methods outperform full quantum kernels in sample efficiency, while substantially reducing computational overhead.
  arXiv  Detail & Related papers  (2026-07-01T15:38:00Z)
• Trainable Quantum Channels as Computational Primitives for Quantum Learning [2.047424180164312]
  Variational quantum learning is traditionally constrained to unitary dynamics.<n>We establish a non-unitary quantum machine learning framework grounded in open-system dynamics.
  arXiv  Detail & Related papers  (2026-06-14T13:19:49Z)
• A Novel Hierarchy of Quantum Kernel Networks on Smoothed Particle Hydrodynamics [3.934403110868379]
  This study pioneers the integration of quantum kernel networks on particle hydrodynamics.<n>We developed versatile Lagrangian quantum network models built upon an improved quantum perceptron (QMLP)<n>The framework is validated through some continuous benchmarks on eurypalynous quantum neural networks.
  arXiv  Detail & Related papers  (2026-04-27T08:15:09Z)
• Generative modeling with Gaussian Boson Sampling: classically trainable Bosonic Born Machines [0.1449880056570423]
  We introduce a photonic quantum generative model built on parametrized Gaussian Boson Sampling circuits.<n>The training is based on the efficient classical evaluation of expectation values enabled by the Gaussian structure of the state.<n>We demonstrate the effectiveness of the approach through numerical experiments on photonic systems with up to 805 modes and over a million trainable parameters.
  arXiv  Detail & Related papers  (2026-03-11T18:04:11Z)
• Efficient training of photonic quantum generative models [0.0]
  This paper exploits the properties of intermediate-complexity circuits whose training can be simulated classically efficiently.<n>We propose an efficient training procedure for photon-native quantum generative models based on the maximum mean discrepancy.
  arXiv  Detail & Related papers  (2026-03-09T18:00:11Z)
• Physics-Informed Hybrid Quantum-Classical Dispatching for Large-Scale Renewable Power Systems:A Noise-Resilient Framework [9.378801906395179]
  High-penetration energy introduces significantity and non-Classicality into power system dispatching optimization.<n>Existing approaches typically treat the power grid as a "black box"<n>This paper proposes a Hybrid Quantum-Bridging Dispatching (PIHQ-CD) framework.
  arXiv  Detail & Related papers  (2026-01-26T13:35:54Z)
• Exponential capacity scaling of classical GANs compared to hybrid latent style-based quantum GANs [0.0]
  Quantum generative adversarial networks (QGANs) are leading candidates for quantum generative modeling.<n>The latent style-based QGAN, relying on a classical variational autoencoder to encode the input data into a latent space has been proven to be efficient for image generation or drug design.<n>We present in this work the first comprehensive experimental analysis of this advantage of QGANS applied to SAT4 image generation.
  arXiv  Detail & Related papers  (2026-01-08T15:44:41Z)
• Multi-Partitioned Meshfree Quantum Finite Particle Method: A Hybrid Quantum Framework for Fluid Flow [3.857420815948075]
  This study established a quantum-classical hybrid framework that integrates quantum computing paradigm with meshfree finite particle method.<n>By harnessing quantum superposition and entanglement, it hybridized the critical computational kernels.<n>Results demonstrate that integrating quantum computing to hybridize conventional linear combinations of particle dynamics serves as an effective high performance computing paradigm.
  arXiv  Detail & Related papers  (2025-09-14T13:59:42Z)
• VQC-MLPNet: An Unconventional Hybrid Quantum-Classical Architecture for Scalable and Robust Quantum Machine Learning [60.996803677584424]
  Variational Quantum Circuits (VQCs) offer a novel pathway for quantum machine learning.<n>Their practical application is hindered by inherent limitations such as constrained linear expressivity, optimization challenges, and acute sensitivity to quantum hardware noise.<n>This work introduces VQC-MLPNet, a scalable and robust hybrid quantum-classical architecture designed to overcome these obstacles.
  arXiv  Detail & Related papers  (2025-06-12T01:38:15Z)
• Neural-network-assisted Monte Carlo sampling trained by Quantum Approximate Optimization Algorithm [0.8009842832476994]
  We propose a hybrid quantum-classical MCMC framework that combines a quantum circuit with a generative neural sampler (GNS)<n>GNS acts as a classical surrogate to efficiently emulate quantum outputs, thereby lifting circuit constraints.<n>These results establish the method as a viable sampling-based quantum algorithm for NISQ devices.
  arXiv  Detail & Related papers  (2025-06-02T05:26:26Z)
• Leveraging Diffusion Models for Parameterized Quantum Circuit Generation [0.0]
  We introduce a generative approach based on denoising diffusion models (DMs) to synthesize quantum circuits (PQCs)<n>We demonstrate our approach in synthesizing PQCs optimized for generating high-fidelity Greenberger-Horne-Zeilinger (GHZ) states and achieving high accuracy in quantum machine learning (QML) classification tasks.
  arXiv  Detail & Related papers  (2025-05-27T08:14:58Z)
• Quantum Walks-Based Adaptive Distribution Generation with Efficient CUDA-Q Acceleration [0.5679775668038153]
  We present a novel Adaptive Distribution Generator that leverages a quantum walks-based approach to generate high precision and efficiency of target probability distributions.<n>Our method integrates variational quantum circuits with discrete-time quantum walks, specifically, split-step quantum walks and their entangled extensions, to dynamically tune coin parameters and drive the evolution of quantum states towards desired distributions.
  arXiv  Detail & Related papers  (2025-04-18T07:53:03Z)
• Quantum Latent Diffusion Models [65.16624577812436]
  We propose a potential version of a quantum diffusion model that leverages the established idea of classical latent diffusion models.<n>This involves using a traditional autoencoder to reduce images, followed by operations with variational circuits in the latent space.<n>The results demonstrate an advantage in using a quantum version, as evidenced by obtaining better metrics for the images generated by the quantum version.
  arXiv  Detail & Related papers  (2025-01-19T21:24:02Z)
• Hybrid Quantum-Classical Normalizing Flow [5.85475369017678]
  We propose a hybrid quantum-classical normalizing flow (HQCNF) model based on parameterized quantum circuits. We test our model on the image generation problem. Compared with other quantum generative models, such as quantum generative adversarial networks (QGAN), our model achieves lower (better) Fr'echet distance (FID) score.
  arXiv  Detail & Related papers  (2024-05-22T16:37:22Z)
• Towards Efficient Quantum Hybrid Diffusion Models [68.43405413443175]
  We propose a new methodology to design quantum hybrid diffusion models. We propose two possible hybridization schemes combining quantum computing's superior generalization with classical networks' modularity.
  arXiv  Detail & Related papers  (2024-02-25T16:57:51Z)
• Quantum circuit synthesis with diffusion models [0.6554326244334868]
  We use generative machine learning models, specifically denoising diffusion models (DMs), to facilitate this transformation. We steer the model to produce desired quantum operations within gate-based quantum circuits. We envision DMs as pivotal in quantum circuit synthesis, enhancing both practical applications but also insights into theoretical quantum computation.
  arXiv  Detail & Related papers  (2023-11-03T17:17:08Z)
• A Framework for Demonstrating Practical Quantum Advantage: Racing Quantum against Classical Generative Models [62.997667081978825]
  We build over a proposed framework for evaluating the generalization performance of generative models. We establish the first comparative race towards practical quantum advantage (PQA) between classical and quantum generative models. Our results suggest that QCBMs are more efficient in the data-limited regime than the other state-of-the-art classical generative models.
  arXiv  Detail & Related papers  (2023-03-27T22:48:28Z)
• Synergy Between Quantum Circuits and Tensor Networks: Short-cutting the Race to Practical Quantum Advantage [43.3054117987806]
  We introduce a scalable procedure for harnessing classical computing resources to provide pre-optimized initializations for quantum circuits. We show this method significantly improves the trainability and performance of PQCs on a variety of problems. By demonstrating a means of boosting limited quantum resources using classical computers, our approach illustrates the promise of this synergy between quantum and quantum-inspired models in quantum computing.
  arXiv  Detail & Related papers  (2022-08-29T15:24:03Z)
• Generalization Metrics for Practical Quantum Advantage in Generative Models [68.8204255655161]
  Generative modeling is a widely accepted natural use case for quantum computers. We construct a simple and unambiguous approach to probe practical quantum advantage for generative modeling by measuring the algorithm's generalization performance. Our simulation results show that our quantum-inspired models have up to a $68 times$ enhancement in generating unseen unique and valid samples.
  arXiv  Detail & Related papers  (2022-01-21T16:35:35Z)
• 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)
• 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)

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.