Spectral Born machines: classically trainable quantum generative models for discrete data

• URL: http://arxiv.org/abs/2607.06675v1
• Date: Tue, 07 Jul 2026 18:00:17 GMT
• Title: Spectral Born machines: classically trainable quantum generative models for discrete data
• Abstract summary: We present emphspectral Born machines, a class of quantum generative models.<n>We show how the spectral bias of the model leads to significantly reduced parameter counts compared to unstructured approaches.
• Score: 0.09817071294495454
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We present \emph{spectral Born machines}, a class of quantum generative models that results from viewing and generalizing the class of IQP Born machines through the lens of group Fourier analysis. These quantum models exploit the quantum Fourier transform to create an inductive bias that make them naturally suited to learning integer-structured data, while remaining classically hard to sample from in general. Similar to IQP Born machines, spectral Born machines can be trained efficiently at scale on classical hardware via a maximum mean discrepancy loss based on graph spectral analysis, which we make available in a new \emph{tcdq} module of the PennyLane software platform. In numerical experiments, we show how the spectral bias of the model leads to significantly reduced parameter counts compared to unstructured approaches, and demonstrate the scalability of the software by training a 190-qubit model with over 1 million parameters to successfully learn a distribution of 93 nucleotide-long ribosomal RNA. Our results suggest that highly over-parameterized spectral Born machines may be immune to overfitting, even in strongly data-scarce regimes.

Related papers

• "Train classical, deploy quantum" requires rethinking generalization [42.16343861129583]
  We benchmark a broad set of quantum and classical generative models by direct sampling.<n>We show that models trained with a moment-matching loss generally show worse generalization than the likelihood-trained models.
  arXiv  Detail & Related papers  (2026-08-31T17:26:27Z)
• Quantum Fourier Generative Models Trainable at Large Scale [13.839852906168787]
  We propose an algorithmic framework for building and training quantum generative models.<n>We develop a distinct training strategy where training is enabled at large scale by log-likelihood loss.<n>We demonstrate the efficiency of the suggested framework by validating loss estimation at the scale of over 1000 qubits.
  arXiv  Detail & Related papers  (2026-06-26T18:00:00Z)
• GQA-μP: The maximal parameterization update for grouped query attention [64.99972873396649]
  We show how to derivation P scalings for grouped-query attention (GQA)<n>We also demonstrate the efficacy of our theoretical derivations by showing learning rate transfer across the GQA repetition hyperparameter.
  arXiv  Detail & Related papers  (2026-05-14T18:03:16Z)
• Quantum Random Features: A Spectral Framework for Quantum Machine Learning [0.0]
  We introduce textitQuantum Random Features (QRF) and textitQuantum Dynamical Random Features (QDRF)<n>QRF and QDRF generate high-dimensional spectral representations without variational optimization.<n>By linking spectral theory with experimentally feasible quantum dynamics, this work provides a compact and hardware-compatible route to scalable quantum learning.
  arXiv  Detail & Related papers  (2026-01-29T14:01:52Z)
• Fermionic Born Machines: Classical training of quantum generative models based on Fermion Sampling [0.0]
  We introduce Fermionic Born Machines as an example of classically trainable quantum generative models.<n>The model employs parameterized magic states and fermionic linear optical (FLO) transformations with learnable parameters.<n>The specific structure of the ansatz induces a loss landscape that exhibits favorable characteristics for optimization.
  arXiv  Detail & Related papers  (2025-11-17T19:03:03Z)
• Fourier Neural Operators for Learning Dynamics in Quantum Spin Systems [77.88054335119074]
  We use FNOs to model the evolution of random quantum spin systems. We apply FNOs to a compact set of Hamiltonian observables instead of the entire $2n$ quantum wavefunction.
  arXiv  Detail & Related papers  (2024-09-05T07:18:09Z)
• Scaling and renormalization in high-dimensional regression [72.59731158970894]
  We present a unifying perspective on recent results on ridge regression.<n>We use the basic tools of random matrix theory and free probability, aimed at readers with backgrounds in physics and deep learning.<n>Our results extend and provide a unifying perspective on earlier models of scaling laws.
  arXiv  Detail & Related papers  (2024-05-01T15:59:00Z)
• Let Quantum Neural Networks Choose Their Own Frequencies [0.0]
  We generalize quantum models to include a set of trainable parameters in the generator, leading to a trainable frequency (TF) quantum model. We numerically demonstrate how TF models can learn generators with desirable properties for solving the task at hand.
  arXiv  Detail & Related papers  (2023-09-06T18:00:07Z)
• On the Sample Complexity of Quantum Boltzmann Machine Learning [0.0]
  We give an operational definition of QBM learning in terms of the difference in expectation values between the model and target.<n>We prove that a solution can be obtained with gradient descent using at most a number of Gibbs states.<n>In particular, we give pre-training strategies based on mean-field, Gaussian Fermionic, and geometrically local Hamiltonians.
  arXiv  Detail & Related papers  (2023-06-26T18:00:50Z)
• 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-tailored machine-learning characterization of a superconducting qubit [50.591267188664666]
  We develop an approach to characterize the dynamics of a quantum device and learn device parameters. This approach outperforms physics-agnostic recurrent neural networks trained on numerically generated and experimental data. This demonstration shows how leveraging domain knowledge improves the accuracy and efficiency of this characterization task.
  arXiv  Detail & Related papers  (2021-06-24T15:58:57Z)

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.