Identifiability and minimality bounds of quantum and post-quantum models of classical stochastic processes

• URL: http://arxiv.org/abs/2509.03004v1
• Date: Wed, 03 Sep 2025 04:27:13 GMT
• Title: Identifiability and minimality bounds of quantum and post-quantum models of classical stochastic processes
• Authors: Paul M. Riechers, Thomas J. Elliott,
• Abstract summary: We develop models to enable us to replicate, describe, and explain behaviours we see.<n>We tackle the question of determining whether or not two different models produce the same observable behavior.<n>Recent work has shown that it is even advantageous -- in terms of memory and thermal efficiency -- to employ quantum models to generate classical processes.
• Score: 0.7161783472741748
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: To make sense of the world around us, we develop models, constructed to enable us to replicate, describe, and explain the behaviours we see. Focusing on the broad case of sequences of correlated random variables, i.e., classical stochastic processes, we tackle the question of determining whether or not two different models produce the same observable behavior. This is the problem of identifiability. Curiously, the physics of the model need not correspond to the physics of the observations; recent work has shown that it is even advantageous -- in terms of memory and thermal efficiency -- to employ quantum models to generate classical stochastic processes. We resolve the identifiability problem in this regime, providing a means to compare any two models of a classical process, be the models classical, quantum, or `post-quantum', by mapping them to a canonical `generalized' hidden Markov model. Further, this enables us to place (sometimes tight) bounds on the minimal dimension required of a quantum model to generate a given classical stochastic process.

Related papers

• 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)
• Memory-minimal quantum generation of stochastic processes: spectral invariants of quantum hidden Markov models [0.0]
  We identify spectral invariants of a process that can be calculated from any model that generates it.<n>We show that the bound is raised quadratically when we restrict to classical operations.<n>We demonstrate that the classical bound can be violated by quantum models.
  arXiv  Detail & Related papers  (2024-12-17T11:30:51Z)
• When Quantum and Classical Models Disagree: Learning Beyond Minimum Norm Least Square [1.9223856107206057]
  Variational Quantum Circuits (VQCs) are important candidates for useful application of quantum computing.<n>We propose a general theory of quantum advantages for regression problems.<n>We show that it is possible to design quantum models that cannot be classically approximated with good generalization.
  arXiv  Detail & Related papers  (2024-11-07T18:18:38Z)
• Quantum Effects on the Synchronization Dynamics of the Kuramoto Model [62.997667081978825]
  We show that quantum fluctuations hinder the emergence of synchronization, albeit not entirely suppressing it. We derive an analytical expression for the critical coupling, highlighting its dependence on the model parameters.
  arXiv  Detail & Related papers  (2023-06-16T16:41:16Z)
• 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)
• A Quantum-Classical Model of Brain Dynamics [62.997667081978825]
  Mixed Weyl symbol is used to describe brain processes at the microscopic level. Electromagnetic fields and phonon modes involved in the processes are treated either classically or semi-classically. Zero-point quantum effects can be incorporated into numerical simulations by controlling the temperature of each field mode.
  arXiv  Detail & Related papers  (2023-01-17T15:16:21Z)
• Generalization despite overfitting in quantum machine learning models [0.0]
  We provide a characterization of benign overfitting in quantum models. We show how a class of quantum models exhibits analogous features. We intuitively explain these features according to the ability of the quantum model to interpolate noisy data with locally "spiky" behavior.
  arXiv  Detail & Related papers  (2022-09-12T18:08:45Z)
• Implementing quantum dimensionality reduction for non-Markovian stochastic simulation [0.5269923665485903]
  We implement memory-efficient quantum models for a family of non-Markovian processes using a photonic setup. We show that with a single qubit of memory our implemented quantum models can attain higher precision than possible with any classical model of the same memory dimension.
  arXiv  Detail & Related papers  (2022-08-26T15:54:47Z)
• Provably efficient variational generative modeling of quantum many-body systems via quantum-probabilistic information geometry [3.5097082077065003]
  We introduce a generalization of quantum natural gradient descent to parameterized mixed states. We also provide a robust first-order approximating algorithm, Quantum-Probabilistic Mirror Descent. Our approaches extend previously sample-efficient techniques to allow for flexibility in model choice.
  arXiv  Detail & Related papers  (2022-06-09T17:58:15Z)
• 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)
• State preparation and measurement in a quantum simulation of the O(3) sigma model [65.01359242860215]
  We show that fixed points of the non-linear O(3) sigma model can be reproduced near a quantum phase transition of a spin model with just two qubits per lattice site. We apply Trotter methods to obtain results for the complexity of adiabatic ground state preparation in both the weak-coupling and quantum-critical regimes. We present and analyze a quantum algorithm based on non-unitary randomized simulation methods.
  arXiv  Detail & Related papers  (2020-06-28T23:44:12Z)

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.