Identifiability and minimality bounds of quantum and post-quantum models of classical stochastic processes
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915477442265088 |
|---|---|
| author | Riechers, Paul M. Elliott, Thomas J. |
| author_facet | Riechers, Paul M. Elliott, Thomas J. |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2509_03004 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Identifiability and minimality bounds of quantum and post-quantum models of classical stochastic processes Riechers, Paul M. Elliott, Thomas J. Quantum Physics Statistical Mechanics Computation and Language Formal Languages and Automata Theory Information Theory 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. |
| title | Identifiability and minimality bounds of quantum and post-quantum models of classical stochastic processes |
| topic | Quantum Physics Statistical Mechanics Computation and Language Formal Languages and Automata Theory Information Theory |
| url | https://arxiv.org/abs/2509.03004 |