Asymptotic and Non-Asymptotic Analysis for Hidden Markovian Process with Quantum Hidden System
arXiv:1801.09158 · doi:10.1088/1751-8121/aacde9
Abstract
We focus on a data sequence produced by repetitive quantum measurement on an internal hidden quantum system, and call it a hidden Markovian process. Using a quantum version of the Perron-Frobenius theorem, we derive novel upper and lower bounds for the cumulant generating function of the sample mean of the data. Using these bounds, we derive the central limit theorem and large and moderate deviations for the tail probability. Then, we give the asymptotic variance is given by using the second derivative of the cumulant generating function. We also derive another expression for the asymptotic variance by considering the quantum version of the fundamental matrix. Further, we explain how to extend our results to a general probabilistic system.
arXiv comment21 pages, 2 figures; version 14 July 2018
References in corpus (12)
- No Signalling and Quantum Key Distribution
- Quantum Random Number Generators
- Quantum channels and memory effects
- A generalized no-broadcasting theorem
- Quantum Channels with Memory
- Optimal State Discrimination in General Probabilistic Theories
- Fluctuating observation time ensembles in the thermodynamics of trajectories
- Finite-length Analysis on Tail probability for Markov Chain and Application to Simple Hypothesis Testing
- Equivalence classes and local asymptotic normality in system identification for quantum Markov chains
- Information Geometry Approach to Parameter Estimation in Markov Chains
- Sanov and Central Limit Theorems for output statistics of quantum Markov chains
- A uniform Berry--Esseen theorem on -estimators for geometrically ergodic Markov chains