Quantum hidden Markov models are shown to be identifiable via a finite set of word probabilities, and the minimal quantum memory dimension is proved to be at least the square root of the minimal generalized hidden Markov model dimension.
Marginalizing over the output events, the overall channel is CP, and also trace preserving (CPTP)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
quant-ph 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Identifiability and minimality bounds of quantum and post-quantum models of classical stochastic processes
Quantum hidden Markov models are shown to be identifiable via a finite set of word probabilities, and the minimal quantum memory dimension is proved to be at least the square root of the minimal generalized hidden Markov model dimension.