5.3.3 Persistence Probability

The aim of this subsection is to study another kind of reachability of quantum Markov chains, namely persistence. Intuitively, persistence means that a desired condition is always satisfied from a certain point of time. As pointed out in the last subsection, we can focus our attention on E(H)si480_e because E(H)si498_e is a transient subspace.

Definition 5.3.3

Let C=H,Esi259_e be a quantum Markov chain and X a subspace of E(H). Then ...

Get Foundations of Quantum Programming now with O’Reilly online learning.

O’Reilly members experience live online training, plus books, videos, and digital content from 200+ publishers.