Quantum learning of classical stochastic processes: The Completely-Positive Realization Problem
Alex Monr\`as, Andreas Winter

TL;DR
This paper explores the problem of determining whether a classical stochastic process can be represented by a quantum system, extending realization theory to quantum contexts with implications for quantum machine learning and process characterization.
Contribution
It generalizes stochastic realization theory to quantum systems, connecting the Completely-Positive realization problem with operator systems theory and quantum process modeling.
Findings
Established conditions for quantum realizability of stochastic processes
Connected realization problems with operator systems theory
Potential applications in quantum machine learning and process reverse-engineering
Abstract
Among several tasks in Machine Learning, a specially important one is that of inferring the latent variables of a system and their causal relations with the observed behavior. Learning a Hidden Markov Model of given stochastic process is a textbook example, known as the positive realization problem (PRP). The PRP and its solutions have far-reaching consequences in many areas of systems and control theory, and positive systems theory. We consider the scenario where the latent variables are quantum states, and the system dynamics is constrained only by physical transformations on the quantum system. The observable dynamics is then described by a quantum instrument, and the task is to determine which quantum instrument --if any-- yields the process at hand by iterative application. We take as starting point the theory of quasi-realizations, whence a description of the dynamics of the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
