Strong and Weak Optimizations in Classical and Quantum Models of Stochastic Processes

Abstract

Among the predictive hidden Markov models that describe a given stochastic process, the {\epsilon}-machine is strongly minimal in that it minimizes every R\'enyi-based memory measure. Quantum models can be smaller still. In contrast with the {\epsilon}-machine's unique role in the classical setting, however, among the class of processes described by pure-state hidden quantum Markov models, there are those for which there does not exist any strongly minimal model. Quantum memory optimization then depends on which memory measure best matches a given problem circumstance.Comment: 14 pages, 14 figures; http://csc.ucdavis.edu/~cmg/compmech/pubs/uemum.ht