IQP Born Machines under Data-dependent and Agnostic Initialization Strategies

• URL: http://arxiv.org/abs/2603.14576v1
• Date: Sun, 15 Mar 2026 19:54:04 GMT
• Title: IQP Born Machines under Data-dependent and Agnostic Initialization Strategies
• Abstract summary: Quantum circuit Born machines based on instantaneous quantum-time (IQP) circuits are natural candidates for quantum generative modeling.<n>Recent proposals focus on training IQP-QCBMs using Mean Maximum Discrepancy (MMD) losses built from low-body Pauli-$Z$ors.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum circuit Born machines based on instantaneous quantum polynomial-time (IQP) circuits are natural candidates for quantum generative modeling, both because of their probabilistic structure and because IQP sampling is provably classically hard in certain regimes. Recent proposals focus on training IQP-QCBMs using Maximum Mean Discrepancy (MMD) losses built from low-body Pauli-$Z$ correlators, but the effect of initialization on the resulting optimization landscape remains poorly understood. In this work, we address this by first proving that the MMD loss landscape suffers from barren plateaus for random full-angle-range initializations of IQP circuits. We then establish lower bounds on the loss variance for identity and an unbiased data-agnostic initialization. We then additionally consider a data-dependent initialization that is better aligned with the target distribution and, under suitable assumptions, yields provable gradients and generally converges quicker to a good minimum (as indicated by our training of circuits with 150 qubits on genomic data). Finally, as a by-product, the developed variance lower bound framework is applicable to a general class of non-linear losses, offering a broader toolset for analyzing warm-starts in quantum machine learning.

Related papers

• Stochastic Pauli-path simulator for large-scale quantum optimization [57.179828941706006]
  Pauli-path simulators offer a promising route to large-scale classical simulation of quantum circuits in the low-magic regime.<n>Existing approaches either lack native support for gradient-based optimization or suffer from severe gradient bias.<n>Here we propose the Pauli-path simulator (SPPS), a computational framework for large-scale quantum optimization.
  arXiv  Detail & Related papers  (2026-07-20T10:43:44Z)
• Quantum-Enhanced Synthetic Data Generation Using Quantum Circuit Born Machines for Imbalanced Tabular Learning [0.0]
  We present a quantum-classical framework for synthetic data generation using a Quantum Circuit Born Machine (QCBM)<n>The proposed approach exploits quantum mechanical properties -- superposition and entanglement -- within a parameterized variational quantum circuit.<n>We show that QCBM achieves competitive classification performance and produces lower Mean Maximum Discrepancy (MMD) on the Telco dataset.
  arXiv  Detail & Related papers  (2026-07-10T05:53:29Z)
• Trainability of IQP Quantum Circuit Born Machines Under Gaussian Initialization [0.0]
  Quantum Circuit Born Machines (QCBMs) offer a natural approach to generative machine learning by leveraging the Born rule.<n>Recent work has provided a method to classically train QCBMs with Instantaneous Quantum Polynomial (IQP) circuits via the Maximum Mean Discrepancy (MMD) loss.<n>It discusses strategies to either avoid or encourage exponential concentration, as well as the conditions under which barren plateaus are more likely to occur.
  arXiv  Detail & Related papers  (2026-06-08T21:14:21Z)
• Quantum Tilted Loss in Variational Optimization: Theory and Applications [2.274915755738124]
  We introduce the Quantum Tilted Loss (QTL) to reshape the optimization landscape.<n>QTL can amplify gradient signals in structured settings while preserving the problem's true global minima.<n>We formalize this trainability-estimability trade-off, demonstrating how aggressive tilting fundamentally shifts the optimization bottleneck.
  arXiv  Detail & Related papers  (2026-05-04T17:25:43Z)
• Characterizing Trainability of Instantaneous Quantum Polynomial Circuit Born Machines [7.716642023459826]
  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.
  arXiv  Detail & Related papers  (2026-02-11T17:12:56Z)
• AQER: a scalable and efficient data loader for digital quantum computers [62.40228216126285]
  We develop AQER, a scalable AQL method that constructs the loading circuit by systematically reducing entanglement in target states.<n>We conduct systematic experiments to evaluate the effectiveness of AQER, using synthetic datasets, classical image and language datasets, and a quantum many-body state datasets with up to 50 qubits.
  arXiv  Detail & Related papers  (2026-02-02T14:39:42Z)
• Continual Quantum Architecture Search with Tensor-Train Encoding: Theory and Applications to Signal Processing [68.35481158940401]
  CL-QAS is a continual quantum architecture search framework.<n>It mitigates challenges of costly encoding amplitude and forgetting in variational quantum circuits.<n>It achieves controllable robustness expressivity, sample-efficient generalization, and smooth convergence without barren plateaus.
  arXiv  Detail & Related papers  (2026-01-10T02:36:03Z)
• Matrix product state approach to lossy boson sampling and noisy IQP sampling [0.7066293026438526]
  We develop classical algorithms for lossy boson sampling and noisy instantaneous quantum-time sampling.<n>Our algorithm offers significantly improved control over the accuracy-efficiency trade-off.<n>It further extends the applicability of MPS simulation to broader classes of noisy quantum sampling models.
  arXiv  Detail & Related papers  (2025-10-28T07:23:10Z)
• FIMA-Q: Post-Training Quantization for Vision Transformers by Fisher Information Matrix Approximation [55.12070409045766]
  Post-training quantization (PTQ) has stood out as a cost-effective and promising model compression paradigm in recent years.<n>Current PTQ methods for Vision Transformers (ViTs) still suffer from significant accuracy degradation, especially under low-bit quantization.
  arXiv  Detail & Related papers  (2025-06-13T07:57:38Z)
• Randomized semi-quantum matrix processing [0.0]
  We present a hybrid quantum-classical framework for simulating generic matrix functions. The method is based on randomization over the Chebyshev approximation of the target function. We prove advantages on average depths, including quadratic speed-ups on costly parameters.
  arXiv  Detail & Related papers  (2023-07-21T18:00:28Z)
• End-to-end resource analysis for quantum interior point methods and portfolio optimization [63.4863637315163]
  We provide a complete quantum circuit-level description of the algorithm from problem input to problem output. We report the number of logical qubits and the quantity/depth of non-Clifford T-gates needed to run the algorithm.
  arXiv  Detail & Related papers  (2022-11-22T18:54:48Z)
• FLIP: A flexible initializer for arbitrarily-sized parametrized quantum circuits [105.54048699217668]
  We propose a FLexible Initializer for arbitrarily-sized Parametrized quantum circuits. FLIP can be applied to any family of PQCs, and instead of relying on a generic set of initial parameters, it is tailored to learn the structure of successful parameters. We illustrate the advantage of using FLIP in three scenarios: a family of problems with proven barren plateaus, PQC training to solve max-cut problem instances, and PQC training for finding the ground state energies of 1D Fermi-Hubbard models.
  arXiv  Detail & Related papers  (2021-03-15T17:38:33Z)

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.