Learning Quantum-Samplers for Stochastic Processes with Quantum Sequence Models

• URL: http://arxiv.org/abs/2603.24069v1
• Date: Wed, 25 Mar 2026 08:23:56 GMT
• Title: Learning Quantum-Samplers for Stochastic Processes with Quantum Sequence Models
• Abstract summary: Quantum circuits that generate coherent superpositions of processes are key to many downstream quantum-accelerated tasks, such as risk analysis, importance sampling, and DNA sequencing.<n>Here, we introduce quantum sequence models that leverage a recurrent quantum circuit structure to generate coherent superpositions with circuit complexity that grows linearly with the desired time horizon.
• Score: 3.112711246449628
• License: http://creativecommons.org/licenses/by-sa/4.0/
• Abstract: Quantum circuits that generate coherent superpositions of stochastic processes are key to many downstream quantum-accelerated tasks, such as risk analysis, importance sampling, and DNA sequencing. However, traditional methods for designing such circuits from data face immense challenges, given the exponential growth in the size of the associated probability vectors as the desired simulation time horizon increases. Here, we introduce quantum sequence models that leverage a recurrent quantum circuit structure to generate coherent superpositions with circuit complexity that grows linearly with the desired time horizon; together with a recurrent variant of the parameter-shift rule, we train these models from observational data. When benchmarked against baseline quantum Born machines, our constructions exhibit orders-of-magnitude improvements in model accuracy in data-sparse regimes.

Related papers

• Matrix Product Evolution: A Method for Simulating Quantum Circuits Using Tensor Networks [0.0]
  We introduce a tensor-train representation of quantum circuits constructed along the circuit depth rather than along the qubit index.<n>Within this formulation, the simulation of a quantum circuit is modeled as the contraction of multiple MPE tensors.<n>We investigate the numerical behavior of this MPE-based contraction framework through simulations of random quantum circuits and the time evolution of a quantum many-body state.
  arXiv  Detail & Related papers  (2026-08-04T11:07:41Z)
• Quantum Dynamic Time Warping for Multivariate Time Series Classification [41.99844472131922]
  We propose a hybrid Quantum Dynamic Time Warping architecture, replacing the classical distance metric with the parameterized geometry of a quantum Hilbert space.<n>We demonstrate this architecture allows untrained quantum kernels to act as highly expressive baselines, while parameterized training effectively untangles deeply overlapping hyper-dimensional data.
  arXiv  Detail & Related papers  (2026-06-26T07:58:37Z)
• Quantum-inspired classical simulation through randomized time evolution [0.0]
  We build on recently introduced randomized quantum algorithms for time evolution (TE-PAI)<n>We adapt them to the classical simulation context with the purpose of enabling massive parallelisation.<n>We numerically observe that MPS TE-PAI is substantially more robust against severe bond-dimension truncation than product formulas.
  arXiv  Detail & Related papers  (2026-04-14T15:09:29Z)
• Digital Quantum Simulation of the Holstein-Primakoff Transformation on Noisy Qubits [40.8066152850216]
  We study the digital quantum simulation of bosonic modes on a cloud-based superconducting quantum processor.<n>We examine the interplay between algorithmic and hardware-induced errors to identify optimal simulation parameters.
  arXiv  Detail & Related papers  (2026-02-19T20:14:04Z)
• Quantum Phase Recognition via Quantum Attention Mechanism [4.522310554705239]
  We propose a hybrid quantum-classical attention model to extract correlations within quantum states.<n>The model achieves high classification accuracy with less than 100 training data.<n>It offers a scalable and data-efficient approach for quantum phase recognition in complex many-body systems.
  arXiv  Detail & Related papers  (2026-01-31T02:56:04Z)
• Sample-based training of quantum generative models [1.3521721488318912]
  We introduce a training framework that extends the principle of contrastive divergence to quantum models.<n>By deriving the circuit structure and providing a general recipe for constructing it, we obtain quantum circuits that generate the samples required for parameter updates.
  arXiv  Detail & Related papers  (2025-11-14T19:00:02Z)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [62.46800898243033]
  Recent progress in quantum learning theory prompts a question: can linear properties of a large-qubit circuit be efficiently learned from measurement data generated by varying classical inputs?<n>We prove that the sample complexity scaling linearly in $d$ is required to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d.<n>We propose a kernel-based method leveraging classical shadows and truncated trigonometric expansions, enabling a controllable trade-off between prediction accuracy and computational overhead.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Characterizing randomness in parameterized quantum circuits through expressibility and average entanglement [39.58317527488534]
  Quantum Circuits (PQCs) are still not fully understood outside the scope of their principal application.<n>We analyse the generation of random states in PQCs under restrictions on the qubits connectivities.<n>We place a connection between how steep is the increase on the uniformity of the distribution of the generated states and the generation of entanglement.
  arXiv  Detail & Related papers  (2024-05-03T17:32:55Z)
• Parameterized quantum circuits as universal generative models for continuous multivariate distributions [1.118478900782898]
  ized quantum circuits have been extensively used as the basis for machine learning models in regression, classification, and generative tasks. In this work, we elucidate expectation value sampling-based models and prove the universality of such variational quantum algorithms. Our results may help guide the design of future quantum circuits in generative modelling tasks.
  arXiv  Detail & Related papers  (2024-02-15T10:08:31Z)
• Embedding memory-efficient stochastic simulators as quantum trajectories [0.0]
  We show how continuous-time quantum simulators can be embedded in open quantum systems. We further show how such an embedding can be made exploiting for discrete-time processes.
  arXiv  Detail & Related papers  (2024-02-07T09:54:11Z)
• Simulating the Mott transition on a noisy digital quantum computer via Cartan-based fast-forwarding circuits [62.73367618671969]
  Dynamical mean-field theory (DMFT) maps the local Green's function of the Hubbard model to that of the Anderson impurity model. Quantum and hybrid quantum-classical algorithms have been proposed to efficiently solve impurity models. This work presents the first computation of the Mott phase transition using noisy digital quantum hardware.
  arXiv  Detail & Related papers  (2021-12-10T17:32:15Z)
• Preparing random states and benchmarking with many-body quantum chaos [48.044162981804526]
  We show how to predict and experimentally observe the emergence of random state ensembles naturally under time-independent Hamiltonian dynamics. The observed random ensembles emerge from projective measurements and are intimately linked to universal correlations built up between subsystems of a larger quantum system. Our work has implications for understanding randomness in quantum dynamics, and enables applications of this concept in a wider context.
  arXiv  Detail & Related papers  (2021-03-05T08:32:43Z)
• Learnability and Complexity of Quantum Samples [26.425493366198207]
  Given a quantum circuit, a quantum computer can sample the output distribution exponentially faster in the number of bits than classical computers. Can we learn the underlying quantum distribution using models with training parameters that scale in n under a fixed training time? We study four kinds of generative models: Deep Boltzmann machine (DBM), Generative Adrial Networks (GANs), Long Short-Term Memory (LSTM) and Autoregressive GAN, on learning quantum data set generated by deep random circuits.
  arXiv  Detail & Related papers  (2020-10-22T18:45:25Z)

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.