Characterizing Trainability of Instantaneous Quantum Polynomial Circuit Born Machines

• URL: http://arxiv.org/abs/2602.11042v2
• Date: Fri, 13 Feb 2026 16:05:56 GMT
• Title: Characterizing Trainability of Instantaneous Quantum Polynomial Circuit Born Machines
• Authors: Kevin Shen, Susanne Pielawa, Vedran Dunjko, Hao Wang,
• Abstract summary: Instantaneous quantum quantum circuit Born machines (IQP-QCBMs) have been proposed as quantum generative models.<n>We show that barren plateaus depend on the generator set and the spectrum of the chosen kernel.<n>We identify regimes in which low-weight-biased kernels avoid exponential suppression in structured topologies.
• Score: 7.716642023459826
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Instantaneous quantum polynomial quantum circuit Born machines (IQP-QCBMs) have been proposed as quantum generative models with a classically tractable training objective based on the maximum mean discrepancy (MMD) and a potential quantum advantage motivated by sampling-complexity arguments, making them an exciting model worth deeper investigation. While recent works have further proven the universality of a (slightly generalized) model, the next immediate question pertains to its trainability, i.e., whether it suffers from the exponentially vanishing loss gradients, known as the barren plateau issue, preventing effective use, and how regimes of trainability overlap with regimes of possible quantum advantage. Here, we provide significant strides in these directions. To study the trainability at initialization, we analytically derive closed-form expressions for the variances of the partial derivatives of the MMD loss function and provide general upper and lower bounds. With uniform initialization, we show that barren plateaus depend on the generator set and the spectrum of the chosen kernel. We identify regimes in which low-weight-biased kernels avoid exponential gradient suppression in structured topologies. Also, we prove that a small-variance Gaussian initialization ensures polynomial scaling for the gradient under mild conditions. As for the potential quantum advantage, we further argue, based on previous complexity-theoretic arguments, that sparse IQP families can output a probability distribution family that is classically intractable, and that this distribution remains trainable at initialization at least at lower-weight frequencies.

Related papers

• Quantum Speedups for Derivative Pricing Beyond Black-Scholes [13.340091066357049]
  This paper explores advancements in quantum algorithms for derivative pricing of exotics.<n>We extend existing frameworks to demonstrate novel quadratic speedups for more practical models.<n>We also present an improved analysis of derivative pricing, leading to substantial reductions in the resource requirements for pricing GBM and CIR models.
  arXiv  Detail & Related papers  (2026-02-03T16:45:24Z)
• Universal classical and quantum fluctuations in the large deviations of current of noisy quantum systems: The case of QSSEP and QSSIP [2.035631599424874]
  We study the fluctuation statistics of integrated currents in noisy quantum diffusive systems.<n>We show that the cumulant generating function of the integrated current, at large scales, obeys a large deviation principle.<n>We identify the leading finite-size corrections to the current statistics.
  arXiv  Detail & Related papers  (2026-01-23T16:45:31Z)
• Random-Matrix-Induced Simplicity Bias in Over-parameterized Variational Quantum Circuits [72.0643009153473]
  We show that expressive variational ansatze enter a Haar-like universality class in which both observable expectation values and parameter gradients concentrate exponentially with system size.<n>As a consequence, the hypothesis class induced by such circuits collapses with high probability to a narrow family of near-constant functions.<n>We further show that this collapse is not unavoidable: tensor-structured VQCs, including tensor-network-based and tensor-hypernetwork parameterizations, lie outside the Haar-like universality class.
  arXiv  Detail & Related papers  (2026-01-05T08:04:33Z)
• The Born Ultimatum: Conditions for Classical Surrogation of Quantum Generative Models with Correlators [1.397434225914932]
  Quantum Circuit Born Machines (QCBMs) are powerful quantum generative models that sample according to the Born rule.<n>Recent train-classical, deploy-quantum approaches propose training classical surrogates of QCBMs and using quantum devices only for inference.<n>We analyze the limitations of these methods arising from deployment discrepancies between classically trained and quantumly deployed parameters.
  arXiv  Detail & Related papers  (2025-11-03T18:51:24Z)
• Universality and kernel-adaptive training for classically trained, quantum-deployed generative models [7.192684088403013]
  The instantaneous quantum (IQP) quantum circuit Born machine (QCBM) has been proposed as a promising quantum generative model over bitstrings.<n>Recent works have shown that the training of IQP-QCBM is classically tractable w.r.t. the so-called Gaussian kernel maximum mean discrepancy (MMD) loss function.<n>We show that in the kernel-adaptive method, the convergence of the MMD value implies weak convergence in distribution of the generator.
  arXiv  Detail & Related papers  (2025-10-09T17:17:34Z)
• 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)
• Overcoming Dimensional Factorization Limits in Discrete Diffusion Models through Quantum Joint Distribution Learning [79.65014491424151]
  We propose a quantum Discrete Denoising Diffusion Probabilistic Model (QD3PM)<n>It enables joint probability learning through diffusion and denoising in exponentially large Hilbert spaces.<n>This paper establishes a new theoretical paradigm in generative models by leveraging the quantum advantage in joint distribution learning.
  arXiv  Detail & Related papers  (2025-05-08T11:48:21Z)
• Avoided-crossings, degeneracies and Berry phases in the spectrum of quantum noise through analytic Bloch-Messiah decomposition [49.1574468325115]
  "analytic Bloch-Messiah decomposition" provides approach for characterizing dynamics of quantum optical systems.<n>We show that avoided crossings arise naturally when a single parameter is varied, leading to hypersensitivity of the singular vectors.<n>We highlight the possibility of programming the spectral response of photonic systems through the deliberate design of avoided crossings.
  arXiv  Detail & Related papers  (2025-04-29T13:14:15Z)
• Quantum tomography of helicity states for general scattering processes [55.2480439325792]
  Quantum tomography has become an indispensable tool in order to compute the density matrix $rho$ of quantum systems in Physics. We present the theoretical framework for reconstructing the helicity quantum initial state of a general scattering process.
  arXiv  Detail & Related papers  (2023-10-16T21:23:42Z)
• Quantum Generative Modeling using Parameterized Quantum Circuits [0.0]
  Quantum generative models use the intrinsic probabilistic nature of quantum mechanics to learn and reproduce complex probability distributions.<n>We present an implementation of a 3-qubit quantum circuit Born machine trained to model a 3-bit Gaussian distribution using a Kullback-Leibler (KL) divergence loss and parameter-shift gradient optimization.
  arXiv  Detail & Related papers  (2023-03-25T18:01:50Z)
• Universality of critical dynamics with finite entanglement [68.8204255655161]
  We study how low-energy dynamics of quantum systems near criticality are modified by finite entanglement. Our result establishes the precise role played by entanglement in time-dependent critical phenomena.
  arXiv  Detail & Related papers  (2023-01-23T19:23:54Z)
• Theory of Quantum Generative Learning Models with Maximum Mean Discrepancy [67.02951777522547]
  We study learnability of quantum circuit Born machines (QCBMs) and quantum generative adversarial networks (QGANs) We first analyze the generalization ability of QCBMs and identify their superiorities when the quantum devices can directly access the target distribution. Next, we prove how the generalization error bound of QGANs depends on the employed Ansatz, the number of qudits, and input states.
  arXiv  Detail & Related papers  (2022-05-10T08:05:59Z)

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.