Intrinsic and Measured Information in Separable Quantum Processes

TL;DR

This paper explores quantum information properties of separable quantum processes, providing bounds on classical information, methods for source synchronization, and techniques for reconstructing quantum sources with various memory models.

Contribution

It introduces quantum-information-theoretic bounds, synchronization protocols, and reconstruction methods for separable quantum processes, advancing understanding of their classical and quantum informational structure.

Findings

Bounds on classical information from quantum sources

Protocols for source synchronization using POVMs

Methods for reconstructing quantum sources with different memory models

Abstract

Stationary quantum information sources emit sequences of correlated qudits -- that is, structured quantum stochastic processes. If an observer performs identical measurements on a qudit sequence, the outcomes are a realization of a classical stochastic process. We introduce quantum-information-theoretic properties for separable qudit sequences that serve as bounds on the classical information properties of subsequent measured processes. For sources driven by hidden Markov dynamics we describe how an observer can temporarily or permanently synchronize to the source's internal state using specific positive operator-valued measures or adaptive measurement protocols. We introduce a method for approximating an information source with an independent and identically-distributed, Markov, or larger memory model through tomographic reconstruction. We identify broad classes of separable processes based on their quantum information properties and the complexity of measurements required to synchronize to and accurately reconstruct them.

Tables

Table 1. Table 1: Information Properties for Example Quantum Processes/Sources. Decimal values were numerically estimated using Eqs. ( 38 ), ( 45 ), and ( 47 ) with ℓ = 8 ℓ 8 \ell=8 for the Unifilar Qutrit Source, ℓ = 10 ℓ 10 \ell=10 for the Unifilar and Nonunifilar Qubit Sources, and ℓ = 12 ℓ 12 \ell=12 for all other processes. Other values were calculated analytically.

	$s$	$\left|{𝐆}_q\right|$	${𝐄}_q$	${𝐓}_q$	$R_q$
	(bits/timestep)		(bits)	(bits$\times$time steps)	(time steps)
I.I.D. Qubit Process	$S\left({\rho }_{iid}\right)$	$1-S\left({\rho }_{iid}\right)$	0	0	0
Period-3 Process ($\varphi =\pi$)	0	1	${\log }_2\left(3\right)$	$2.33$	$3$
Period-3 Process ($\varphi =\pi /2$)	0	1	${\log }_2\left(3\right)$	$4.22$	$\infty$
Quantum Golden Mean ($\varphi =\pi$)	$2/3$	$1/3$	$0.2516$	$1/3$	$1$
Quantum Golden Mean ($\varphi =\pi /2$)	$0.4495$	0.5505	$0.1092$	$0.5687$	$\infty$
3-Symbol Quantum Golden Mean	0.6667	0.3333	$0.4652$	$0.8855$	$\infty$
Unifilar Qubit Source ($p=1/3$)	0.9184	0.0816	$0.0808$	$0.1976$	$\infty$
Nonunifilar Qubit Source ($p=1/3$)	0.7306	0.2614	$0.3217$	$0.4090$	$\infty$
Unifilar Qutrit Source	0.8002	0.7848	$1.290$	$2.156$	$\infty$

Equations

$$\overleftrightarrow{X}\equiv ...X_{-2}{X}_{-1}{X}_0{X}_1{X}_2\dots ,$$

$$\mathrm{Pr}(X_{0:\ell })=\mathrm{Pr}(X_{t:t+\ell }),$$

$$\mathrm{Pr}(X_{0:\ell })\equiv \mathrm{Pr}(X_0)\mathrm{Pr}(X_1)\cdots \mathrm{Pr}(X_{\ell -1}),$$

$$\mathrm{Pr}(X_{0:\ell })\equiv \mathrm{Pr}(X_0)\mathrm{Pr}(X_1|X_0)\cdots \mathrm{Pr}(X_{\ell -1}|X_{\ell -2}),$$

$${\rho }_{iid}=\sum _{|{\psi }_x⟩\in \mathcal{Q}}\mathrm{Pr}(|{\psi }_x⟩)|{\psi }_x⟩⟨{\psi }_x|.$$

$$|{\Psi }_{iid}⟩=\cdots \otimes {\rho }_{iid}\otimes {\rho }_{iid}\otimes {\rho }_{iid}\otimes \cdots .$$

$$|{\psi }_w⟩$$

$$=|{\psi }_{x_0}⟩\otimes |{\psi }_{x_1}⟩\otimes \cdots \otimes |{\psi }_{x_{\ell -1}}⟩,$$

$${\rho }_{0:\ell }$$

$$=\sum _{w\in {\mathcal{X}}^{\ell }}\mathrm{Pr}(|{\psi }_w⟩)|{\psi }_w⟩⟨{\psi }_w|,$$

$${\rho }_{0:\ell }={\rho }_{t:\ell +t},$$

$${\rho }_{0:\ell }=\underset{t=0}{\overset{\ell -1}{⨂}}{\rho }_{iid},$$

$$\mathrm{Pr}(|{\psi }_w⟩)$$

$$\cdots \mathrm{Pr}(|{\psi }_{x_{\ell -1}}⟩||{\psi }_{x_{\ell -2}}⟩).$$

$$\sum _y{E}_y=\mathbb{I}.$$

$${\mathcal{M}}_{0:\ell }=\underset{t=0}{\overset{\ell -1}{⨂}}{M}_t,$$

$${\mathcal{M}}_{0:\ell }=\underset{t=0}{\overset{\ell -1}{⨂}}M.$$

$$Y_{0:\ell }$$

$$={\mathcal{M}}_{0:\ell }({\rho }_{0:\ell }),$$

$$\mathrm{Pr}(y_{0:\ell })=tr(E_{y_{0:\ell }}{\rho }_{0:\ell }).$$

$$\mathrm{Pr}(y_{0:\ell })$$

$$=tr\left(\sum _{w\in {\mathcal{X}}^{\ell }}\mathrm{Pr}(w)\prod _{t=0}^{\ell -1}{E}_{y_t}|{\psi }_{x_t}⟩⟨{\psi }_{x_t}|\right).$$

$$\mathcal{C}=\mathcal{M}\circ \mathcal{E}.$$

$$\overleftrightarrow{Y}=\mathcal{M}(|{\Psi }_{-\infty :\infty }⟩),$$

$$\overleftrightarrow{Y}=\mathcal{C}(\overleftrightarrow{X}).$$

$$\mathrm{Pr}(y_0=0)$$

$$\mathrm{Pr}(y_0=1)$$

$$S(\rho )$$

$$=-\sum _i{\lambda }_i{\log }_2{\lambda }_i,$$

$$S(\rho )=\underset{M}{\min }H\left[M(\rho )\right],$$

$$S(\rho \Vert \sigma )\equiv tr(\rho {\log }_2\rho )-tr(\rho {\log }_2\sigma ),$$

$$S(\rho \Vert \sigma )\ge 0,$$

$$S(A,B)$$

$$=-tr({\rho }^{AB}{\log }_2{\rho }^{AB}),$$

Full text

1. I Introduction

2. I.1 Quantum and Classical Randomness

3. I.2 Sources with Memory

4. II Stochastic Processes

5. II.1 Classical Processes

6. II.2 Presentations

7. II.3 Quantum Processes

8. II.3.1 Memoryless

9. II.3.2 Memoryful

10. II.4 Presentations of Quantum Processes

11. II.5 Measured Processes

12. II.6 Adaptive Measurement Protocols

13. II.7 Discussion

14. III Information in Quantum Processes

15. III.1 von Neumann Entropy

16. III.2 Quantum Block Entropy

17. III.3 von Neumann Entropy Rate

18. III.4 Quantum Redundancy

19. III.5 Quantum Entropy Gain

20. III.6 Quantum Predictability Gain

21. III.7 Total Quantum Predictability

22. III.8 Quantum Excess Entropy

23. III.9 Quantum Transient Information

24. III.10 Quantum Markov Order

25. IV Qudit Processes

26. IV.1 I.I.D. Processes

27. IV.2 Quantum Presentations of Classical Processes

28. IV.3 Periodic Processes

29. IV.4 Quantum Golden Mean Processes

30. IV.5 $3$-Symbol Quantum Golden Mean

31. IV.6 Unifilar and Nonunifilar Qubit Sources

32. IV.7 Unifilar Qutrit Source

33. IV.8 Discussion

34. V Synchronizing to a Quantum Source

35. V.1 States of Knowledge

36. V.2 Average State Uncertainty and Synchronization Information

37. V.3 Synchronizing to Quantum Presentations of Classical Processes

38. V.4 Synchronizing to Periodic Processes

39. V.5 Synchronizing with PVMs

40. V.6 Maintaining Synchrony with Adaptive Measurement

41. V.7 Synchronizing to a Qutrit Source

42. V.8 Discussion

43. VI Quantum Process System Identification

44. VI.1 Classical System Identification

45. VI.2 Tomography of a Qudit

46. VI.3 Tomography of a Qudit Process

47. VI.4 Cost of I.I.D.

48. VI.5 Finite Length Estimation of Information Properties

49. VI.6 Tomography with a Known Quantum Alphabet

50. VI.6.1 $\ell=1$

51. VI.6.2 $\ell=2$

52. VI.6.3 $\ell\geq 3$

53. VI.7 Source Reconstruction

54. VI.7.1 $\ell=1$

55. VI.7.2 $\ell=2$

56. VI.7.3 $\ell\geq 3$

57. VI.8 Discussion

58. VII Conclusion

59. A Information in Classical Processes

60. A.1 Shannon Entropy

61. A.2 Block Entropy

62. A.3 Shannon Entropy Rate

63. A.4 Redundancy

64. A.5 Block Entropy Derivatives and Integrals

65. A.6 Entropy Gain

66. A.7 Predictability Gain

67. A.8 Total Predictability

68. A.9 Excess Entropy

69. A.10 Transient Information

70. A.11 Markov Order

71. B Quantum Channels for Preparation and Measurement

I Introduction

Determining a quantum system’s state requires grappling with multiple sources of uncertainty, including several that do not arise in classical physics. Irreducible limits on measurement, in particular, have been a hallmark of quantum physics since Heisenberg introduced the position-momentum uncertainty principle in 1927 [1]. Similar incompatible measurements exist for generic pure quantum states [2].

For a $2$-level quantum system, or qubit, it is impossible to simultaneously measure the value of a spin in the $x$-, $y$-, and $z$-directions. (Stated mathematically, the Pauli matrices $\sigma_{x}$, $\sigma_{y}$, and $\sigma_{z}$ do not commute.) Additionally, a single measurement in each basis is insufficient. One must measure many copies in each basis to specify the distribution of outcomes. As a result, determining an unknown qubit state through quantum state tomography requires measuring a large ensemble of identical copies with a set of mutually unbiased bases [3] or a single informationally-complete positive operator-valued measure (POVM) [4].

These sources of uncertainty are familiar in quantum physics. Contrast them with when an observer receives a sequence of correlated qubits. Measuring them one by one, what will they see? And, what then can they infer about the resources necessary to generate these qubit strings? The following answers these questions by teasing apart the sources of apparent randomness and correlation in measured quantum processes.

I.1 Quantum and Classical Randomness

Also in 1927, von Neumann formulated quantum mechanics in terms of statistical ensembles and quantified the entropy of these mixed quantum states. In doing so, he extended Gibbs’ work on statistical ensembles and classical thermodynamic entropies to the quantum domain [5]. A mixed quantum state $\rho$ has an entropy $S(\rho)=-tr(\rho\log\rho)$, now known as the von Neumann entropy. ($tr(\cdot)$ is the trace operator.) $S(\rho)=0$ if and only if $\rho$ is a pure (nonmixed) quantum state. On the one hand, the von Neumann entropy is key to understanding quantum systems, particularly those with entangled subsystems that exhibit nonclassical correlations. On the other, the uncertainty $S(\rho)$ quantifies a generic feature of statistical ensembles. It does not correspond to any particular quantum mechanical effect.

These two forms of uncertainty—due to ensembles and to quantum indeterminacy—are combined within the framework of quantum information theory, which generalizes classical information theory to quantum observables [6]. One notable example is noiseless coding. Shannon quantified the information content produced by a noiseless classical independent and identically-distributed (i.i.d.) information source—one that emits a state drawn from the same distribution at each timestep [7]. Schumacher’s quantum noiseless coding theorem generalized this to quantum information sources. This gave a new physical interpretation of the von Neumann entropy: For an i.i.d. quantum source emitting state $\rho$, $S(\rho)$ is the number of qubits required for a reliable compression scheme [8].

I.2 Sources with Memory

Non-i.i.d. stationary information sources inject additional forms of uncertainty. For example, a source may have an internal memory that induces correlations between sequential qubits and therefore between measurement outcomes. Such correlations may be purely classical or uniquely quantal in nature. As we will show, an experimenter who assumes (incorrectly) that such a source is i.i.d. and then applies existing tomographic methods will not detect these correlations and so will overestimate the source’s randomness and underestimate its compressibility.

Classical memoryful sources are described within the framework of computational mechanics, in which stationary dynamical systems serve as information sources with their own internal states and dynamic [9]. Sequential finite-precision measurements of a dynamical system form a discrete-time stochastic process. The resulting process’ statistics allow one to construct a model of the source and calculate its asymptotic entropy rate, internal memory requirements, and other physically-relevant properties [10, 11]. Importantly, the uncertainty associated with sequential measurements of a classical information source can be reduced, sometimes substantially, by an observer capable of synchronizing to the process’ internal states [12, 13].

Subjecting an open quantum system to sequential qudit probes presents a similar but more general challenge, as the amount of information an observer can glean from an individual qudit through measurement is limited. Recent results established that applying particular measuring instruments to qubits induces complex behavior in measurement sequences [14]. Here, we extend these results by studying properties of the quantum states themselves in addition to particular sequences of measurement outcomes.

The following introduces novel quantum-information-theoretic properties for sequences of separable—i.e., nonentangled—qudits. We build on previous results that focused on entropy rates, compression limits, and optimal coding strategies for stationary quantum information sources [15, 16, 17], as well as on results for specific experimentally-motivated deviations from the i.i.d. assumption [18]. The approach is distinct from but complements recent efforts on quantum stochastic processes in which an observer measures a quantum system directly. This is complicated due to the latter’s interaction with an inaccessible environment that induces memory effects in sequential measurement outcomes [19, 20, 21, 22, 23].

Section II introduces classical processes, separable qudit processes, and methods of transforming from one to the other via classical-quantum channels and measurement channels. Then Section III, in concert with App. A, defines the entropies associated with quantum and classical processes, respectively. Adapting Ref. [11]’s entropy hierarchy, we employ discrete-time derivatives and integrals to obtain a family of distinct quantitative measures of quantum process randomness and correlation. We prove that, for projective or informationally-complete measurements, the sequences of measurement outcomes form classical processes whose information properties are bounded by those of the quantum process being measured.

Section IV then surveys examples of increasingly-structured separable qubit and qutrit processes. Section V discusses how an observer can synchronize to a memoryful source—i.e., determine its internal state—through sequential measurement. Section VI uses the resulting catalog of possible process behaviors to answer practical questions for an observer of a quantum process attempting to perform tomography. Finally, Section VII draws out lessons and proposes future directions and applications, most notably extending the results to the experimentally-realizable generation of arbitrary entangled qudit states [24, 25] and using correlations as a resource to perform thermodynamic quantum information processing [26, 27].

II Stochastic Processes

We consider the output of an information source to be a discrete-time, stationary stochastic process. If the source output is a classical random variable—${X}_{t}$ for each timestep $t$—we can directly apply the methods of computational mechanics [11]. Our goal is to extend these methods to describe separable sequences of qudits, each represented by a pure state in $d$-dimensional Hilbert space: $\ket{\psi_{t}}\in\mathcal{H}^{d}$ at each timestep $t$. Given such a qudit sequence, one can perform repeated, identical measurements such that the outcomes form a classical stochastic process. Since one can choose to measure qudit states in many different bases, the properties of the classical measured process are determined by both the state of the correlated qudits and the measurement choice. Thus, the relationship between a quantum process and classical measured processes is one-to-many. Figure 1 illustrates this setup.

II.1 Classical Processes

A classical stochastic process is defined by a probability measure $\Pr(\smash{\overleftrightarrow{{X}}})$ over a chain of random variables:

[TABLE]

with each ${X}_{t}$ taking on values drawn from a finite alphabet $\mathcal{X}$. A block of $\ell$ consecutive random variables is denoted ${X}_{0:\ell}={X}_{0}{X}_{1}\cdots{X}_{\ell-1}$. The indexing is left-inclusive and right-exclusive. A particular bi-infinite process realization is denoted $\smash{\overleftrightarrow{{x}}}\equiv...{x}_{-2}{x}_{-1}{x}_{0}{x}_{1}{x}_{2}...$ with events ${x}_{t}$ taking values in a discrete set $\mathcal{X}$. Realizations of a block of length $\ell$ are known as words and denoted ${x}_{0:\ell}$. The set of all words of length $\ell$ is $\mathcal{X}^{\ell}$.

We consider processes that are stationary, meaning that word probabilities $\Pr({X}_{0:\ell})$ are time-independent:

[TABLE]

for all $t\in\mathbb{Z}$ and $\ell\in\mathbb{Z}^{+}$. A stationary process’s statistics are fully described by the set of length-$\ell$ word distributions $\Pr({X}_{0:\ell})$. A block of length $\ell$ has at most $|\mathcal{X}|^{\ell}$ possible realizations (words).

One important subclass of processes are independently and identically distributed (i.i.d.) processes. The joint block probabilities of an i.i.d. process take the form:

[TABLE]

for all $\ell\in\mathbb{Z}^{+}$. This factoring of the block probabilities results in no statistical correlations between any random variables. Due to stationarity $\Pr({X}_{t})=\Pr({X}_{0})$ for all $t$ for an i.i.d. process.

Another commonly-studied subclass consists of the Markov processes for which the distribution for each ${X}_{t}$ depends only on the immediately preceding random variable ${X}_{t-1}$. For Markov processes the joint probabilities for finite-length blocks factor as:

[TABLE]

where $\Pr(X|Y)$ is the probability distribution of random variable $X$ conditioned on random variable $Y$.

Finally, there is the markedly-larger subclass of hidden Markov processes that have an internal Markov dynamic that is not directly observable. Though the joint probabilities do not factor as in Eq. (2), the internal Markov dynamic restricts the process statistics as we describe next.

II.2 Presentations

A presentation of a process is a model consisting of a set of internal states and a transition dynamic between those states that together reproduce the process’ statistics exactly. A given process may have many presentations. We focus on those depicted with state transition diagrams (directed graphs) that generate stationary, discrete-time stochastic processes in a natural way.

A Markov chain is a process presentation defined by the pair $(\mathcal{X},T)$:

• •

A finite alphabet $\mathcal{X}$ of $m$ symbols ${x}\in\mathcal{X}$, and

• •

A $m\times m$ transition matrix $T$. That is, if the source emits symbol ${x}_{i}$, with probability $T_{ij}=\Pr({x}_{j}|{x}_{i})$ it emits symbol ${x}_{j}$ next.

The stationary distribution for a Markov chain is denoted $\pi$, and it is a distribution over causal states in $\mathcal{S}$ that satisfies $\pi=\pi T$. For a Markov chain the set of internal states is exactly the set of emitted symbols since the probability distribution for the next symbol is completely determined by the previous symbol. We represent each state as a node in a graph and each transition as a directed edge between nodes labeled by the associated probability.

Markov chains are sufficient to represent Markov processes, but we can describe the more general class of hidden Markov processes by allowing for internal states not directly observable. These processes are generated by hidden Markov chains (HMCs), defined by the triple, $(\mathcal{S},\mathcal{X},\mathcal{T})$:

• •

A finite set $\mathcal{S}=\{\sigma_{1},\ldots,\sigma_{n}\}$ of internal states,

• •

A finite alphabet $\mathcal{X}$ of $m$ symbols ${x}\in\mathcal{X}$, and

• •

A set $\mathcal{T}=\{T^{x}:x\in\mathcal{X}\}$ of $m$ $n\times n$ symbol-labeled transition matrices. That is, if the source is in state $\sigma_{i}$, with probability $T^{x}_{ij}=\Pr(x,\sigma_{j}|\sigma_{i})$ it emits symbol $x$ while transitioning to state $\sigma_{j}$.

We represent each possible transition between states as an edge between their nodes labeled with the emitted symbol and the transition probability. An HMC’s stationary distribution $\pi$ uniquely satisfies $\pi=\pi\sum_{x}T^{x}$.

Any HMC that exactly reproduces a process’ statistical features is a generative HMC. This is an important distinction, since only some of those also belong to the more restrictive class of predictive HMCs. An HMC is predictive if its state at time $t+1$ is completely determined by the state at time $t$ and the emitted symbol. This property is known as unifilarity.

At this point we must emphasize the difference between a process and a particular presentation of that process. This distinction is critical when designating processes and models to be ‘classical’ or ‘quantum’. A discrete-time classical stochastic processes is classical because it consists of a chain of classical random variables. Markov chains and HMCs are classical models because their internal states are dynamics are both classical. One may instead construct a presentation of a classical process with a set of quantum states that the model transitions between via some quantum dynamic. An observer can recover the classical process’ statistics by taking sequential measurements on either the system or on ancilla qudits that interact with the system at each timestep. The simulation of classical stochastic processes with quantum resources is the objective of quantum computational mechanics. There, a class of quantum models (q-simulators) shows advantage in terms of memory requirements over provably-minimal classical predictive models ($\epsilon$-machines) [28, 29, 30, 31, 32]. Likewise different presentations of a quantum processes may have an underlying dynamic that is either classical or quantum. We turn now to quantum processes and their presentations.

II.3 Quantum Processes

Discrete-time classical stochastic processes consist of one classical random variable for each timestep. Likewise discrete-time quantum stochastic processes consist of one quantum state $\ket{\psi_{t}}\in\mathcal{H}^{d}$ at each timestep. We first describe an i.i.d. quantum information source and then generalize to sources with memory.

II.3.1 Memoryless

A discrete-time quantum information source emits a $d$-level quantum system or qudit at each timestep. The statistical mixture of the infinite qudit sequences emitted by a source is a quantum process. As in the classical setting, different classes of quantum processes are distinguished by their temporal correlations. Now, however, for quantum sources we must use quantum information theory to account for both classical and quantal correlations.

First, consider the output of an i.i.d. (memoryless) quantum information source. Let $\mathcal{H}$ be a $d$-dimensional Hilbert space with pure states $\ket{\psi_{{x}}}\in\mathcal{H}$. A $d$-level i.i.d. quantum information source consists of a set $\mathcal{Q}$ of pure qudit states and a probability distribution over those states such that $\Pr(\ket{\psi_{{x}}})>0$ for all $\ket{\psi_{{x}}}\in\mathcal{Q}$. We refer to $\mathcal{Q}$ as a quantum alphabet and consider only quantum alphabets with a finite number of pure states.

At each discrete timestep $t$, the source emits state $\ket{\psi_{{x}}}$ with probability $\Pr(\ket{\psi_{{x}}})$. The resulting ensemble is described by the $d\times d$ density matrix:

[TABLE]

This particular pure-state decomposition of $\rho_{iid}$ is not unique. Moreover, an observer cannot determine $\mathcal{Q}$ through observations—unless $\mathcal{Q}$ consists of only one state—since many pure-state ensembles correspond to the same density matrix.

If an i.i.d. source emits $\rho_{iid}$ at each timestep then the quantum process generated by the source is simply the infinite tensor product state:

[TABLE]

II.3.2 Memoryful

We cannot describe non-i.i.d. sources using a single probability distribution over $\mathcal{Q}$ but must introduce a probability distribution over sequences of states drawn from $\mathcal{Q}$. We do this by associating each element of $\mathcal{Q}$ with an element in the symbol alphabet $\mathcal{X}$ of an underlying classical stochastic process $\smash{\overleftrightarrow{{X}}}$. Infinite qudit sequences then inherit probabilities from $\smash{\overleftrightarrow{{X}}}$. This construction results in qudit sequences that are separable—i.e., not entangled.

We express the relationship between symbols and pure quantum states via a memoryless classical-quantum channel $\mathcal{E}:\mathcal{X}\to\mathcal{H}$, taking $x\to\ket{\psi_{{x}}}$. This is also known as a preparation channel (or encoder); see App. B for more.

Preparation channels are dual to measurement channels, described later, that map quantum states to classical probability distributions and, via sampling, to particular symbols.

For the classical process $\smash{\overleftrightarrow{{X}}}$ whose realizations consist of symbols $x\in\mathcal{X}$, the associated quantum alphabet $\mathcal{Q}$ is constructed by passing each element of $\mathcal{X}$ through $\mathcal{E}$ such that $\mathcal{Q}=\{\mathcal{E}(x)\}$. Thus, $\mathcal{Q}$ is completely determined by $\mathcal{X}$ and $\mathcal{E}$. For example, in the i.i.d. case Eq. (3) can also be written $\rho_{iid}=\mathcal{E}(X)$, and each possible pure-state decomposition of $\rho_{iid}$ can now be interpreted as a different combination of classical random variable $X$ and preparation channel $\mathcal{E}$.

In a slight abuse of notation we write $\ket{\Psi_{-\infty:\infty}}=\mathcal{E}(\smash{\overleftrightarrow{{X}}})$ to indicate that quantum process $\ket{\Psi_{-\infty:\infty}}$ is formed by passing each random variable of $\smash{\overleftrightarrow{{X}}}$ through the classical-quantum channel $\mathcal{E}$.

Note that an infinite qudit sequence (separable or entangled) can be viewed as a one-dimensional lattice of qudits indexed by $t\in\mathbb{Z}$. These possibly-entangled states can be described in full generality using an operator-algebraic approach. We ground our formal definition of quantum processes in this mathematical setting. (Reference [17] provides a more detailed treatment of observable algebras for entangled qudit sequences over $\mathbb{Z}$.)

Let $\mathcal{B}_{t}$ be the $d$-dimensional matrix algebra describing all possible observables on lattice site $t$. (For $d=2$, the space of observables is spanned by the identity and the $2\times 2$ complex Pauli (Hermitian, unitary) matrices.) The state of the qudit at site $t$ can be described by the density matrix $\rho_{t}$ acting on $\mathcal{H}_{t}$ of dimension $d$. For a block of $\ell$ consecutive qudits, all observables can be described by the joint algebra over $\ell$ sites of the lattice: $\mathcal{B}_{0:\ell}=\bigotimes_{t=0}^{\ell-1}\mathcal{B}_{t}$, and the state of this block is $\rho_{0:\ell}$ acting on $\mathcal{H}_{0:\ell}=\bigotimes_{t=0}^{\ell-1}\mathcal{H}_{t}$, a Hilbert space of dimension $d^{\ell}$. Combining all local algebras allows one to define an algebra $\mathcal{B}$ over the infinite lattice. A quantum process is a particular state over the infinite lattice and can be written as $\ket{\Psi_{-\infty:\infty}}$.

As a necessary first step and to more readily adapt information-theoretic tools from classical processes, we return to the more restricted case: separable sequences of qudits drawn from a finite alphabet $\mathcal{Q}$ of pure qudit states. Given a classical word $w=x_{0}x_{1}\ldots x_{\ell-1}\in\mathcal{X}^{\ell}$ and a preparation channel $\mathcal{E}:\mathcal{X}\to\mathcal{Q}$, a qudit sequence takes the form:

[TABLE]

where $\ell$ is the length of the sequence and $\ket{\psi_{w}}\in\mathcal{H}_{0:\ell}$. Note that $\dim(\mathcal{H}_{0:\ell})=d^{\ell}$, $\mathcal{Q}=\{\mathcal{E}(x)\}$, and the number of possible qudit sequences of length $\ell$ is $|\mathcal{Q}|^{\ell}$ or—assuming all $\ket{\psi_{{x}}}$ are distinguishable—$|\mathcal{X}|^{\ell}$.

A separable quantum process is then defined by $\ket{\Psi_{-\infty:\infty}}=\mathcal{E}(\smash{\overleftrightarrow{{X}}})$. Different preparations—i.e., different combinations of $\smash{\overleftrightarrow{{X}}}$ and $\mathcal{E}$—may produce the same quantum process.

The set of length-$\ell$-block density matrices for a quantum process is given by:

[TABLE]

where $\ket{\psi_{w}}$ are the separable vectors given in Eq. (5). Conveniently, their probabilities are determined by those of the underlying classical stochastic process $\Pr(\smash{\overleftrightarrow{{X}}})$: $\Pr(\ket{\psi_{w}})=\Pr(w)$. Each $\rho_{0:\ell}$ is a finite subsystem of the pure quantum state $\ket{\Psi_{-\infty:\infty}}$ over the infinite lattice. We use left-inclusive/right-exclusive indexing for density matrices as well.

For a given $\rho_{0:\ell}$, one can also obtain a purification in a finite-dimensional Hilbert space [33]. It is important to note that, since $\rho_{0:\ell}$ does not have a unique pure-state decomposition, one cannot generally reconstruct the probabilities $\Pr(\ket{\psi_{w}})$ from it. Rather, $\rho_{0:\ell}$ contains only information accessible to an observer. And, if $\mathcal{Q}$ contains nonorthogonal qudit states ($\braket{\psi_{x}}{\psi_{x^{\prime}}}\neq 0$ for some $\ket{\psi_{x}}$,$\ket{\psi_{x^{\prime}}}\in\mathcal{Q}$) then an observer cannot unambiguously distinguish them.

In addition to separability, we also focus on stationary quantum processes, meaning:

[TABLE]

for all $\ell\in\mathbb{Z}^{+}$ and $t\in\mathbb{Z}$. If $\smash{\overleftrightarrow{{X}}}$ is stationary, then $\ket{\Psi_{-\infty:\infty}}=\mathcal{E}(\smash{\overleftrightarrow{{X}}})$ will be stationary by construction.

For an i.i.d. quantum process the joint probabilities of $\smash{\overleftrightarrow{{X}}}$ factor as in Eq. (1), giving the quantum process the form of Eq. (4). The length-$\ell$-block density matrix is represented by a product state:

[TABLE]

with $\rho_{iid}$ taking the form in Eq. (3).

For an underlying classical process $\smash{\overleftrightarrow{{X}}}$ that is Markov, there are additional subtleties. Joint probabilities of $\smash{\overleftrightarrow{{X}}}$ factor as in Eq. (2), so the joint probabilities of $\ket{\Psi_{-\infty:\infty}}=\mathcal{E}(\smash{\overleftrightarrow{{X}}})$ also factor so that:

[TABLE]

However, an observer cannot reliably distinguish between different states $\ket{\psi_{{x}}}$ when measuring a quantum process, and the underlying Markov dynamic is hidden from observation. Thus, the general setting for memoryful quantum processes is that of hidden Markov processes. These are best introduced using concrete models that directly represent a process’ structure.

II.4 Presentations of Quantum Processes

A presentation for a quantum process is a model with internal states and a transition dynamic between them that emits pure quantum states, rather than classical symbols. As for presentations of classical processes, we depict them with state transition diagrams. When $\smash{\overleftrightarrow{{X}}}$ is a Markov or hidden Markov process, $\ket{\Psi_{-\infty:\infty}}=\mathcal{E}(\smash{\overleftrightarrow{{X}}})$ can be represented with an extension of Ref. [14]’s classically-controlled qubit sources (cCQS), as follows.

A hidden Markov chain quantum source (HMCQS) is a triple $(\mathcal{S},\mathcal{Q},\mathcal{T})$ consisting of:

• •

A finite set $\mathcal{S}=\{\sigma_{1},\ldots,\sigma_{n}\}$ of internal states,

• •

A finite alphabet $\mathcal{Q}=\{\ket{\psi_{0}},\ldots,\ket{\psi_{m-1}}\}$ of pure qudit states, with each $\ket{\psi_{{x}}}\in\mathcal{H}^{d}$, and

• •

A set $\mathcal{T}=\{T^{x}:\ket{\psi_{{x}}}\in\mathcal{Q}\}$ of $m$ $n\times n$ transition matrices. That is, if the source is in state $\sigma_{i}$, with probability $T^{x}_{ij}=\Pr(\ket{\psi_{{x}}},\sigma_{j}|\sigma_{i})$ it emits qudit $\ket{\psi_{{x}}}$ while transitioning to internal state $\sigma_{j}$.

As with HMCs, the stationary distribution for an HMCQS satisfies $\pi=\pi\sum_{x}T^{x}$.

Any HMCQS that exactly reproduces a quantum process is a generative HMCQS, or generator of the process. Though quantum models cannot be predictive in the same sense as classical models, we can define an analog to classical unifilarity. A HMCQS is quantum unifilar if, for every state $\sigma\in\mathcal{S}$, there exists a possible measurement such that the internal state at time $t+1$ is completely determined if the state at time $t$ is $\sigma$. We discuss several implications of quantum unifilarity later.

We call a HMCQS a classical controller of a quantum process since there is nothing quantal about its internal states or transition dynamic. This is in contrast to related classes of quantum models that evolve a finite quantum system according to a quantum operation (defined via a set of Kraus operators) at each timestep. These include Quantum Markov Chains (QMCs) [34] and Hidden Quantum Markov Models (HQMMs) [35, 36, 37]. While HMCQS emit separable quantum states, QMC and HQMM generate sequences of measurement outcomes (each corresponding to a particular Kraus operator) that form classical stochastic processes.

Anticipating future effort, we consider it worthwhile to draw out several observations on entanglement between successive qudits at this point. Entanglement means that finite-length qudit sequences are not separable and so are not described by Eq. (5). Moreover, their sequence probabilities cannot be straightforwardly defined with reference to an underlying classical stochastic process.

That said, there are systematic ways of defining stationary $\ket{\Psi_{-\infty:\infty}}$ such that the set $\rho_{0:\ell}$ of marginals describe all measurements over blocks of $\ell$ qudits. For example, if the source’s internal structure consists of a $D$-dimensional quantum system interacting unitarily with one qudit per timestep, it generates a matrix product state (MPS) with a maximum bond dimension of $D$ [38]. If the source operates stochastically (rather than unitarily), then many different MPSs can be emitted with varying probabilities. The collection is then described by matrix-product density operators (MPDO) [39]. We refer to these as entangled qudit processes. Their dynamical and informational analyses are left for elsewhere. The present goal is to layout the basics for those efforts.

II.5 Measured Processes

An agent observing a quantum process has many ways to measure it. Let $M$ represent a measurement applied to the qudit in state $\rho$. In general, $M$ is a positive operator-valued measure (POVM) described by a set of positive semi-definite Hermitian operators $\{E_{y}\}$ on the Hilbert space $\mathcal{H}$ of dimension $d$. Each $E_{y}$ corresponds to a possible measurement outcome $y$, and POVM elements must sum to the identity:

[TABLE]

Projection-valued measures (PVMs) are an important subclass of POVMs with an additional constraint: operators $E_{y}$ must be orthogonal projectors. PVMs have at most $d$ elements. A PVM consisting only of rank-one projectors on $\mathcal{H}^{d}$ is a von Neumann measurement and has exactly $d$ elements [5].

A set of measurements applied to a block of $\ell$ qudits are described by some block POVM $\mathcal{M}_{0:\ell}$ with elements $\{E_{y_{0:\ell}}\}$ on the Hilbert space $\mathcal{H}_{0:\ell}$ of dimension $d^{\ell}$. $\mathcal{M}_{0:\ell}$ may include measurements in the joint basis of multiple qudits—measurements essential for fully characterizing entangled processes.

For separable processes we focus on “local” measurements—operators on a single qudit. The measurement operator for a block of $\ell$ qudits then takes a tensor product structure:

[TABLE]

where each $M_{t}$ is a POVM on $\mathcal{H}_{t}$.

If we apply the same local POVM $M$ to each qudit, then

[TABLE]

We refer to this as a repeated POVM measurement.

An observer can also have multiple POVMs at their disposal and apply different measurements at different time steps according to some measurement protocol. We describe measurement protocols in more detail shortly.

For simplicity, the following ignores $\rho_{0:\ell}$’s post-measurement state and considers only the measurement outcomes $y_{0:\ell}$. Thus, we take $\mathcal{M}_{0:\ell}$ to be a stochastic map $\rho_{0:\ell}\to Y_{0:\ell}$, the random variables representing measurement outcomes.

When applying a measurement of the form of Eq. (11) to a finite block of $\ell$ qudits, the outcomes factor into a block of $\ell$ classical random variables:

[TABLE]

where the possible values of each $Y_{t}$ are the POVM measurement outcomes $y\in\mathcal{Y}$. There are $|\mathcal{Y}|^{\ell}$ possible realizations of $Y_{0:\ell}$. We write a realization (word) of length-$\ell$ as $y_{0:\ell}$.

The probability of any particular measurement outcome for a block of $\ell$ qudits in state $\rho_{0:\ell}$ is:

[TABLE]

For $\rho_{0:\ell}$ with the separable form of Eq. (6) and identical POVM measurements on each qudit as in Eq. (11), we can decompose $E_{y_{0:\ell}}$ into $\ell$ local operators $E_{y_{t}}$:

[TABLE]

For a separable qudit process, a sequence $y_{0:\ell}$ of local measurement outcomes can also be interpreted as the result of sending random variables $X_{0:\ell}$ from $\smash{\overleftrightarrow{{X}}}$ over the same memoryless noisy channel $\mathcal{C}:\mathcal{X}\to\mathcal{Y}$. $\mathcal{C}$ decomposes into the deterministic preparation $\mathcal{E}$ and our stochastic measurement $\mathcal{M}$:

[TABLE]

(Appendix B presents a more thorough description of the classical-quantum channels $\mathcal{E}$ and $\mathcal{M}$.)

This construction makes it clear that measurement outcomes correspond to classical random variables $Y_{t}$ that take values $y\in\mathcal{Y}$ and form a classical process $\overleftrightarrow{Y}$ with probabilities defined by Eq. (12). To express the relationship between a quantum process and a measured classical process we write:

[TABLE]

where $\mathcal{M}$ is a repeated, local POVM. If the qudit process is separable, we can also write:

[TABLE]

II.6 Adaptive Measurement Protocols

An observer does not need to repeat the same measurement on every qudit but may apply different POVMs at different time steps according to some algorithm. If the agent uses past measurement outcomes to inform their choice of POVM we say they are using an adaptive measurement protocol.

The following limits discussion to measurement protocols that have a deterministic finite automata (DFA) as their underlying controller. Similar constructions combining quantum measurement and DFAs have appeared in the context of quantum grammars [40, 41, 42].

A deterministic quantum measurement protocol (DQMP) is defined by the quintuple $(\mathcal{S},S_{0},M,\mathcal{Y},\delta)$:

• •

A finite set $\mathcal{S}=\{\sigma_{1},\ldots,\sigma_{n}\}$ of internal states,

• •

A unique start state $S_{0}\in\mathcal{S}$,

• •

A set of POVMs $M=\{M_{s}\}_{\sigma_{s}\in\mathcal{S}}$, one for each internal state,

• •

An alphabet $\mathcal{Y}$ of $m$ symbols corresponding to different measurement outcomes, and

• •

A deterministic transition map $\delta:\mathcal{S}\times\mathcal{Y}\to\mathcal{S}$.

If $\mathcal{S}$ consists of only $S_{0}$, then the DQMP is a repeated POVM measurement for POVM $M_{S_{0}}$. When $\mathcal{S}$ has more than one internal state, the POVMs corresponding to different states may have the same or a different number of elements. Likewise the symbol sets corresponding to their measurement outcomes may be disjoint or symbols may be repeated.

We can place the following bounds on the size of the set $\mathcal{Y}$: $m\leq\sum_{s}|\{E_{s,y}\}|$, where $\{E_{s,y}\}$ is the set of operators corresponding to POVM $M_{s}$ and $m\geq\max_{s}|\{E_{s,y}\}|$, the size of the POVM with the most elements.

For DQMP $\mathcal{M}$ and qudit process $\ket{\Psi_{-\infty:\infty}}$, obtaining a measured process $\overleftrightarrow{Y}=\mathcal{M}(\ket{\Psi_{-\infty:\infty}})$ is generically more difficult than for the case of repeated POVM measurements. When an observer begins using protocol $\mathcal{M}$ at $t=0$ they experience two distinct operating regimes: first the transient dynamic, then the recurrent dynamic. We briefly outline this process and return to the subject when we describe synchronization—a task deeply related to the transient dynamic—in Section V.

$\mathcal{M}$ begins in state $S_{0}$ at $t=0$. For a given (stationary, ergodic) input $\ket{\Psi_{-\infty:\infty}}$, as $t\to\infty$ the DQMP approaches a stationary distribution over a subset of its internal states $\pi=\{\Pr(\sigma_{i})>0,\text{~{}for~{}all~{}}\sigma_{i}\in\mathcal{S}_{r}\}$, where $\mathcal{S}_{r}\subseteq\mathcal{S}$ is the set of recurrent states. This distribution (and even which states are in $\mathcal{S}_{r}$) depends on $\ket{\Psi_{-\infty:\infty}}$. The recurrent dynamic is determined by this stationary distribution and the transition probabilities between states in $\mathcal{S}_{r}$. Any state not in $\mathcal{S}_{r}$ is in the transient state set $\mathcal{S}_{t}$.

The transient dynamic describes how $\mathcal{M}$ goes from $S_{0}$ at $t=0$ to its recurrent dynamic over $\mathcal{S}_{r}$, which may occur at a finite time $t=t_{sync}$ or only asymptotically as $t\to\infty$. In general two dynamics produce two distinct measured processes $\overleftrightarrow{Y}_{r}$, which is stationary and ergodic by construction, and $Y_{0:t_{sync}}$ which is not. The final measured process has two components—i.e. $\overleftrightarrow{Y}=\{\overleftrightarrow{Y}_{r},Y_{0:t_{sync}}\}$.

II.7 Discussion

These nested layers of complication suggest working through a concrete example and restating the overall goals.

Imagine an observer measures a single qubit from a quantum source that emitted state $\rho_{t}$, using a projective measurement in the computational basis $M_{01}=\{\ket{0}\bra{0},\ket{1}\bra{1}\}$. The possible measurement outcomes $y_{0}=0$ and $y_{0}=1$ occur with probabilities:

[TABLE]

respectively. These two values determine the distribution for the random variable $Y_{0}$ and, by applying the same projective measurement to $\rho_{0:\ell}$, we completely determine the statistics $\Pr(Y_{0:\ell})$ of the measured block. Continuing this procedure for $\ell\to\infty$ defines the measured process $\overleftrightarrow{Y}$.

Naturally, the observer can also choose to apply measurements in another basis; e.g., $M_{\pm}=\{\ket{+}\bra{+},\ket{-}\bra{-}\}$ where $\ket{\pm}=\frac{1}{\sqrt{2}}(\ket{0}\pm\ket{1})$. This typically results in a measured process $\overleftrightarrow{Y}^{\prime}$ with radically-different statistical features.

Finally, an observer could use an adaptive measurement protocol $\mathcal{M}$. They start in state $s=S_{0}$ and measure with $M_{01}$. If $y_{0}=0$ they stay in $S_{0}$ and continue using $M_{01}$. If $y_{0}=1$, they transition to a new internal state and use $M_{\pm}$ on the next qubit. Regardless of the outcome of $M_{\pm}$ they return to $S_{0}$ and measure the next qubit with $M_{01}$. The measured process $\overleftrightarrow{Y}^{\prime\prime}$ will be distinct from both $\overleftrightarrow{Y}$ and $\overleftrightarrow{Y}^{\prime}$ and may consist of both a transient and recurrent component.

With this setting laid out, we can now more precisely state the questions the following development answers:

Given the density matrices $\rho_{0:\ell}$ describing sequences of $\ell$ separable qudits, what are the general properties of sequences $Y_{0:\ell}$ of measurement outcomes? This is Section III’s focus. There, $\rho_{0:\ell}$’s quantum information properties bound the classical information properties of measurement sequences $Y_{0:\ell}$ for certain classes of measurements. 2. 2.

Given a hidden Markov chain quantum source, when is an observer with knowledge of the source able to determine the internal state (synchronize)? Can the observer remain synchronized at later times? Section V addresses this. 3. 3.

If an observer encounters an unknown qudit source, how accurately can the observer estimate the informational properties of the emitted process through tomography with limited-resources? How can they build approximate models of the source if they reconstruct $\rho_{0:\ell}$ for some finite $\ell$? This is Section VI’s subject.

Additionally, Section IV illustrates these general results and the required analysis methods using specific examples of qudit processes.

III Information in Quantum Processes

We wish to develop an information-theoretic analysis of quantum processes for which the observed sequences depend on the observer’s choice of measurement. (Much of this parallels the classical information measures reviewed in App. A.) This requires a more general approach using density matrices $\rho_{0:\ell}$ that contain all the information necessary to describe the outcome of any measurement performed on $\ell$-qudit blocks. We use quantum information theory to study properties of the set of $\rho_{0:\ell}$’s and then relate them to classical properties of measurement sequences described in App. A. We begin by briefly reviewing several basic quantities in quantum information theory. References [6] and [33] give a more complete picture of the subject.

III.1 von Neumann Entropy

In quantum information theory the von Neumann entropy plays a role similar to that of the Shannon entropy in classical information theory. Given a quantum mixed quantum state $\rho$, the von Neumann entropy is:

[TABLE]

where $\lambda_{i}$’s are the eigenvalues of the density matrix $\rho$. $S(\rho)=0$ if and only if $\rho$ is a pure state. We use $\log_{2}(\cdot)$, therefore the units of the von Neumann entropy will be bits.

From Eq. (13), the von Neumann entropy is the Shannon entropy of the eigenvalue distribution of density matrix $\rho$. Therefore:

[TABLE]

where $\operatorname{H}\left[\cdot\right]$ is the Shannon entropy and the minimum is taken over the set of all rank-one POVMs. The minimum will always be a PVM with projectors that compose $\rho$’s eigenbasis [6]. We use brackets to indicate that $M(\rho)$ is a classical probability distribution over measurement outcomes.

To monitor correlations between two quantum systems we use the quantum relative entropy:

[TABLE]

where $\rho$ and $\sigma$ are the density operators of the two systems. The quantum relative entropy is nonnegative:

[TABLE]

with equality if and only if $\rho=\sigma$, a result known as Klein’s Inequality [33].

The joint quantum entropy for a state $\rho^{AB}$ of a bipartite system $AB$ is:

[TABLE]

We can further define a conditional quantum entropy of system $A$ conditioned on system $B$ as:

[TABLE]

where $S(B)=S(\rho^{B})$. Note that $S(A|B)\neq S(B|A)$.

In contrast to the classical case, the conditional quantum entropy may be negative—a phenomenon leveraged in super-dense coding protocols [6]. Equivalently, the conditional quantum entropy can be written using the quantum relative entropy as:

[TABLE]

where $\mathbb{I}^{A}$ is the identity operator on Hilbert space $\mathcal{H}^{A}$ with dimension $d_{A}$.

The quantum mutual information between quantum subsystems $A$ and $B$ is given by:

[TABLE]

The quantum mutual information is symmetric and nonnegative. If the joint system $AB$ is in a pure state, then $S(A,B)$ will be zero, and $S(A)=S(B)$. It can also be expressed as a quantum relative entropy as:

[TABLE]

A few additional well-known properties of the von Neumann entropy facilitate later results. First, each $\rho_{0:\ell}$ for separable qudit sequences is a finite mixture of states formed from length-$\ell$ words of an underlying classical process, so the following will be useful:

Lemma 1**.**

Consider a random variable $X$ that takes values $x\in\{0,1,\ldots,n\}$ with corresponding probabilities $\{p_{0},p_{1},\ldots p_{n}\}$. Given a set of density matrices $\{\rho_{0},\rho_{1},\ldots,\rho_{n}\}$, the following inequality holds [33]:

[TABLE]

with equality if and only if the all $\rho_{x}$ have support on orthogonal subspaces.

Second, since we use quantum channels to both prepare and measure a qudit process, we make use of the fact that the quantum relative entropy is monotonic [6]:

[TABLE]

where $\mathcal{E}$ is any quantum channel. This inequality becomes an equality if and only if there exists a recovery map $\mathcal{R}$ such that $\mathcal{R}(\mathcal{E}(\rho))=\rho$ and $\mathcal{R}(\mathcal{E}(\sigma))=\sigma$ [43].

III.2 Quantum Block Entropy

Since stationary qudit processes are correlated across time, we explore how the von Neumann entropy for qudit blocks scales with block size. The following gives bounds on the possible measurement sequences one can observe from a quantum information source. As the von Neumann entropy generalizes Shannon entropy, the results here (and many of the proofs) are natural generalizations of those in App. A. We also note that exactly determining $\rho_{0:\ell}$ becomes practically infeasible for large $\ell$. And so, Section VI addresses how to approximate properties and models for qudit processes when restricted to measurements of finite length blocks.

For a qudit process we define the quantum block entropy as the von Neumann entropy of a block of $\ell$ consecutive qudits:

[TABLE]

If $\rho_{0:\ell}$ is a pure state, $S(\ell)=0$. By the same logic as the classical case, $S(0)\equiv 0$.

Many properties of the classical block entropy hold for $S(\ell)$.

Proposition 1**.**

For a stationary qudit process $S(\ell)$ is a nondecreasing function of $\ell$.

Proof**.**

As a consequence of the strong subadditivity of the von Neumann entropy [33]:

[TABLE]

Let $\rho^{ABC}=\rho_{0:2\ell+1}$, where $\rho^{A}=\rho_{0:\ell}$, $\rho^{B}=\rho_{\ell}$, and $\rho^{C}=\rho_{\ell+1:2\ell+1}$.

Incorporating qudit process stationarity, we rewrite Eq. (22):

[TABLE]

where Eq. (23) follows from stationarity.

Thus, $S(\ell)\leq S(\ell+1)$, for all $\ell\geq 0$, and $S(\ell)$ is a nondecreasing function of $\ell$.

Proposition 2**.**

For a stationary qudit process $S(\ell)$ is concave.

Proof**.**

The von Neumann entropy is strongly subadditive [33], meaning that:

[TABLE]

For $\ell\geq 3$, let $\rho^{ABC}=\rho_{0:\ell}$ where $\rho^{A}=\rho_{0}$, $\rho^{B}=\rho_{1:\ell-1}$, and $\rho^{C}=\rho_{\ell-1}$

We can rewrite Eq. (24) by incorporating the stationarity of qudit processes:

[TABLE]

where Eq. (25) follows from stationarity.

Thus, $S(\ell)$ is concave.

For a separable qudit process formed by passing a classical process through a classical-quantum channel, their block entropies are related in the following way:

Proposition 3**.**

Let $\ket{\Psi_{-\infty:\infty}}=\mathcal{E}(\smash{\overleftrightarrow{{X}}})$. The block entropies of $\ket{\Psi_{-\infty:\infty}}$ and $\smash{\overleftrightarrow{{X}}}$ obey:

[TABLE]

for all $\ell$, with equality if and only if $\mathcal{Q}$ consists of $|\mathcal{X}|$ orthogonal pure states in $\mathcal{H}$ of dimension $d\geq{|\mathcal{X}|}$.

Proof**.**

Recall from Eq. (6) that for separable qudit processes:

[TABLE]

with each $\ket{\psi_{w}}$ taking the separable form of Eq. (5) and $w=x_{0:\ell}$.

We first note that, for all symbols in $\mathcal{X}$ to be associated with orthogonal qudit states, the minimum dimension of the Hilbert space is $d_{min}=|\mathcal{X}|$.

With $\rho_{0:\ell}$ written as a mixture of separable qudit words, we apply Lemma 1 to obtain:

[TABLE]

where $w=x_{0:\ell}$. The second term evaluates to zero in the final line since each $\ket{\psi_{w}}$ is a pure state. That is, $S(\ket{\psi_{w}})=0$ for all $w\in\mathcal{X}^{\ell}$.

Equality occurs if and only if the states $\ket{\psi_{w}}$ have support on orthogonal subspaces, which requires that $d\geq|\mathcal{X}|$ and all elements of $\mathcal{Q}$ are orthogonal.

We cannot use $S(\rho_{0:\ell})$ to bound the block entropy of a measured process $\overleftrightarrow{Y}$ for general POVM measurements. For the case where the measurement $\mathcal{M}_{0:\ell}$ consists only of rank-one POVMs (including all PVMs), however, the following holds:

[TABLE]

with equality if and only if the measurement is performed in the minimum-entropy (eigen)basis of $\rho_{0:\ell}$. This follows directly from Eq. (14).

Proposition 4**.**

Let $\overleftrightarrow{Y}=\mathcal{M}(\ket{\Psi_{-\infty:\infty}})$, where $\mathcal{M}$ is a repeated rank-one POVM measurement. The block entropies of $\ket{\Psi_{-\infty:\infty}}$ and $\overleftrightarrow{Y}$ then obey:

[TABLE]

for all $\ell$, with equality if and only if $\ket{\Psi_{-\infty:\infty}}$ is a separable process with an orthogonal alphabet $\mathcal{Q}$, and $\mathcal{M}$ uses a POVM whose operators include one projector for each element in $\mathcal{Q}$.

Proof**.**

The bound follows directly from Eq. (26) because repeated rank-one POVM measurements are a subclass of the more general measurement sequence $\mathcal{M}_{0:\ell}$.

The condition for equality also follows from Eq. (26) but requires more justification. First, we consider measuring the single-qubit marginal $\rho_{0}$ with POVM $M$. For equality each element of the eigenbasis of $\rho_{0}$ ($\{\ket{e_{i}}\}$) must have a corresponding operator in $M$ that is a projector on that eigenspace ($E_{i}=\ket{e_{i}}\bra{e_{i}}$).

We can write $\rho_{0}=\sum_{i}p_{i}\ket{e_{i}}\bra{e_{i}}$. Since we apply the same POVM to each qudit, all blocks of length-$\ell$ must have eigenstates of the form $\bigotimes_{t=0}^{\ell-1}\ket{e_{t}}$—i.e., they must take the separable form of Eq. (5)—making $\ket{\Psi_{-\infty:\infty}}$ a separable process with a quantum alphabet $\mathcal{Q}$ of orthogonal states. The $M$ consisting of projectors onto the states in $\mathcal{Q}$ is then the minimum-entropy measurement over blocks $\rho_{0:\ell}$. Note that there may be other elements of the POVM that are not projectors if the probability of those measurement outcomes is [math] when applied to $\rho_{0:\ell}$. (If the process does not make use of that part of Hilbert space, it does not matter how it is measured.)

To summarize, in the case of separable qudit processes, $S(\ell)$ is upper-bounded by the underlying classical process’ block entropy $\operatorname{H}\left[X_{0:\ell}\right]$. For repeated measurement with rank-one POVMs, $S(\ell)$ serves as a lower bound on the block entropy of all classical measured processes $\operatorname{H}\left[Y_{0:\ell}\right]$. There is no direct relationship between $\operatorname{H}\left[X_{0:\ell}\right]$ and $\operatorname{H}\left[Y_{0:\ell}\right]$. Rather, it depends on the specifics of $\mathcal{E}$ and $\mathcal{M}$.

III.3 von Neumann Entropy Rate

The von Neumann entropy rate of a qudit process is:

[TABLE]

The units of $s$ are bits per timestep. This quantity is equivalent to the mean entropy, first introduced in the context of quantum statistical mechanics [44]. The limit exists for all stationary processes [45]. Operationally, $s$ is the optimal coding rate for a stationary quantum source [17].

Proposition 5**.**

For a stationary qudit process we can equivalently write the von Neumann entropy rate as:

[TABLE]

Proof**.**

This proof closely follows the proof for classical entropy rate in Ref. [46]. We begin by showing that $\lim_{\ell\to\infty}S(\rho_{0}|\rho_{-\ell:0})$ exists and then that it is equivalent to the limit in Eq. (27). The limit exists if $S(\rho_{0}|\rho_{-\ell:0})$ is a decreasing, nonnegative function of $\ell$:

[TABLE]

where Eq. (29) follows from stationarity and Eq. (30) follows from the nondecreasing nature of $S(\ell)$. This, combined with the fact that $S(\ell)$ is concave, means $\lim_{\ell\to\infty}S(\rho_{0}|\rho_{-\ell:0})$ exists.

Now, we establish that $\lim_{\ell\to\infty}S(\rho_{0}|\rho_{-\ell:0})=\lim_{\ell\to\infty}S(\ell)/\ell$. Through repeated application of Eq. (17) to a block of length-$\ell$ we obtain the following chain rule for the von Neumann entropy:

[TABLE]

We can modify indices (due to stationarity) and divide both sides by $\ell$ to obtain:

[TABLE]

The final steps require the following result, known as the Cesáro mean [46]:

Lemma 2**.**

If $a_{n}\to a$ and $b_{n}=\frac{1}{n}\sum_{i=1}^{n}a_{i}$, then $b_{n}\to a$.

Taking the limit of both sides of Eq. (32) and applying Lemma 2, we find:

[TABLE]

Using stationarity, $\lim_{\ell\to\infty}S(\rho_{\ell}|\rho_{\ell-1}\ldots\rho_{1})=\lim_{\ell\to\infty}S(\rho_{0}|\rho_{-\ell:0})$. When combined with Eq. (33) this proves that our two definitions of $s$ are equivalent.

To motivate a number of the following results it is important to appreciate that simply because a process has a von Neumann entropy rate given by Eq. (27) does not imply that an observer is able to perform a measurement on any qudit such that the uncertainty in that individual measurement is $s$. Rather, obtaining $s$ corresponds to the measurement basis over the entire chain of qudits for which the distribution of outcomes has the minimal Shannon entropy. This basis is highly nonlocal or otherwise experimentally infeasible for many nontrivial examples. As in the classical case, $s$ appears graphically as the slope of $S(\ell)$ as $\ell\to\infty$, as shown in Fig. 2.

For separable qudit processes, we can also relate $s$ to the classical entropy rate of the underlying process $\smash{\overleftrightarrow{{X}}}$, as follows:

Proposition 6**.**

Let $\ket{\Psi_{-\infty:\infty}}=\mathcal{E}(\smash{\overleftrightarrow{{X}}})$. The von Neumann entropy rate $s$ of $\ket{\Psi_{-\infty:\infty}}$ then obeys the bound:

[TABLE]

where $h_{\mu}^{X}$ is the Shannon entropy rate of $\smash{\overleftrightarrow{{X}}}$. Equality occurs if and only if $\mathcal{Q}$ consists of $|\mathcal{X}|$ orthogonal pure states in $\mathcal{H}^{d}$ of dimension $d\geq|\mathcal{X}|$.

Proof**.**

Divide both sides of Prop. 3 by $\ell$ and take the limit of both sides as $\ell\to\infty$ to obtain:

[TABLE]

From Eq. (27), the left side is $s$, and from Eq. (54) the right side $h_{\mu}^{X}$. The condition for equality is inherited from Prop. 3, concluding the proof.

Restricting once again to repeated measurements with rank-one POVMs, we can prove the following bound for measured processes:

Proposition 7**.**

Let $\overleftrightarrow{Y}=\mathcal{M}(\ket{\Psi_{-\infty:\infty}})$ and let $\mathcal{M}$ be a repeated rank-one POVM. The measured entropy rate $h_{\mu}^{Y}$ then obeys:

[TABLE]

where $s$ is the von Neumann entropy rate of $\ket{\Psi_{-\infty:\infty}}$, with equality if and only if $\ket{\Psi_{-\infty:\infty}}$ is a separable process with an orthogonal alphabet $\mathcal{Q}$, and $\mathcal{M}$ uses a POVM whose operators include a projector for each element in $\mathcal{Q}$.

Proof**.**

Divide both sides of Prop. 4 by $\ell$ and take the limit of both sides as $\ell\to\infty$ to obtain:

[TABLE]

The left side is $s$ and the right side $h_{\mu}^{Y}$. The conditions for equality are inherited from Prop. 4, concluding the proof.

III.4 Quantum Redundancy

Unlike a classical process, the maximum entropy rate for a qudit process depends on the size of the Hilbert space rather than on the size of the alphabet $\mathcal{Q}$. For Hilbert space of dimension $d$, the largest possible value of $s$ is $\log_{2}(d)$, corresponding to an i.i.d. sequence of qudits, each in a maximally-mixed state $\rho_{iid}=\mathbb{I}/d$.

A qudit process can be compressed down to its von Neumann entropy rate $s$. The amount that it can be compressed is the quantum redundancy:

[TABLE]

Statistical biases in individual qudits and temporal correlations between them offer opportunities for compression. $\mathbf{R}_{q}$ includes the effects of both.

For separable qudit processes we can bound the quantum redundancy using properties of the underlying classical process:

Proposition 8**.**

Let $\smash{\overleftrightarrow{{X}}}$ be a classical process with redundancy $\mathbf{R}^{X}$, symbol alphabet $\mathcal{X}$, and entropy rate $h_{\mu}^{X}$, and let $\ket{\Psi_{-\infty:\infty}}=\mathcal{E}(\smash{\overleftrightarrow{{X}}})$ be a qudit process with redundancy $\mathbf{R}_{q}$, Hilbert space of dimension $d$, and entropy rate $s$.

For $d\geq|\mathcal{X}|$:

[TABLE]

with equality if and only if $d=|\mathcal{X}|$ and $\mathcal{Q}$ consists of $|\mathcal{X}|$ orthogonal pure states.

For $d<|\mathcal{X}|$,

[TABLE]

where the term $(h_{\mu}^{X}-s)$ is always positive from Prop. (6).

Proof**.**

First, consider $d=|\mathcal{X}|$:

[TABLE]

The final line comes from Prop. 6, as does the condition for equality.

For $d>|\mathcal{X}|$:

[TABLE]

There is no opportunity for equality. In this case, $\mathcal{Q}$ will not span $\mathcal{H}$, naturally leading to more redundancy.

Finally, for $d<|\mathcal{X}|$:

[TABLE]

concluding the proof.

We can also compare the classical redundancy of a measured process (obtained through repeated use of a rank-one POVM) to the quantum redundancy of the qudit process being measured.

Proposition 9**.**

Let $\overleftrightarrow{Y}$ be a measured process such that $\overleftrightarrow{Y}=\mathcal{M}(\ket{\Psi_{-\infty:\infty}})$, and $\mathcal{M}$ a repeated rank-one POVM. Let $\overleftrightarrow{Y}$ have redundancy $\mathbf{R}^{Y}$, and let $\ket{\Psi_{-\infty:\infty}}$ have quantum redundancy $\mathbf{R}_{q}$. Then:

[TABLE]

with equality if and only if $d=|\mathcal{Y}|$, $\ket{\Psi_{-\infty:\infty}}$ is a separable process with an orthogonal alphabet $\mathcal{Q}$, and $\mathcal{M}$ uses a POVM whose operators include a projector for each element in $\mathcal{Q}$.

Proof**.**

A rank-one POVM on $\mathcal{H}$ must have at least $d$ elements, therefore $|\mathcal{Y}|\geq d$:

[TABLE]

Going from the first line to the second provides a condition for equality: $d=|\mathcal{Y}|$. Proposition 7 is used in the final line and provides the other conditions for equality.

III.5 Quantum Entropy Gain

We can take discrete-time derivatives of $S(\ell)$, as was done for $\operatorname{H}\left[\ell\right]$ in [11]. This process is summarized in App. A. We call the first derivative of $S(\ell)$ the quantum entropy gain:

[TABLE]

for $\ell>0$. The units for the quantum entropy gain are bits per timestep, and we set the boundary condition $\Delta S(0)=\log_{2}(d)$. Since $S(\ell)$ is monotone-increasing, $\Delta S(\ell)\geq 0$.

The quantum entropy gain is the amount of additional uncertainty introduced by including the $\ell\textsuperscript{th}$ qudit in a block, where that uncertainty is quantified by the von Neumann entropy.

By combining Eq. (36) and Eq. (17), we can write $\Delta S(\ell)$ as:

[TABLE]

This allows relating the quantum entropy gain and the von Neumann entropy rate as follows:

[TABLE]

Thus, paralleling the classical case, the quantum entropy gain serves as a finite-$\ell$ approximation of the von Neumann entropy rate:

[TABLE]

$s(\ell)$ serves as the best estimate for the entropy rate of a qudit process that can be made by an observer who only has access to measurement statistics for length-$\ell$ blocks of qudits.

The way in which the entropy rate estimate converges and its relationship to other information properties of a qudit process are summarized in Fig. 3.

III.6 Quantum Predictability Gain

We call the second derivative of $S(\ell)$ the quantum predictability gain, given by:

[TABLE]

for $\ell>0$. The units of $\Delta^{2}S(\ell)$ are bits per timestep2. Since $S(\ell)$ is concave, then $\Delta^{2}S(\ell)\leq 0$. $|\Delta^{2}S(\ell)|$ quantifies how much an observer’s estimate of the von Neumann entropy rate $s$ improves if they are enlarge their observations from blocks of $\ell-1$ to blocks of $\ell$ qudits. The generic convergence behavior of $\Delta^{2}S(\ell)$ is shown in Fig. 4.

For all higher-order discrete derivatives of $S(\ell)$ (as with the classical block entropy):

[TABLE]

This follows directly from the existence of the limit in Eq. (27) for stationary quantum states.

III.7 Total Quantum Predictability

Up to this point, introducing new information-theoretic characteristics of separable quantum processes proceeded by taking discrete-time derivatives of the von Neumann block entropy. We can likewise integrate the functions $\Delta^{n}S(\ell)$, as is done for the classical case with Eq. (56). While this starts off straightforwardly, a number of interesting new informational quantities emerge.

These properties of qudit processes take the general form:

[TABLE]

where $\ell_{0}$ is the first value of $\ell$ for which $\Delta^{n}S(\ell)$ is defined.

$\mathcal{I}^{q}_{2}$, the first of these, monitors the convergence of the quantum predictability gain $\Delta^{2}S(\ell)$ to its limit of [math] for $\ell\to\infty$. We use $\ell_{0}=1$ to get the total quantum predictability $\mathbf{G}_{q}$:

[TABLE]

The units of $\mathbf{G}_{q}$ are bits per timestep. Note that $\mathbf{G}_{q}\leq 0$ because $\Delta^{2}S(\ell)\leq 0$ for all $\ell$.

$\mathbf{G}_{q}$ can be interpreted by relating it to a previously-established property of qudit processes: the quantum redundancy.

Proposition 10**.**

For a stationary qudit process:

[TABLE]

Proof**.**

Applying Eq. (56) to Eq. (39) we find that:

[TABLE]

Here, the second line follows from Eq. (37) and the third from Eq. (34).

Thus, $|\mathbf{G}_{q}|$ is the total amount of predictable information per timestep for a qudit process.

Rather immediately, one sees that the amount of information in an individual qudit decomposes into:

[TABLE]

$|\mathbf{G}_{q}|$ is the amount of quantum information within a qudit that is predictable. Whereas, $s$ is the amount of information that is irreducibly random.

The relation $|\mathbf{G}_{q}|=\mathbf{R}_{q}$ can be combined with Props. 8 and 9 to prove two corollaries.

Corollary 1**.**

Let $\smash{\overleftrightarrow{{X}}}$ be a classical process with total predictability $\mathbf{G}^{X}$ and symbol alphabet $\mathcal{X}$, and entropy rate $h_{\mu}^{X}$, and let $\ket{\Psi_{-\infty:\infty}}=\mathcal{E}(\smash{\overleftrightarrow{{X}}})$ be a qudit process with total quantum predictability $\mathbf{G}_{q}$, Hilbert space of dimension $d$ and entropy rate $s$.

For $d\geq|\mathcal{X}|$:

[TABLE]

with equality if and only if $d=|\mathcal{X}|$ and $\mathcal{Q}$ consists of $|\mathcal{X}|$ orthogonal pure states.

For $d<|\mathcal{X}|$,

[TABLE]

where the term $(h_{\mu}^{X}-s)$ is always positive from Prop. (6).

Proof**.**

This follows immediately from combining Props. 8 and 10.

Corollary 2**.**

Let $\overleftrightarrow{Y}$ be a measured process such that $\overleftrightarrow{Y}=\mathcal{M}(\ket{\Psi_{-\infty:\infty}})$, and $\mathcal{M}$ is a repeated rank-one POVM. Let $\overleftrightarrow{Y}$ have redundancy $\mathbf{G}^{Y}$, and let $\ket{\Psi_{-\infty:\infty}}$ have quantum redundancy $\mathbf{G}_{q}$. Then:

[TABLE]

with equality if and only if $d=|\mathcal{Y}|$, $\ket{\Psi_{-\infty:\infty}}$ is a separable process with an orthogonal alphabet $\mathcal{Q}$, and $\mathcal{M}$ uses a POVM whose operators include a projector for each element in $\mathcal{Q}$.

Proof**.**

This follows immediately from combining Props. 9 and 10.

Graphically, the total quantum predictability is the area between the predictability gain curve and its linear asymptote of [math], as seen in Fig. 4. The von Neumann entropy rate and total predictability lend insight into compression limits for a stationary sources. They do not say, however, whether that compression is achievable due to bias within individual qudit states or correlations between qudits. For that we must continue our way back up the entropy hierarchy.

III.8 Quantum Excess Entropy

The convergence of $s(\ell)$ to the true von Neumann entropy rate $s$ is quantified with the quantum excess entropy:

[TABLE]

The units for ${\bf E}_{q}$ are bits. Paralleling the classical case, we refer to any qudit process with finite ${\bf E}_{q}$ as finitary and those with infinite ${\bf E}_{q}$ as infinitary.

We can further express ${\bf E}_{q}$ in terms of the asymptotic behavior of $S(\ell)$.

Proposition 11**.**

The quantum excess entropy can be written as:

[TABLE]

Proof**.**

We evaluate the discrete integral in Eq. (40) with Eq. (56) using partial sums:

[TABLE]

since $S(0)=0$ by definition.

For finitary quantum processes, ${\bf E}_{q}$ is the area between the entropy gain curve and its asymptote $s$ as seen in Fig. 3. It also appears in Fig. 2 as the vertical offset of the linear asymptote to the $S(\ell)$ curve.

This leads to a natural scaling of the quantum block entropy as:

[TABLE]

as $\ell\to\infty$.

A clearer interpretation of ${\bf E}_{q}$ as a quantum mutual information is provided by the following proposition:

Proposition 12**.**

The quantum excess entropy can be written as:

[TABLE]

where $\rho_{-\ell:0}$ and $\rho_{0:\ell}$ are two blocks of $\ell$ consecutive qudits with a shared boundary.

Proof**.**

The quantum mutual information, from Eq. (19), between two neighboring blocks of $\ell$ qudits can be expressed as:

[TABLE]

where the final line is obtained through repeated application of Eq. (17).

Taking $\ell\to\infty$:

[TABLE]

where the final line follows from Eq. (32) and stationarity.

This final expression is equivalent to the form of ${\bf E}_{q}$ derived in Prop. 11, concluding the proof.

${\bf E}_{q}$ is therefore a measure of all the correlations between two halves of the infinite sequence of qudits. ${\bf E}_{q}=0$, if and only if a source is i.i.d. (with $S(\ell)=s\ell$).

We can relate ${\bf E}_{q}$ for a separable qudit process to ${\bf E}^{X}$ of the underlying classical process:

Proposition 13**.**

Let $\smash{\overleftrightarrow{{X}}}$ be a classical process with alphabet $\mathcal{X}$ and excess entropy ${\bf E}^{X}$, and let $\ket{\Psi_{-\infty:\infty}}=\mathcal{E}(\smash{\overleftrightarrow{{X}}})$ be a qudit process with alphabet $\mathcal{Q}$ and quantum excess entropy ${\bf E}_{q}$.

Then:

[TABLE]

with equality if and only if $\mathcal{Q}$ consists of $|\mathcal{X}|$ orthogonal states.

Proof**.**

Consider ${X}_{-\ell:\ell}$, a block of length $2\ell$ of the classical process $\smash{\overleftrightarrow{{X}}}$. We can write realizations of ${X}_{-\ell:\ell}$ into a classical register to form the state:

[TABLE]

where all $\ket{x_{-\ell:\ell}}$ are orthogonal. Then we pass each symbol through the preparation channel $\mathcal{E}$ to obtain blocks of our qudit process $\rho_{-\ell:\ell}=\mathcal{E}^{2\ell}(\rho^{C}_{-\ell:\ell})$, where $\mathcal{E}^{2\ell}=\bigotimes_{i=0}^{2\ell}\mathcal{E}$.

We can express the quantum mutual information as a quantum relative entropy, Eq. (20), giving the following relation:

[TABLE]

where Eq. (43) comes from the monotonicity of the quantum relative entropy in Eq. (21). The condition for equality comes from Eq. (21) as well. The set of states for which the recovery map must exist is $\mathcal{Q}$, and this is only possible if all $\ket{\psi_{{x}}}$ are distinguishable—i.e., orthogonal.

Using Eq. (62), to write the excess entropy of $\smash{\overleftrightarrow{{X}}}$ as a limit we see that:

[TABLE]

A similar bound appears when we apply a repeated POVM measurement to the quantum process to obtain a classical process.

Proposition 14**.**

Let $\overleftrightarrow{Y}$ be a measured process such that $\overleftrightarrow{Y}=\mathcal{M}(\ket{\Psi_{-\infty:\infty}})$, and $\mathcal{M}$ is a repeated rank-one POVM. Let $\overleftrightarrow{Y}$ have excess entropy ${\bf E}^{Y}$, and let $\ket{\Psi_{-\infty:\infty}}$ have quantum excess entropy ${\bf E}_{q}$. Then:

[TABLE]

with equality if and only if $\ket{\Psi_{-\infty:\infty}}$ is a separable process with an orthogonal alphabet $\mathcal{Q}$ and $\mathcal{M}$ uses a POVM whose operators include a projector for each element in $\mathcal{Q}$.

Proof**.**

Consider $\rho_{-\ell:\ell}$—a block of length $2\ell$ of the quantum process $\ket{\Psi_{-\infty:\infty}}$—and let $\mathcal{M}$ be a repeated measurement of rank-one POVM $M$ with elements $\{E_{y}\}$ so that $M(\rho_{t})=\sum_{y}\Pr(y)\ket{y}\bra{y}$, $\Pr(y)=tr(E_{y}\rho_{t})$, and all $\ket{y}$ are orthogonal. The repeated measurement applied over a block of length $\ell$ is then $\mathcal{M}_{0:\ell}=\bigotimes_{i=0}^{\ell-1}M$.

We express the quantum mutual information as a quantum relative entropy (using Eq. (20)), and apply Eq. (21) to obtain:

[TABLE]

The condition for equality comes from Eq. (21) as well. The set of states for which the recovery map must exist is $\{\ket{y}\}$, and this is only possible if all $\ket{\psi_{{x}}}\in\mathcal{Q}$ are orthogonal, and $M$ contains a projector for each $\ket{\psi_{{x}}}$. By the same argument as Prop. 4, $\ket{\Psi_{-\infty:\infty}}$ must be a separable process, and $\mathcal{Q}$ must consist of orthogonal states.

Taking the limit $\ell\to\infty$ we see that:

[TABLE]

Combining the above proofs we obtain the following corollary relating the excess entropies of the underlying classical process $\smash{\overleftrightarrow{{X}}}$ and the measured process $\overleftrightarrow{Y}$:

Corollary 3**.**

Let $\smash{\overleftrightarrow{{X}}}$ be a classical process with excess entropy ${\bf E}^{X}$ and alphabet $\mathcal{X}$, let $\ket{\Psi_{-\infty:\infty}}=\mathcal{E}(\smash{\overleftrightarrow{{X}}})$ be a separable qudit process with alphabet $\mathcal{Q}$, and let $\overleftrightarrow{Y}$ be a measured process with excess entropy ${\bf E}^{Y}$ such that $\overleftrightarrow{Y}=\mathcal{M}(\ket{\Psi_{-\infty:\infty}})$ where $\mathcal{M}$ is a repeated rank-one POVM.

Then:

[TABLE]

with equality if and only if $\mathcal{Q}$ consists of $|\mathcal{X}|$ orthogonal states and $\mathcal{M}$ uses a POVM whose operators include a projector for each element in $\mathcal{Q}$.

Proof**.**

This follows immediately from combining Props. 13 and 14.

An exact value of ${\bf E}_{q}$ typically requires characterizing infinite-length sequences of qudits. However, we can write a finite-$\ell$ estimate of ${\bf E}_{q}$ using Eq. (41):

[TABLE]

that generally underestimates ${\bf E}_{q}$’s true value.

III.9 Quantum Transient Information

We now turn to look at how the quantum block entropy curve converges to its linear asymptote ${\bf E}_{q}+s\ell$. We define the quantum transient information as:

[TABLE]

The units of ${\bf T}_{q}$ are bits$\times$time steps.

${\bf T}_{q}$ is represented graphically as the area between the $S(\ell)$ curve and its linear asymptote for $\ell\to\infty$, as seen in Fig. 2. We will see that ${\bf T}_{q}$ distinguishes between periodic qudit processes that cannot be distinguished with previous information quantities such as ${\bf E}_{q}$ and $s$.

Proposition 15**.**

The transient quantum information ${\bf T}_{q}$ can be written:

[TABLE]

Proof**.**

The proof reduces to the straightforward proof for transient information of a classical stochastic process in Ref. [11]. It depends only upon Eq. (46) and Eq. (56), that have the same form in the quantum case as the classical case.

This expression allows us to estimate ${\bf T}_{q}$ for a given quantum process as:

[TABLE]

that generally underestimates the true value of ${\bf T}_{q}$.

${\bf T}_{q}$ is related to the minimal amount of information necessary for an observer to synchronize to a HMCQS. We say an observer is synchronized when they are able to determine a source’s internal state. If $S(\ell)$ converges to its linear asymptote at finite $\ell$, then there exists an optimal POVM on $\rho_{0:\ell}$ (in the eigenbasis of $\rho_{0:\ell}$) that exactly determines the HMCQS’s internal state. Note that this is not guaranteed to be a repeated POVM or even consist of local POVMs. The information within that measurement that is useful for synchronization is quantified by ${\bf T}_{q}$. In contrast, if $S(\ell)$ does not converge for finite-$\ell$, then no such POVM over any finite block of qudits exists, and an observer can (at best) only converge asymptotically to the source’s internal state. We will see in Section V that even this is not possible for most sources when we restrict ourselves to local measurements.

III.10 Quantum Markov Order

The quantum Markov order corresponds to the number of previous qudits on which the next qudit is conditionally dependent. A process has quantum Markov order $R_{q}$ if $R_{q}$ is the smallest value for which the following property holds:

[TABLE]

A graphical interpretation is that when the block size reaches $R_{q}$, $S(\ell)$ levels off and has a constant slope—which is $s$, as seen in Fig. 2. As a consequence $R_{q}$ is the value of $\ell$ for which $\Delta S(\ell)$ and $\Delta^{2}S(\ell)$ converge to their asymptotic values, as seen in Figs. 3 and 4 respectively.

Note that a classical process is referred to as ‘Markov’ if $R=1$. If a separable qudit process has an underlying classical process that is Markov, then it obeys the property in Eq. (9) but does not generally have $R_{q}=1$.

Consider a separable quantum process $\ket{\Psi_{-\infty:\infty}}=\mathcal{E}(\smash{\overleftrightarrow{{X}}})$ where $\smash{\overleftrightarrow{{X}}}$ has Markov order $R^{X}$ and $\ket{\Psi_{-\infty:\infty}}$ has quantum Markov order $R_{q}$. $R_{q}$ can be equal to, less than, or greater than $R^{X}$. We will give a simple example of each case:

• •

$R_{q}=R^{X}$ trivially if $\mathcal{Q}$ consists of orthogonal states, in which case they have identical block entropy curves, via Prop. 3.

• •

$R_{q}<R^{X}$ if $R^{X}>0$ and all symbols in $\mathcal{X}$ are mapped to the same pure state $\ket{\psi_{{x}}}$. In this case $R_{q}=0$, as the resulting process is i.i.d.

• •

$R_{q}>R^{X}$ when $R^{X}>0$, $|\mathcal{X}|=|\mathcal{Q}|$ and $\mathcal{Q}$ consists of nonorthogonal states. Frequently, $R_{q}=\infty$ since arbitrary sequences of nonorthogonal states cannot reliably be distinguished with a finite POVM.

Similar rules apply when comparing $R_{q}$ to the Markov order $R^{Y}$ of measured process $\overleftrightarrow{Y}=\mathcal{M}(\ket{\Psi_{-\infty:\infty}})$:

• •

$R_{q}=R^{Y}$ if $\ket{\Psi_{-\infty:\infty}}$ is a separable process with an orthogonal alphabet $\mathcal{Q}$, and $\mathcal{M}$ uses a POVM whose operators include a projector for each element in $\mathcal{Q}$, via Prop. 4.

• •

$R_{q}<R_{Y}$ if $\mathcal{Q}$ consists of orthogonal states, $R_{q}=1$ and $\mathcal{M}$ is a repeated rank-one POVM that does not include projectors onto the states in $\mathcal{Q}$.

• •

$R_{q}>R_{Y}$ if $R_{q}>0$ and $\mathcal{M}$ is a repeated POVM measurement with the one-element POVM, $\mathbb{I}$. Note that this is not a rank-one POVM.

Now, with a toolbox of quantum information properties in hand, the following section calculates (or estimates) their values for paradigmatic examples of qudit processes.

IV Qudit Processes

We now present a variety of separable qudit processes, organized roughly by increasing structural complexity and demonstrate the extent to which their behavior can be quantified with Section III’s informational measures. Their properties are summarized in Table 1 near the end when we have their informational measures in hand.

IV.1 I.I.D. Processes

Recall that an i.i.d. (independent and identically-distributed) qudit process has no classical or quantum correlation between any of the qudits, and its length-$\ell$ density matrices are in a product state such that:

[TABLE]

where $\rho_{iid}\in\mathcal{H}$ is the density matrix for a single timestep.

The quantum block entropy takes the form $S(\ell)=\ell S(\rho_{iid})$, thus the von Neumann entropy rate is $s=S(\rho_{iid})$. This implies that a repeated projective measurement exists for which the measured process $\overleftrightarrow{Y}$ has a classical entropy rate of $h_{\mu}=S(\rho_{iid})$. The measurement that realizes this bound consists of orthogonal projectors $P_{y}$, each of which is constructed from an eigenvector of $\rho_{iid}$. In the special case where $\rho_{iid}$ is the maximally-mixed state, $s=\log_{2}(d)$ and any set of orthogonal projectors on a block $\rho_{0:\ell}$ gives a uniform distribution over all measurement outcomes $y_{0:\ell}$. Since there are no correlations between qudits ${\bf E}_{q}=0$, ${\bf T}_{q}=0$, and $R_{q}=0$ trivially. The output of a single-qudit source with uncorrelated noise can be considered an i.i.d. qudit process.

IV.2 Quantum Presentations of Classical Processes

Any classical process with alphabet $\mathcal{X}$ can be represented by a qudit process with orthogonal alphabet $\mathcal{Q}$ where each symbol $x\in\mathcal{X}$ corresponds to a pure state $\ket{\psi_{{x}}}\in\mathcal{Q}$. In this case the encoding $\mathcal{E}$ is trivial and one can recover the underlying process $\smash{\overleftrightarrow{{X}}}$ via repeated measurement with orthogonal projectors $\{P_{x}=\ket{\psi_{{x}}}\bra{\psi_{{x}}}\}$. This requires that $d\geq|\mathcal{X}|$.

The information measures for the underlying process, the qudit process, and measurement outcomes obey:

[TABLE]

with equality for repeated measurement with a rank-one POVM whose elements include the projector set $\{P_{x}\}$.

From this relation we can see that many quantum information quantities such as $s$, ${\bf E}_{q}$, ${\bf T}_{q}$, and $R_{q}$ are equal to the classical properties of $\smash{\overleftrightarrow{{X}}}$. Exceptions include quantities that depend on the relationship between $d$ and $|\mathcal{X}|$, such as the quantum redundancy.

Since the quantum-classical channel $\mathcal{E}$ is trivial, the output process $\overleftrightarrow{Y}$ is the result of passing $\smash{\overleftrightarrow{{X}}}$ through a noisy classical channel, where the level of noise depends on the particular measurement scheme $\mathcal{M}$.

For a repeated rank-one POVM $\operatorname{H}\left[X_{0:\ell}\right]\leq\operatorname{H}\left[Y_{0:\ell}\right]$ for all $\ell$ from Props. (3) and (4) . Similar inequalities explicitly relate other classical process properties such as the entropy rates ($h_{\mu}^{X}\leq h_{\mu}^{Y}$), the predictabilities ($|\textbf{G}^{X}|\geq|\textbf{G}^{Y}|$), and the excess entropies (see Cor. 3).

IV.3 Periodic Processes

A classical stochastic process $\smash{\overleftrightarrow{{X}}}$ is periodic with period $p$ if it consists of repetitions of a template sequence—a length-$p$ block of symbols. A periodic separable qudit process $\ket{\Psi_{-\infty:\infty}}=\mathcal{E}(\smash{\overleftrightarrow{{X}}})$ is one for which the underlying classical process $\smash{\overleftrightarrow{{X}}}$ is periodic.

For classical periodic processes the block entropy curve reaches a maximal value at its Markov order $R=p$ and thereafter remains constant with increasing $\ell$ ($h_{\mu}=0$). That maximal value is the excess entropy, which is entirely determined by the period according to the formula ${\bf E}=\log_{2}(p)$. Finally, an observer attempting to synchronize to different length-$p$ templates may encounter more or less uncertainty in the process depending on the template itself, a feature captured by the transient information ${\bf T}$ [11].

Periodic qudit processes share many of these properties (as we show via Section III’s results), but also exhibit richer behavior since they can consist of nonorthogonal qudit states. Fig. 5 shows the quantum block entropies for the period-$3$ process consisting of the repeated quantum word $\ket{\psi_{00\phi}}=\ket{0}\otimes\ket{0}\otimes\ket{\psi(\phi)}$ where $\ket{\psi(\phi)}=\cos{\frac{\phi}{2}}\ket{0}+\sin{\frac{\phi}{2}}\ket{1}$. For $\phi$ = $\pi$ we recover the block entropy for the classical period-$3$ word ‘$001$’. As $\phi$ decreases $\ket{\psi(\phi)}$ becomes less distinguishable from $\ket{0}$.

From Props. 6 and 13 it follows that periodic qudit processes with period $p$ have $s=0$ and ${\bf E}_{q}\leq\log_{2}(p)$. (And, ${\bf E}_{q}=\log_{2}(p)$ unless two classical symbols in $\mathcal{X}$ are sent to the same pure state in $\mathcal{Q}$ in a way that reduces the effective period of the qudit process to less than $p$.) However, the quantum block entropy curve does not necessarily reach its maximal value of ${\bf E}_{q}$ for $\ell=p$ if $\mathcal{Q}$ contains nonorthogonal states. In this case, $R_{q}\to\infty$ since an observer cannot unambiguously distinguish where one length-$p$ block begins and another one ends with any finite measurement.

Though all period-$p$ qudit processes have the same von Neumann entropy rate and quantum excess entropy, they may be distinguished by their values for the quantum transient information in two different ways.

First, different quantum alphabets $\mathcal{Q}$ give different values of ${\bf T}_{q}$. Fig. 5 demonstrates that, for a 2-state qubit alphabet, as the states become more less distinguishable, the quantum transient information increases. For $\phi=\pi$ (orthogonal alphabet), ${\bf T}_{q}\approx 2.33$ bits$\times$time steps, whereas for $\phi=\frac{\pi}{2}$, ${\bf T}_{q}\approx 4.22$ bits$\times$time steps. These values of ${\bf T}_{q}$ (and others in this section) are numerically approximated using Eq. (47) with $\ell=12$.

Second, ${\bf T}_{q}$ can distinguish between different length-$p$ words. Reference [11] shows that ${\bf T}$ can distinguish between different period-5 classical words (‘$00001$’, ‘$00011$’, and ‘$00101$’), and ${\bf T}_{q}$ generalizes this behavior. Whereas all period-3 words are equivalent to ‘$001$’ under global bit swap and translations, the same is not true for period-$5$ words. Section V discusses synchronizing to period-5 qudit sources in more detail and relates that task to the value of ${\bf T}_{q}$.

IV.4 Quantum Golden Mean Processes

The classical Golden Mean process consists of all binary strings with no consecutive ‘$1$’s. It is a Markov process ($R=1$) since the joint probabilities $\Pr({X}_{0:\ell})$ for blocks factor as in Eq. (2) with $\Pr(0|0)=\frac{1}{2}$, $\Pr(1|0)=\frac{1}{2}$, $\Pr(0|1)=1$, and $\Pr(1|1)=0$. For the classical Golden Mean $h_{\mu}=\frac{2}{3}$ bits per symbol and ${\bf E}\approx 0.2516$ bits.

Replacing the classical symbol alphabet with the quantum alphabet $\mathcal{Q}=\{\ket{0},\ket{+}\}$, where $\ket{+}=\frac{1}{\sqrt{2}}\left(\ket{0}+\ket{1}\right)$, gives the $\ket{0}$-$\ket{+}$ Quantum Golden Mean Process, introduced in Ref. [14]. Figure 6 shows its generator.

We can further generalize this process to the $\ket{0}$-$\ket{\psi(\phi)}$ Quantum Golden Mean process with quantum alphabet $\{\ket{0},\ket{\psi(\phi)}=\cos{\frac{\phi}{2}}\ket{0}+\sin{\frac{\phi}{2}}\ket{1}\}$. This process’ quantum entropy rate is shown in Fig. 7 for different values of $\phi$. For $\phi=\pi$, $\ket{\psi(\phi)}=\ket{1}$ and we recover the classical Golden Mean process. As $\phi$ decreases to [math], the states in $\mathcal{Q}$ become less distinguishable and $s$ decreases, as expected from Prop. 6.

Also in Fig. 7 we see the entropy rate $h_{\mu}^{Y}$ of the measured processes obtained by applying a repeated PVM to the $\ket{0}$-$\ket{\psi(\phi)}$ Quantum Golden Mean process. This PVM consists of projectors parametrized by the angle $\theta$, where $M_{\theta}=\{\ket{\psi(\theta)}\bra{\psi(\theta)},\ket{\psi(\theta+\pi)}\bra{\psi(\theta+\pi)}\}$. As mandated by Prop. 7, $h_{\mu}^{Y}\geq s$ for all $\phi$ and $\theta$.

Figure 8 demonstrates how another of Section III’s quantum information properties, the quantum excess entropy ${\bf E}_{q}$, relates to the excess entropy ${\bf E}^{Y}$ of the classical measured process. For all $\phi$ and $\theta$ the bound from Prop. 14 (${\bf E}_{q}\geq{\bf E}^{Y}$) holds, and ${\bf E}^{Y}$ has maxima at $\phi=\pi$, and $\theta=0,\pi$, when $\mathcal{Q}=\{\ket{0},\ket{1}\}$ and $M=M_{01}$. These quantities were estimated using $\ell=10$.

Underlying the $\ket{0}$-$\ket{\psi(\phi)}$ Quantum Golden Mean is the classical Golden Mean process, which is Markov. Thus, it obeys the quantum Markov property of Eq. (9) despite the fact that it has infinite quantum Markov order for most values of $\phi$. This has implications for an observer’s ability to synchronize to a Quantum Golden Mean source, which Section V explores.

IV.5 $3$-Symbol Quantum Golden Mean

Figure 9 shows the generator of the 3-Symbol Quantum Golden Mean Process with alphabet $\mathcal{Q}=\{\ket{0},\ket{1},\ket{+}\}$. Though its generator shares the same internal states and transition probabilities as the $\ket{0}$-$\ket{+}$ Quantum Golden Mean, the 3-Symbol Quantum Golden Mean does not have a one-to-one correspondence between the quantum alphabet $\mathcal{Q}$ and the generator states $\mathcal{S}$ ($\ket{0}\to A$ and $\ket{+}\to B$). Instead $|\mathcal{Q}|=3$, and these three states cannot all be orthogonal with $d=2$.

However, unlike the $\ket{0}$-$\ket{+}$ Quantum Golden Mean, we can calculate the quantum entropy rate directly from the generator because (1) it has the property of quantum unifilarity and (2) it is possible to synchronize to it. Both are discussed at length in Section V. For now, a HMCQS is quantum unifilar if and only if, for every $\sigma\in\mathcal{S}$ there exists some POVM $M_{\sigma}$ such that an observer knowing $\sigma$ and the outcome of $M_{\sigma}$ can uniquely determine the internal state to which the HMCQS transitioned. The generator in Fig. 9 meets this criterion with $M_{A}=M_{01}$. $M_{B}$ can be any POVM.

For a classical, unifilar HMC, $h_{\mu}$ can be calculated as:

[TABLE]

where $\pi$ is the stationary state distribution. This result dates back to the foundations of information theory [7].

Similarly, for a quantum unifilar HMCQS to which one can synchronize, we can write:

[TABLE]

Let’s walk through this logic for the 3-Symbol Quantum Golden Mean. In state $A$ ($\pi_{A}=\frac{2}{3}$), the generator emits a qubit either in state $\ket{0}$ or $\ket{1}$, each with probability $\frac{1}{2}$. The density matrix describing this qubit is a maximally-mixed state, and any measurement performed on it involves $1$ bit of irreducible randomness. If it is in state $B$ ($\pi_{B}=\frac{1}{3}$), it emits a qubit in state $\ket{+}$ deterministically. Thus, averaging over the states, the von Neumann entropy rate is $s=\frac{2}{3}$ bits/timestep.

Despite this, when restricted to measuring with a repeated rank-one POVM, the entropy rate of the observed classical process cannot reach the lower bound of $\frac{2}{3}$ bits per symbol because the minimum entropy basis when in state $A$ is $M_{01}$ while the minimum entropy basis when in state $B$ is $M_{\pm}$. However, an experimenter using the adaptive measurement protocol in Fig. 10 would observe symbol sequences with an entropy rate of $\frac{2}{3}$ bits per symbol once they have synchronized.

They start by measuring in the $M_{01}=\{\ket{0},\ket{1}\}$ basis and use the outcome of the initial measurement to select a new basis. If the outcome is ‘[math]’, they are able to synchronize to the process generator which is necessarily in state $A$. They continue in state $A$ measuring with POVM $M_{01}$ until they observe a ‘$1$’ at which point they transition to $B$ and measure with $M_{\pm}$, a zero-entropy measurement. They observe a ‘$+$’ and return to state $A$.

In this way, when using an adaptive measurement protocol the recurrent part $\overleftrightarrow{Y}_{r}$ of the measurement sequence may have a lower entropy rate than $h_{\mu}^{Y}$ for any repeated rank-one POVM measurement, even if the associated DQMP uses only rank-one PVMs, as in this example. These ideas are formalized and expanded upon in the next section.

IV.6 Unifilar and Nonunifilar Qubit Sources

The last two classes of qubit processes to discuss are generated by the unifilar and nonunifilar qubit sources shown in Figs. 11 and 12, respectively. Both of these generators consist of two internal states ($\mathcal{S}=\{A,B\}$) and emit four possible pure-qubit states ($\mathcal{Q}=\{\ket{0},\ket{1},\ket{+},\ket{-}\}$) that form two orthogonal pairs. However, for each internal state of the unifilar qubit source, the two possible emitted states are orthogonal and one can unambiguously determine the next internal state. In other words, it has the property of quantum unifilarity. The same is not true of nonunifilar qubit source. The next section illustrates how this difference strongly affects an observer’s ability to synchronize.

By varying the parameter $p$, one can interpolate between one of the several simpler processes already analyzed. Starting with the unifilar qubit source in Fig. 11, for $p=0$, the generator becomes a period-$2$ source that emits the word $\ket{\psi_{0+}}$. For $p=\frac{1}{2}$ we obtain a two-state model that generates the i.i.d. maximally-mixed process. And, as $p\to 1$ the generator emits longer strings of either only $\ket{1}$ or only $\ket{-}$ qubits, depending on whether the source is in $A$ or $B$. At $p=1$ the process becomes nonergodic (here demonstrated by the disconnection between internal states), and the source will only emit either $\ket{1}$ or $\ket{-}$ deterministically.

Similarly, the nonunifilar qubit source in Fig. 12 simplifies for certain $p$’s. For $p=0$ we obtain a period-$2$ source, this time with sequence $\ket{\psi_{01}}$, and for $p=\frac{1}{2}$ it also generates the i.i.d. maximally-mixed process. As $p\to 1$ it emits long sequences of either all $\ket{+}$ or all $\ket{-}$ and becomes nonergodic for $p=1$.

IV.7 Unifilar Qutrit Source

Expanding beyond processes over qubits, we consider a single example of a qutrit ($d=3$) process whose generator is shown in Fig. 13 and that employs a five-qubit alphabet $\mathcal{Q}=\{\ket{0},\ket{1},\ket{2},\ket{+},\ket{-}\}$. Using a higher-dimensional Hilbert space makes more measurements available to an observer for synchronization. As a consequence this example process exhibits behavior that is impossible with qubit processes alone: a subspace of Hilbert space (occupied by $\ket{2}$) is always distinguishable from all other states in $\mathcal{Q}$ and can be reserved for synchronization. The other subspace (including $\ket{0}$, $\ket{1}$, $\ket{+}$ and $\ket{-}$) consists of states that cannot be reliably distinguished. Note that this process is quantum unifilar, but one cannot remain synchronized by measuring in a single basis. The next section discusses multiple adaptive measurement protocols that can do so.

IV.8 Discussion

Table 1 summarizes information properties for the above examples with either analytic results or numerical estimates. Together these examples illustrate a range of different features of separable qudit processes. They demonstrate how the information properties defined and characterized in Section III are both indicative of underlying structural features of quantum information sources and strongly influenced by the distinguishability of states in a process’ quantum alphabet. Our analysis of the convergence of the quantum block entropy to its linear asymptote thus gives meaningful and interpretable ways of quantifying the randomness and correlation in a separable quantum process.

We continue by discussing two tasks that an observer might wish to perform when faced with a quantum information source emitting a separable quantum process. First, if they have prior knowledge of the internal structure of the source, they may want to determine the internal state it occupies during a given timestep. This task is synchronization, and we discuss it in the next section. Second, if they have no knowledge of the source, they may want to measure the process it produces to infer its internal structure. This task is system identification, and we demonstrate how an observer can use a tomographic protocol to perform it in Section VI.

V Synchronizing to a Quantum Source

How does an observer of a process with knowledge of its quantum generator determine its internal state? When an observer is certain about the internal state the observer is synchronized to the quantum source. The following explores synchronizing to quantum processes—both the manner in which observations lead to inferring the source’s state and quantitative measures of partial and full synchronization.

Quantum measurement adds a subtlety to this task in comparison to the task of synchronizing to a classical process given knowledge of its minimal unifilar model—the $\epsilon$-machine—as described in Refs. [12, 47].

V.1 States of Knowledge

Recall that a hidden Markov chain quantum source (HMCQS) consists of a set of internal states ($\mathcal{S}$), a pure-state alphabet ($\mathcal{Q}$), and a set of labeled transition matrices ($\mathcal{T}$). We assume an observer has complete knowledge of the HMCQS that generates a process but can only infer the internal state at time $t=\ell$ by applying block measurement $\mathcal{M}_{0:\ell}$ and observing outcome $y_{0:\ell}$. They have no access to the qudits that were emitted before $t=0$.

An observer’s best guess for the internal state of a source given different sequences of observations can be represented as distributions over the source’s internal states, known as mixed states (not to be confused with mixed quantum states, represented by density matrices). Classically, after observing a particular length-$\ell$ word $w={x}_{0:\ell}$, the observer is in the mixed state $\eta(w)=\left(p_{A},p_{B},\ldots\right)$. After the next observation ${X}_{\ell}$, they will transition to one of a set of new mixed states depending on the outcome $\eta(w,{x}_{\ell}=\text{0})$, $\eta(w,{x}_{\ell}=\text{1})$, and so on. The word corresponding to the new mixed state is a concatenation of $w$ and the new observation ${x}_{\ell}$. The set of mixed states for a classical process and the dynamic between them define a process’ mixed state presentation (MSP), which is unifilar by construction [48].

Using a classical process’ MSP rather than a nonunifilar generator of the process has many computational advantages. Two of interest are: it allows one to calculate the entropy rate for processes without finite unifilar presentations [49] and it allows one to calculate the uncertainty an observer experiences while attempting to synchronize to a process’ generator [50].

For quantum processes there is no unique MSP but rather a multiplicity of possible MSPs, each corresponding to a different choice of measurement protocol. For a given source and given measurement protocol $\mathcal{M}$ we can define a set of mixed states with each corresponding to the possible measurement sequence one can observe.

Consider the mixed states corresponding to length-$\ell$ sequences of observations. We restrict $\mathcal{M}_{0:\ell}$ to consist of local POVMs, allowing for adaptive measurement. Given that an observer has applied measurement $\mathcal{M}_{0:\ell}$ and seen measurement outcomes $y_{0:\ell}$, their best guess about the generator’s internal state is represented by the conditional distribution $\eta(y_{0:\ell}|\mathcal{M}_{0:\ell})=\{\Pr(\sigma|y_{0:\ell},\mathcal{M}_{0:\ell})\;\text{for~{}all}\;\sigma\}$.

For $t=0$, an observer has no measurement outcomes with which to inform their prediction about the source’s internal state. However, they do know the stationary state distribution $\pi$ of the model (since it can be calculated directly from $\mathcal{T}$). This serves as a ‘best guess’ of the source’s internal state absent any measurements. If the initial state distribution $\mathcal{S}_{0}$ is not $\pi$ and the observer is aware of this fact, the mixed states for that process are $\eta(y_{0:\ell}|\mathcal{M},\mathcal{S}_{0})$. We omit the conditioning on $\mathcal{S}_{0}$ if $\mathcal{S}_{0}=\pi$.

For most repeated PVM measurements of qubit processes there are an uncountably-infinite number of mixed-states [14]. This measurement-induced complexity appears even for $|\mathcal{S}|=2$. The examples in this section step back from this complexity to focus on measurements that are sufficiently informative to allow an observer to synchronize with finite observation sequence $y_{0:\ell}$ and result in only finite or (at most) a countably-infinite set of recurrent mixed states.

V.2 Average State Uncertainty and Synchronization Information

To compare synchronization behavior for different measurement protocols it is useful to use entropic quantities rather than working with the set of mixed states and their dynamic directly. In particular, we look at the entropy of the possible mixed states for length-$\ell$ sequences of measurements.

An observer’s uncertainty about the source’s internal state after applying measurement sequence $\mathcal{M}_{0:\ell}$ (according to some protocol $\mathcal{M}$) and observing outcome $y_{0:\ell}$ is given by the Shannon entropy of the corresponding mixed-state distribution:

[TABLE]

One can average over all measurement outcomes on a block of $\ell$ qudits to find the average state uncertainty:

[TABLE]

For a given measurement protocol $\mathcal{M}$, this quantity generally converges to a finite value in the $\ell\to\infty$ limit. This limit does not necessarily exist if is not ergodic; for example, if there is some underlying periodicity. If such a limit exists, the asymptotic state uncertainty is:

[TABLE]

Both $\mathcal{H}(\ell|\mathcal{M})$ and $C_{\infty}(\mathcal{M})$ are measured in bits.

If $\operatorname{H}\left[\eta(y_{0:\ell}|\mathcal{M})\right]=0$, then $y_{0:\ell}$ is a synchronizing observation, and an observer who sees outcome $y_{0:\ell}$ can precisely identify the source’s internal state. If $\mathcal{H}(\ell|\mathcal{M})=0$, then any measurement outcome seen when applying protocol $\mathcal{M}$ to $\ell$ qudits allows the observer to synchronize to the source. For classical and quantum processes, the Markov order is the first value of $\ell$ for which $\mathcal{H}(\ell)$ vanishes (for some $\mathcal{M}_{0:\ell}$ in the quantum case). This generally does not occur for HMCQS with nonorthogonal states in $\mathcal{Q}$ except in the $\ell\to\infty$ limit since $R_{q}$ is generally infinite.

Being synchronized after measuring $\ell$ qudits does not guarantee the observer remains synchronized after measuring qudit $\ell+1$. In classical processes for which this occurs, persistent synchronization requires that the HMC of the process that the observer uses satisfies the additional condition of unifilarity. In the quantum setting, synchronization persists if and only if the underlying HMCQS is quantum unifilar and, when the observer is in internal state $\sigma$, their measurement protocol ensures they apply the measurement for which the internal state at time $t+1$ is completely determined.

This is equivalent to the statement ‘There exists some protocol $\mathcal{M}$ with measurements $\mathcal{M}_{0:\ell}$ and $M_{\ell}$ such that:

[TABLE]

for all $y_{\ell}\in\mathcal{Y}$.’

The measurement that maintains synchronization when the source is in one internal state ($\sigma_{i}$) does not need to be the same as the measurement that maintains synchronization when the source is in another internal state ($\sigma_{j}$). When the measurement required to maintain synchronization depends upon the HMCQS’s current state, then adaptive measurement protocols are capable of maintaining synchronization even when no fixed-basis measurement can, as the following demonstrates with multiple examples.

Finally, the total amount of state uncertainty that an observer encounters while synchronizing to a process using a given measurement protocol $\mathcal{M}$ is the synchronization information, given by:

[TABLE]

Note that, if the asymptotic state uncertainty $C_{\infty}(\mathcal{M})$ is greater than 0, $\mathbf{S}(\mathcal{M})$ is infinite. When $C_{\infty}(\mathcal{M})=0$, we can estimate $\mathbf{S}(\mathcal{M})$ by terminating the sum at some finite $\ell$.

For classical processes the synchronization information is closely tied to the transient information ${\bf T}$. We will similarly connect $\mathbf{S}(\mathcal{M})$ to the quantum transient information ${\bf T}_{q}$ and use it as a way to compare synchronization via different measurement protocols.

The remainder of this section explores synchronization to various models from Section IV. We pair each with a variety of measurements, both repeated POVMs and adaptive protocols, to demonstrate the way $\mathcal{H}(\ell|\mathcal{M})$ is affected by this choice.

V.3 Synchronizing to Quantum Presentations of Classical Processes

A HMCQS with a qudit alphabet consisting entirely of orthogonal states ($\braket{\psi_{x}}{\psi_{x^{\prime}}}=0$, for all $\ket{\psi_{{x}}}$ and $\ket{\psi_{x^{\prime}}}\in\mathcal{Q}$), is a quantum presentation of the underlying classical process $\smash{\overleftrightarrow{{X}}}$. An observer can perform a measurement using orthogonal projectors $P_{x}=\ket{\psi_{{x}}}\bra{\psi_{{x}}}$ for all $\ket{\psi_{{x}}}\in\mathcal{Q}$ that unambiguously discriminates between the pure qudit states the source emits.

The task of synchronizing to such an HMCQS is equivalent to synchronizing to a source emitting classical symbols. If it is quantum unifilar, then the underlying classical HMC is unifilar and synchronization is exponentially fast (on average) [12, 47]. Absent unifilarity, an observer may not be able to synchronize even asymptotically—i.e., $C_{\infty}(\mathcal{M})>0$ for all $\mathcal{M}$—despite measuring with orthogonal projectors.

V.4 Synchronizing to Periodic Processes

All periodic quantum processes have vanishing von Neumann entropy rate—i.e., $s=0$—and each state only has one incoming and one outgoing transition. Due to these simplifications, to synchronize an observer simply determines the source’s phase; i.e., which of the $p$ internal states the source occupies at time $t$. Once this phase is determined for any $t$, it is also determined for all other $t$. The initial phase uncertainty is equivalent to the initial state uncertainty $\operatorname{H}\left[\pi\right]=\log_{2}(p)$ since $\pi$ is uniform.

Any measurement protocol $\mathcal{M}$ that distinguishes between states in $\mathcal{Q}$ gives information about the phase and allows an observer to synchronize to the source asymptotically. If two states in $\mathcal{Q}$ cannot be distinguished by $\mathcal{M}$, then synchronization may not be possible, even with an infinite number of measurements.

For classical periodic processes, an observer synchronizes at the Markov order $\ell=p$, and the synchronization information and the transient information are equal: $\mathbf{S}={\bf T}$ [11]. In contrast, quantum periodic processes generically have infinite Markov order, if there are nonorthogonal states in $\mathcal{Q}$, and only asymptotically synchronize. Thus, $\mathbf{S}(\mathcal{M})\geq{\bf T}_{q}$. The condition for equality is that $\mathcal{M}$ is the optimal measurement over the process. For $R_{q}=\infty$ this means that $\mathcal{M}$ must be a global measurement over the bi-infinite chain of qudits.

Figure 14 shows the average state uncertainty for an observer measuring three different period-$5$ qubit processes consisting of two alphabet states: $\ket{0}$ and $\ket{\psi(\phi=3\pi/4)}$. All other period-$5$ sequences with this qubit alphabet are equivalent to these three under shift and swap symmetries. As expected, $\mathcal{H}(\ell)$ decreases from $\mathcal{H}(0)=\log_{2}5$ to $C_{\infty}=0$ for all combinations of sequence and measurement basis. That noted, the rate at which synchronization occurs—and the total amount of uncertainty seen by an observer, the synchronization information—depends on both the particular sequence and the particular repeated measurement applied to it.

For period-5 process with word ‘$0000\psi$’, ${\bf T}_{q}\approx 6.32$ bits$\times$time steps, using Eq. (47) with $\ell=12$. When measuring it in basis $M_{01}$ ($M_{\phi}$) we find that $\mathbf{S}(M_{01})\approx 7.92$ bits ($\mathbf{S}(M_{\phi})\approx 9.30$ bits). These are also estimated by calculating up to $\ell=12$. Similarly, the bound between $\mathbf{S}(\mathcal{M})$ and ${\bf T}_{q}$ holds for the other period-5 words. For word ‘$000\psi\psi$’, ${\bf T}_{q}\approx 4.86$ bits$\times$time steps, $\mathbf{S}(M_{01})\approx 6.84$ bits, and $\mathbf{S}(M_{\phi})\approx 7.05$ bits. For word ‘$00\psi 0\psi$’, ${\bf T}_{q}\approx 5.51$ bits$\times$time steps, $\mathbf{S}(M_{01})\approx 7.39$ bits, and $\mathbf{S}(M_{\phi})\approx 7.47$ bits.

At this point we wish to emphasize that $s$, ${\bf E}_{q}$, and $R_{q}$ are equal for generic period-5 processes with nonorthogonal alphabets $\mathcal{Q}$. Despite this, ${\bf T}_{q}$ and $\mathbf{S}(\mathcal{M})$ identify physically-relevant differences between these processes for the task of synchronization. These differences are intrinsic to the quantum process itself (${\bf T}_{q}$) and also appear within the measurement outcomes an observer obtains ($\mathbf{S}(\mathcal{M})$).

As a final comment on periodic processes, we note that while $s=0$ for all periodic quantum process, many measurement protocols (even those for which $C_{\infty}=0$) give a measured classical process with a nonzero entropy rate $h_{\mu}^{Y}$. In fact, no fixed-basis measurement of a periodic process results in an observed process with $h_{\mu}^{Y}=0$ unless (i) all states in $\mathcal{Q}$ are orthogonal and (ii) the measurement is in an orthogonal basis which includes one projector for each state in $\mathcal{Q}$.

In contrast, an observer using an adaptive measurement protocol can easily have zero uncertainty in measurement outcomes once synchronized. For example, Fig. 15 shows the recurrent states for a DQMP that swaps between two different measurements—$M_{01}$ and $M_{\phi}$—depending on the internal state of the source. The sequence of measurement outcomes observed is deterministic, and the recurrent measured process is a period-$5$ process with word ‘$00\phi 0\phi$’ and $h_{\mu}^{Y_{r}}=0$.

V.5 Synchronizing with PVMs

The $\ket{0}$-$\ket{+}$ Quantum Golden Mean Process has multiple synchronizing observations; see the generator in Fig. 6. Measuring with $M_{01}$ and seeing a ‘$1$’ synchronizes the observer to internal state $B$; measuring with $M_{\pm}$ and seeing a ‘$-$’ synchronizes the observer to internal state $A$. Let’s consider the mixed states produced by these two repeated PVMs in turn, starting with $M_{01}$.

Figure 16 shows the mixed states for the measured process obtained by repeatedly applying $M_{01}$. Observing synchronizing measurement $y=\text{`1'}$ means that the source just transitioned to state $B$ while emitting a $\ket{+}$ qubit; i.e., $\operatorname{H}\left[\eta(\text{`1'})\right]=0$. Additionally, the source in state $B$ can only transition to state $A$ while emitting a $\ket{0}$ qubit, so the observer will see a ‘[math]’, and $\operatorname{H}\left[\eta(\text{`10'})\right]=0$. However, once the source is in state $A$ an observer easily desynchronizes from the source if they observe another ‘[math]’, as this is consistent with either of the two transitions to the source. As an observer sees more ‘[math]’s they transition to mixed states further to the right of Fig. 16. To summarize, measuring with $M_{01}$ makes use of synchronizing observations ‘$1$’ and ‘$10$’, but its MSP has a countably-infinite number of recurrent states corresponding to sequences of $n$ ‘[math]’s.

This measured process is an infinite-state classical renewal process, whose information properties can be estimated using methods from Ref. [51]. After seeing $n$ ‘[math]’s in a row, the next observation will be ‘$1$’ with probability:

[TABLE]

We find $h_{\mu}^{Y}\approx 0.60$ bits per symbol, ${\bf E}^{Y}\approx 0.053$ bits, and a single-symbol entropy of $\operatorname{H}\left[1\right]\approx 0.65$ bits. ${\bf E}^{Y}$’s small value and the fact that $h_{\mu}^{Y}$ is not significantly lower than $\operatorname{H}\left[\ell=1\right]$ indicate that the infinite-state renewal process presentation provides only a small predictive advantage over using a biased coin with $\Pr(\text{`0'})=5/6$. This is further evidenced by how $\Pr(B|\text{`0'}^{n})=\tfrac{1}{4}\left(1-\left(-1/3\right)^{n-1}\right)$ converges exponentially quickly to the its asymptotic value of $\Pr(B|\text{`0'}^{n})=1/4$.

Measuring with $M_{\pm}$, symbol ‘$-$’ is a synchronizing observation and indicates the source is in state $A$. The recurrent mixed states for this observed process are shown in Fig. 17, and they also form a classical renewal process. Observing $n$ ‘$+$’s since the last ‘$-$’, the probability that the generator is in state $A$ is $\Pr(A|\text{`+'}^{n})=\frac{3}{5}\left(1-\left(-2/3\right)^{n+1}\right)$. The measured process obtained with $M_{\pm}$ has $h_{\mu}^{Y}\approx 0.90$ bits per symbol, ${\bf E}^{Y}\approx 0.020$ bits, and $\operatorname{H}\left[\ell=1\right]\approx 0.91$ bits. Again, the infinite-state MSP provides only a small predictive advantage over a biased coin with $\Pr(\text{`+'})=2/3$. Also, $\Pr(A|\text{`+'}^{n})$ converges exponentially quickly to $\Pr(A|\text{`+'}^{n})=3/5$.

Applying either of these two fixed-basis measurements gives an average state uncertainty that decreases monotonically with $\ell$, as shown in Fig. 18. Since this source is not quantum unifilar, an observer repeatedly synchronizes and desynchronizes while measuring this process regardless of basis, and $\mathcal{H}(\ell)$ does not approach [math] as $\ell\to\infty$. We find that $C_{\infty}(M_{01})\approx 0.62$ bits and $C_{\infty}(M_{\pm})\approx 0.54$ bits. Measuring with $M_{\pm}$ not only results in less state uncertainty asymptotically but also results in less average uncertainty for all values of $\ell$.

Figure 18 also displays the average state uncertainty for two other relevant PVMs: $M_{\theta}$ for $\theta=\pi/4$ and $\theta=3\pi/4$. Recall that $M_{\theta}$ is the PVM consisting of projectors onto orthogonal states $\ket{\psi(\theta)}$ and $\ket{\psi(\theta+\pi)}$. For comparison, $M_{01}$ corresponds to $\theta=0$ and $M_{\pm}$ corresponds to $\theta=\pi/2$.

For $\theta=\pi/4$, the symbol states $\ket{0}$ and $\ket{+}$ give the observer the exact same distribution of measurement outcomes, and the observer cannot gain any information about the state of the source beyond the stationary state distribution. This can also been seen as the maximum of the asymptotic state uncertainty in Fig. 19.

For $\theta=3\pi/4$—and for the majority of values of $\theta$—$M_{\theta}$ has no synchronizing observations. Despite this, Fig. 18 demonstrates that $\mathcal{H}(\ell|M_{\theta=3\pi/4})$ is lower for all $\ell$ than both bases that can exactly synchronize.

A measured process for generic $\theta$ does not have the renewal process structure of Figs. 16 and 17. Instead, in the absence of synchronizing observations, the number of mixed states generically grows exponentially with $\ell$. If we approximating the MSP using length-$\ell$ observations, then there will be $|\mathcal{Y}^{\ell}|$ mixed states—one for each possible sequence of measurements—each corresponding to a different distribution over the source’s internal states. These infinite-state MSPs can be characterized by their statistical complexity dimension [52].

Despite the explosive complexity, many of these PVMs give lower average state uncertainties than $M_{01}$ and $M_{\pm}$. $\theta=3\pi/4$ is a representative example. The asymptotic state uncertainty when applying $M_{\theta}$ is shown in Fig. 19. Note that the maximum value of $C_{\infty}(\mathcal{M}_{\theta})=\operatorname{H}\left[\pi\right]$ occurs when $\theta=\pi/4$, as discussed. The minimum asymptotic state uncertainty for this set of PVMs is $C_{\infty}\approx 0.49$ bits, which occurs for $\theta\approx 2.01$. An observer may choose to use a basis with an exponential set of mixed states to lower their uncertainty in the source’s internal state, at the cost of having to track the probability of a larger set of mixed states.

V.6 Maintaining Synchrony with Adaptive Measurement

Adaptive measurement protocols are also capable of maintaining synchronization when no fixed-basis measurement can. To appreciate this, consider Fig. 11’s unifilar qubit source.

For $0<p<1$ there are no synchronizing observations, however almost any measurement reduces the average state uncertainty below $\operatorname{H}\left[\pi\right]$. Additionally, if an observer comes to know the source’s state by other means (perhaps the source is initialized in state $A$ at time $t=0$), then they are able to maintain synchronization with a simple adaptive measurement protocol $\mathcal{M}_{adaptive}$.

This protocol, defined here only for recurrent states, is as follows. If the source is in state $A$, apply measurement $M_{01}$, and if the source is in state $B$, apply measurement $M_{\pm}$. It is only possible to define it this simply and maintain synchronization since the source is quantum unifilar.

Figure 20 shows the behavior of $\mathcal{H}(\ell)$ as the observer desynchronizes from the source initialized in state $A$. For each repeated PVM measurement, it eventually reaches an asymptotic value, though $\mathcal{H}(\ell)$ may be nonmonotonic.

V.7 Synchronizing to a Qutrit Source

A qubit source ($d=2$) presents limited opportunities for unambiguous state discrimination and, hence, for synchronization. Qutrits allow for more general behavior and have been suggested for applications in quantum communication networks where one state is reserved specifically for synchronization [53].

Let’s apply this logic to the unifilar qutrit source in Fig. 13. Synchronizing observation sequences for this process are ‘$2$’, ‘$1+$’, and ‘$1-$’ that definitively place the source in states $A$, $B$, and $C$, respectively. Once synchronized an observer may remain synchronized by measuring with $M_{012}=\{\ket{0}\bra{0},\ket{1}\bra{1},\ket{2}\bra{2}\}$ when in state $A$, $M_{\pm 2}=\{\ket{+}\bra{+},\ket{-}\bra{-},\ket{2}\bra{2}\}$ when in state $B$, and either of the above when in state $C$.

We explore synchronizing to this source with five different measurement protocols and compare them in Fig. 22. The first two are repeated PVMs in the $M_{012}$ basis and the $M_{\pm 2}$ basis. The other three are adaptive measurement protocols that share a recurrent dynamic, but have different transient states. Consider measuring in the $M_{012}$ ($M_{\pm 2}$) basis until observing a $2$ and therefore synchronizing to source state $A$. Then, use $M_{012}$ when the source is in state $A$ and $M_{\pm 2}$ when the source is in state $B$ or $C$. We refer to this protocol as $\mathcal{M}_{012,sync}$ ($\mathcal{M}_{\pm 2,sync}$). The fifth protocol $\mathcal{M}_{adaptive}$ is defined by the DQMP in Fig. 21 that uses an adaptive protocol over three transient mixed states in addition to the protocol just defined for the recurrent states.

The average state uncertainties for an observer implementing these five measurement protocols are shown in Fig. 22. The fixed basis measurements do not lead to persistent synchronization and have a nonzero asymptotic state uncertainty ($C_{\infty}(M_{012})\approx 0.40$ bits and $C_{\infty}(M_{\pm 2})\approx 0.72$ bits. If one measures in a fixed basis until synchronizing (by observing a 2) and then takes advantage of the quantum unifilarity of the source to stay synchronized, then the asymptotic state uncertainty vanishes. This is the case for $\mathcal{M}_{012,sync}$ and $\mathcal{M}_{\pm 2,sync}$, which have synchronization informations of $\mathbf{S}(\mathcal{M}_{012,sync})\approx 3.91$ bits and $\mathbf{S}(\mathcal{M}_{012,sync})\approx 3.60$ bits. The extra complexity of the measurement protocol $\mathcal{M}_{adaptive}$ admits additional synchronizing words (‘$1+$’ and ‘$1-$’) and a lower synchronization information ($\mathbf{S}(\mathcal{M}_{adaptive})\approx 3.00$ bits) than the simpler strategy of waiting to see a ‘$2$’. Note that these three synchronization informations are all greater than our estimate of the quantum transient information for this process (${\bf T}_{q}\approx 2.16$ bits $\times$ symbols) These values of $\mathbf{S}(\mathcal{M})$ were estimated using $\ell=10$.

V.8 Discussion

This section has detailed the process of synchronizing to a known qudit source. In contrast to sources of classical random variables, an observer may attempt to synchronize to a qudit source using a variety of measurement protocols. We can compare different protocols with two informational quantities introduced above: the asymptotic state uncertainty $C_{\infty}(\mathcal{M})$ and the synchronization information $\mathbf{S}(\mathcal{M})$.

For sources that are not quantum unifilar, no protocol can remain synchronized to the source. Nevertheless, for different measurement protocols $\mathcal{M}_{0}$ and $\mathcal{M}_{1}$ we can compare $C_{\infty}(\mathcal{M}_{0})$ and $C_{\infty}(\mathcal{M}_{1})$. The protocol with a lower value is better at the task of synchronization in the sense that an observer’s uncertainty in the source’s internal state will be lower on average.

This leads to a natural question: What is the best measurement protocol for synchronizing to a source? To answer it we introduce a new protocol-independent property of a qudit process, the minimal asymptotic state uncertainty:

[TABLE]

where the minimum is taken over all possible measurement protocols defined via DQMP. In practice, determining $C_{min}$ for a quantum process requires a proof that no measurement protocol can achieve a lower value. Fully exploring the space of measurement protocols is beyond the present scope. Nevertheless, we introduced candidates for $C_{min}$ in the above examples and found the minimal asymptotic state uncertainty for a restricted class of repeated PVMs numerically; recall Fig. 19.

For sources that are quantum unifilar, we explored several protocols that are capable of persistent synchronization. For such processes, $C_{min}=0$ bits. We can compare different synchronizing measurement protocols $\mathcal{M}_{0}$ and $\mathcal{M}_{1}$ through their synchronization informations $\mathbf{S}(\mathcal{M}_{0})$ and $\mathbf{S}(\mathcal{M}_{1})$. A lower value means that the observer experiences less state uncertainty while synchronizing. What is the minimal amount of state uncertainty an observer can experience? We define the minimal synchronization information for a quantum process as:

[TABLE]

This minimum is also taken over all DQMPs. Establishing that a given protocol is minimal is nontrivial.

One open question prompted by this work is ‘Is it always possible to synchronize to a source that is quantum unifilar?’ or equivalently ‘Does $C_{min}=0$ for all processes generated by quantum unifilar sources?’. Answering this question will also require a greater understanding of the space of DQMPs. Progress may involve proving the existence or nonexistence of a protocol that is able to synchronize to the unifilar qubit source in Fig. 11.

Finally, we recount several reasons why synchronization is an important task not only for determining a source’s internal state, but also for improving predictions of future measurement outcomes. Generally, HMCQSs have inherent stochasticity. Periodic sources are an exception. Through synchronization we may substantially reduce the uncertainty in measurement outcomes. In the extreme case where a source’s internal state has only one possible transition, this uncertainty vanishes, and we can measure the next qudit with a PVM which has a deterministic outcome.

For example, if we know a $\ket{0}$-$\ket{+}$ Quantum Golden Mean generator is in state $B$ the next qudit is $\ket{0}$, and we will always see ‘[math]’ if we apply the measurement $M_{01}$. Thus, we consider synchronization as a form of dynamical inference where an observer uses knowledge of both a source’s internal structure and a sequence of measurement outcomes to inform a more accurate prediction of future measurement outcomes. Each mixed state corresponds to a different prediction.

VI Quantum Process System Identification

Synchronization is a task that performed when an observer has an accurate model (here, a HMCQS) of the quantum information source. The next natural question is: How does an observer create an accurate model of an unknown quantum information source? This section begins to answer this question. It starts by briefly reviewing how one infers a classical information source from data. It then discusses how to identify the state of a single qudit with quantum state tomography. By combining these two ideas we arrive at an inference method for stationary qudit sequences.

VI.1 Classical System Identification

An observer of an unknown stationary classical process is limited to use only the available data—distributions of words over symbol alphabet $\mathcal{X}$—to infer the source’s structure. We denote the distribution of length-$\ell$ words $\mathcal{P}(\ell)=\{w={x}_{0}\cdots{x}_{\ell-1}|w\in\mathcal{X}^{\ell}\}$.

For $\ell=1$ we obtain a distribution over symbols in $\mathcal{X}$. With $\mathcal{P}(1)$ we can reconstruct a memoryless (i.i.d.) model of the source with one internal state and each $\Pr({x}\in\mathcal{X})$ obtained directly from $\mathcal{P}(1)$.

For $\ell=2$ we use $\mathcal{P}(2)$ to create conditional probability distributions for the next symbol conditioned on the previous one; i.e., $\Pr({x}_{1}|{x}_{0})$, for all ${x}_{0}$, ${x}_{1}\in\mathcal{X}$. From these conditional distributions we may construct a Markov approximation of the source with $|\mathcal{X}|$ states, one corresponding to each symbol. The conditional distributions set the transition matrices for Markov approximation of the source: i.e., $\Pr({x}_{1}|{x}_{0})=T_{{x}_{0},{x}_{1}}$.

Similarly, for $\ell>2$ we obtain a length-$\ell$ HMM approximation of the source by conditioning on length $\ell-1$ words, each of which corresponds to a different internal state. In this simplified picture, the number of internal states of the model grows exponentially with $\ell$, as the number of possible words of length $\ell$ is $|\mathcal{X}|^{\ell}$. This leads to numerical problems when inferring processes with correlations over long periods of time. That said, there are methods for both combining states that reflect identical predictions of future symbols and for performing inference over machine topologies with a certain number of states—known as Bayesian Structural Inference [54]—to determine the most likely $\epsilon$-machine for the source.

VI.2 Tomography of a Qudit

We cannot directly apply the procedure for inferring classical source dynamics from word distributions to qudit processes since observations depend on the measurement basis/protocol one uses. To fully characterize a stationary quantum source we must instead take many measurements in different bases to reconstruct the qudit density matrices. This task is known as quantum state tomography. We begin by inferring an individual qudit state $\rho_{0}$ before introducing a general method for quantum system identification using separable sequences of qudits.

Tomographic reconstruction of a single unknown qudit density matrix $\rho_{0}$ through measurement is challenging for two main reasons:

$\rho_{0}$’s complete description requires a number of parameters that scales exponentially with the state’s Hilbert space dimension. 2. 2.

Quantum measurement is probabilistic, so one must prepare and measure many copies of $\rho_{0}$ to estimate a single parameter.

Specific combinations of measurements are particularly useful for this task. For example $\rho_{0}$ can be inferred by measuring with a set of mutually-unbiased bases (MUB) [3] or a single informationally-complete POVM (IC-POVM) [4]. For a qubit, one possible MUB consists of the x-, y-, and z-bases. By measuring many copies of the qubit in each of these three bases one obtains three probabilities—$\Pr(+x)$, $\Pr(+y)$, and $\Pr(+z)$—that uniquely determine the density matrix $\rho_{0}$. We do not discuss the necessary number of measurements to determine these parameters to within a desired tolerance for general qudit tomography, a question which is well-studied [33, 55].

An example of an IC-POVM for a qubit consists of the projectors onto states:

[TABLE]

This is also a symmetric IC-POVM, or SIC-POVM, because any combination of two projectors has the same inner product.

By measuring many identical copies of $\rho_{0}$ with the same IC-POVM one obtains a probability distribution over the $d^{2}$ possible measurement outcomes. This provides $d^{2}-1$ parameters (due to normalization) that uniquely determine the density matrix $\rho_{0}$.

The existence and properties of SIC-POVMs in higher dimensional Hilbert spaces is an active area of research [56].

VI.3 Tomography of a Qudit Process

Now that we know how to estimate the density matrix for an individual qudit we can begin analyzing length-$\ell$ density matrices $\rho_{0:\ell}$. We will measure each qudit in turn rather than performing a joint measurement over the entire length-$\ell$ block of qudits. This is a luxury afforded to us because we are focusing on separable qudit sequences—the generic case of entangled qudit processes requires measuring in nonlocal bases.

For $\ell=1$ we reconstruct $\rho_{0}$ as described above and obtain a memoryless (i.i.d.) estimate of the source that emits qudit $\rho_{0}$ at every timestep, following Eq. (4). Unless $\rho_{0}$ is a pure state, there are many single-state HMCQS that generate this process since many different pure-state ensembles correspond to the same density matrix. A unique memoryless model of the source may be obtained by diagonalizing $\rho_{0}$ and having the source emit each pure eigenstate $\ket{\psi_{i}}$ with probability equal to the corresponding eigenvalue $\lambda_{i}$.

For $\ell=2$ we must reconstruct the two-qudit density matrix $\rho_{0:2}$. (Recall that our indexing is left-inclusive and right-exclusive, therefore $\rho_{0:2}$ is the joint state of the qudits for $t=0,1$). Due to stationarity, $\rho_{0:2}$ (the joint state of the two qudits) must be consistent with the one-qudit marginals, i.e. $tr_{0}(\rho_{0:2})=\rho_{1}=\rho_{0}=tr_{1}(\rho_{0:2})$.

We will describe the iterative procedure for reconstructing $\rho_{0:\ell}$ for qubits in detail. When $d=2$, $\rho_{0:2}$ has $15$ real parameters that must be determined via tomography. Tomography on the one-qubit marginals determines 3 parameters, and the condition of stationarity fixes 3 more. The state can be reconstructed fully by considering combinations of the set of mutually-unbiased measurements. For two qubits, this means the 16 combinations of Pauli matrices ($\sigma_{I_{0}}\otimes\sigma_{x_{1}}$, $\sigma_{x_{0}}\otimes\sigma_{x_{1}}$, $\sigma_{x_{0}}\otimes\sigma_{y_{1}}$, and so on.) [57]. To fully characterize $\rho_{0:2}$ $9$ of these values must be determined—those not involving the identity operators $\sigma_{I_{0}}$ and $\sigma_{I_{1}}$ which are fixed by the one-qubit marginals. For $d>2$, this procedure can be modified by using a set of mutually-unbiased bases in that higher-dimensional Hilbert space.

After determining $\rho_{0:2}$ one can continue on to determine $\rho_{0:3}$ (63 real parameters for qubits). Many of these parameters are fixed by the previous tomography on the one-qubit marginals (3 parameters), the two-qubit marginals (15 parameters), and their stationarity conditions (6 and 15 parameters respectively). Combinations of three one-site Pauli matrices are sufficient for full reconstruction. One may continue this procedure for larger $\ell$, typically until the number of measurements becomes experimentally infeasible.

VI.4 Cost of I.I.D.

Quantum information sources are often assumed to be i.i.d. [6, 33]. If an observer performing quantum state tomography assumes that an unknown quantum information source is i.i.d., then they will not go beyond determining the one-qudit marginal $\rho_{0}$. If the qudits are instead correlated, this will lead to an overestimate of the source’s randomness. They will erroneously conclude that each qudit is in state $\rho_{0}$ and that the entropy rate is $S(\rho_{0})$ bits per timestep. The latter overestimates the true entropy rate by a factor of $S(1)-s$. An observer can obtain better estimates for the entropy rate and other informational quantities by following the above procedure and tomographically reconstructing blocks of qudits of length-$\ell$.

To demonstrate the degree to which this assumption may mislead an observer, consider the process generated by nonunifilar qubit source in Fig. 12. Assume the source begins in its stationary state distribution: $(p_{A}=1/2,p_{B}=1/2)$. For any $p$ such that $0\leq p<1$, $\rho_{0}$ is the maximally-mixed state and an observer assuming an i.i.d. process estimates that $s=1$ bit per timestep. This is only an accurate description of the source for $p=1/2$. Whereas, for many values of $p$, this source has significant correlations between subsequent qubits.

Let’s take a closer look at the extreme values of $p$. For $p=0$ the process is period-$2$ with $s=0$ bits per timestep and ${\bf E}_{q}=1$ bit. This pattern can be easily detected by measuring in the $\{\ket{0},\ket{1}\}$ basis, where a measurement of [math] ($1$) immediately synchronizes an observer to state $B$ ($A$). As $p\to 1$, the two source states become increasingly disconnected, $s\to 0$, and ${\bf E}_{q}\to 1$. An observer measuring in the $\{\ket{+},\ket{-}\}$ basis observes a $+$ ($-$) is likely to measure another $+$ ($-$). This source’s rich and varied behavior at different values of $p$ will go entirely unappreciated when considering only the one-qubit density matrix, $\rho_{0}$.

VI.5 Finite Length Estimation of Information Properties

We just saw an example of how, if an observer assumes a source is i.i.d., they will generally underestimate the structure and correlation of the quantum process and will overestimate its entropy rate. The same is true if they only perform tomography on blocks of qudits up to finite length $\ell$. Consider now an experimenter who tomographically reconstructs the density matrix $\rho_{0:\ell}$ and then assumes there are no additional (longer-range) correlations within the qudit process.

Their estimates for the quantum entropy rate, quantum excess entropy and quantum transient information are given by Eqs. (38), (45), and (47) respectively.

The difference between the length-$\ell$ estimate of an information property and its true value depends on the process’ internal structure and quantum alphabet. The estimates for the nonunifilar and unifilar qubit sources in Figs. 23 and 24 represent two extremes in this respect. As previously discussed, the single-qubit density matrix for the nonunifilar qubit source is the maximally-mixed state. If an observer instead reconstructs $\rho_{0:2}$, they significantly improve their estimate of $s$, ${\bf E}_{q}$, and ${\bf T}_{q}$. However, for $\ell>2$ these estimates do not improve dramatically. There is always a trade-off between the number of experiments necessary to reconstruct the process tomographically and the accuracy of the estimates obtained from that reconstruction. For this source, $\ell=2$ strikes a balance between those two resources.

In contrast, for the unifilar qubit source the estimates of $s$, ${\bf E}_{q}$, and ${\bf T}_{q}$ improve steadily as $\ell$ increases. Longer-range correlations are captured by increasing the length of the reconstructed density matrices $\rho_{0:\ell}$. When observing this source it is likely worth finding $\rho_{0:\ell}$ for the largest $\ell$ that is experimentally feasible.

When faced with an unknown quantum source, how does one pick an appropriate value of $\ell$? One strategy is to increase $\ell$ until the correction made to the relevant information quantities by going to $\ell+1$ is below some threshold. Stationarity (and the resulting concavity of the quantum block entropy) ensure that future corrections will also be below that threshold.

VI.6 Tomography with a Known Quantum Alphabet

If an observer has additional knowledge of what possible pure states an HMCQS may emit (i.e., the quantum alphabet $\mathcal{Q}$), they can leverage this knowledge to simplify the task of system identification by inferring the word probabilities of the underlying classical process $\smash{\overleftrightarrow{{X}}}$ rather than performing full tomographic reconstruction. For qubits we can represent this simplification geometrically via the Bloch sphere; see Fig. 25. Each point on the surface of the Bloch sphere represents a pure qubit state in $\mathcal{H}^{2}$—such as, $\ket{0}$ and $\ket{1}$ on the poles of the z-axis—and each interior point represents a possible qubit density matrix. The following assumes each element of $\mathcal{Q}$ is unique.

VI.6.1 $\ell=1$

The length-$1$ density matrix $\rho_{0}$ must satisfy the equation

[TABLE]

After finding $\rho_{0}$ via tomography one may rearrange this equation to infer the length-$1$ word distributions of $\smash{\overleftrightarrow{{X}}}$ given that $\Pr({X}={x})=\Pr(\ket{\psi_{{x}}})$. The feasibility of this task depends on the relationship between $|\mathcal{Q}|$ and $d$. For the qubit case ($d=2$) one can uniquely infer $\Pr({X}_{0})$ if $|\mathcal{Q}|\leq 3$; assuming no degenerate states in $\mathcal{Q}$.

When $\mathcal{Q}$ is known it may not be necessary to fully reconstruct $\rho_{0}$. We first present several simple examples before giving a general algorithm for finding $\rho_{0:\ell}$ without performing full state tomography on $\rho_{0:\ell}$.

For $d=2$ and $|\mathcal{Q}|=2$, the possible values of $\rho_{0}$ are restricted to a chord within the Bloch sphere defined by $\rho_{0}=p\ket{\psi_{0}}\bra{\psi_{0}}+(1-p)\ket{\psi_{1}}\bra{\psi_{1}}$ with $0<p<1$. One needs only to determine the parameter $p$ rather than reconstruct $\rho_{0}$ in its entirety. An observer can also pick a uniquely informative measurement to determine $p$. The optimal PVM for doing so is one whose antipodal projectors can be connected with the diameter of the Bloch sphere that runs parallel to the line of possible values of $\rho_{0}$. For example, if $\mathcal{Q}=\{\ket{0},\ket{+}\}$ then the set of possible density matrices lies on the line segment in Fig. 25a. The best PVM is then $M_{\theta}$ with $\theta=\frac{3\pi}{4}$ and measurement outcomes $y_{0}$ (corresponding to a projection on pure state $\ket{\psi(\theta=\frac{3\pi}{4})}$) and $y_{1}$ (corresponding to the orthogonal projector). In this case it can easily be shown that $p=\frac{\sqrt{2}+1}{2}-\sqrt{2}\Pr(y_{0}|\rho_{0})$ and that $\cos^{2}(\frac{3\pi}{8})\leq\Pr(y_{0}|\rho_{0})\leq\sin^{2}(\frac{3\pi}{8})$. $M_{01}$ and $M_{\pm}$ would also be able to determine $p$, but require more samples to determine $p$ to within some desired tolerance.

For $d=2$ and $|\mathcal{Q}|=3$, the possible values of $\rho_{0}$ are confined to a simplex in the Bloch sphere defined by $\rho_{0}=p_{0}\ket{\psi_{0}}\bra{\psi_{0}}+p_{1}\ket{\psi_{1}}\bra{\psi_{1}}+(1-p_{0}-p_{1})\ket{\psi_{2}}\bra{\psi_{2}}$ with $0<p_{0},p_{1}<1$ and $p_{0}+p_{1}<1$. One may determine the parameters $p_{0}$ and $p_{1}$ rather than the 3 parameters usually required to characterize a qubit mixed state. There are two simple choices of measurements to do so: using a IC-POVM or using two different PVMs.

For the first case, consider measuring $\rho_{0}$ with a SIC-POVM with elements $E_{y}=\frac{1}{2}\ket{\phi_{y}}\bra{\phi_{y}}$, with each $\ket{\phi_{y}}$ described by Eq. 52. The probability of observing measurement $y$ can be written as:

[TABLE]

One can rearrange the system of $4$ equations (one for each POVM element) to obtain a unique set of $p_{x}$’s.

Alternatively, one uses two PVMs whose projectors can be connected by (ideally orthogonal) diameters of the Bloch sphere that are parallel to the simplex of possible $\rho_{0}$ values. This will yield 2 parameters that uniquely determine a point on the $\rho_{0}$ simplex. An example with $\mathcal{Q}=\{\ket{0},\ket{1},\ket{+}\}$ is shown in Fig. 25b, for which the possible values of $\rho_{0}$ are confined to the interior of a triangle in the Bloch sphere. One can determine $p_{0}$ and $p_{1}$ by measuring with orthogonal PVMs $M_{01}$ and $M_{\pm}$ (among many other combinations), in which case $(1-p_{0}-p_{1})=2\Pr($‘$+$’$|\rho_{0},M_{\pm})-1$ and $(p_{0}-p_{1})=2\Pr($‘[math]’$|\rho_{0},M_{01})-1$.

For $d=2$ and $|\mathcal{Q}|=4$ the possible values of $\rho_{0}$ are confined to a tetrahedron in the Bloch sphere whose vertices are the elements of $\mathcal{Q}$, and one cannot uniquely infer the classical symbol distribution from a fully-reconstructed $\rho_{0}$. For example, if $\mathcal{Q}=\{\ket{0},\ket{1},\ket{+},\ket{-}\}$ and $\rho_{0}$ is the maximally-mixed state, this could correspond to any mixture of the form $\rho_{0}=p\ket{0}\bra{0}+p\ket{1}\bra{1}+(1-p)\ket{+}\bra{+}+(1-p)\ket{-}\bra{-}$ with $0<p<1$. Thus, for $d=2$ and $|\mathcal{Q}|\geq 3$, the tomographic advantage to knowing $\mathcal{Q}$ is reduced but not eliminated as an observer can immediately exclude any value of $\rho_{0}$ that lies outside the convex polyhedron defined by the elements of $\mathcal{Q}$. This is shown in Fig. 25c, where the region of possible $\rho_{0}$ values is confined to less than $\frac{1}{4}$ of the volume of the Bloch sphere.

Similar simplifications apply for $d=3$ (qutrits) when $\mathcal{Q}$ is known. Full tomography of an arbitrary mixed qutrit state requires the determination of 8 parameters, whereas determining the classical distribution given $\mathcal{Q}$ requires $|\mathcal{Q}|-1$ parameters. This presents an advantage in general when $|\mathcal{Q}|\leq 8$. We do not explicitly construct measurements that can realize this advantage, as a geometric understanding of mixed states over the 8-dimensional space $\mathcal{H}^{3}$ is significantly more involved than the 3-dimensional Bloch sphere describing mixed states over $\mathcal{H}^{2}$.

For a generic qudit the number of parameters required for full tomography is $d^{2}-1$. And so, we expect that knowledge of $\mathcal{Q}$ gives a clear tomographic advantage (fewer parameters must be determined) when $|\mathcal{Q}|<d^{2}$.

We are now prepared to give a general protocol for $|\mathcal{Q}|=n$ and arbitrary $d$. We wish to recover the underlying distribution of alphabet states ($p_{x}=\Pr(\ket{\psi_{x}})$, $0\leq x<n$) from measurement statistics alone. First, we construct a POVM with $n+1$ elements: $E_{y}=c_{y}\ket{\psi_{x}}\bra{\psi_{x}}$ for each $\ket{\psi_{x}}$ in $\mathcal{Q}$, and $E_{n}=\mathbb{I}-\sum_{y=0}^{n-1}E_{y}$. Each $c_{y}$ is a parameter which can be varied to ensure that $E_{n}$ is positive semi-definite. By applying this POVM to $\rho_{0}$ we obtain a distribution ($\Pr(y|\rho_{0})$) over the $n+1$ possible measurements. The first $n$ are related to our desired distribution by:

[TABLE]

with one equation for each $y<n$. If a set of $p_{x}$’s is a solution to this system of linear equations, it is consistent with the observed measurements. The solution will be unique for $|\mathcal{Q}|<d^{2}$.

VI.6.2 $\ell=2$

Knowing $\mathcal{Q}$ provides further advantage when considering tomography of multiple qudits. The distribution over classical words of length $\ell$ has $|\mathcal{Q}|^{\ell}-1$ parameters, whereas full tomography of $\ell$ qudits requires the determination of $d^{2\ell}-1$ parameters.

For $\ell=2$:

[TABLE]

Once again we consider the case of $d=2$ and $|\mathcal{Q}|=2$ explicitly. There are 4 length-2 classical word probabilities, but there are 3 constraints imposed by (i) normalization, (ii) stationarity, and (iii) consistency with the one-qubit marginal. Thus, one only needs to determine a single parameter to reconstruct $\rho_{0:2}$.

Consider the task of reconstructing the length-2 density matrix produced by the $\ket{0}$-$\ket{+}$ Quantum Golden Mean generator in Fig. 6 with the knowledge that $\mathcal{Q}=\{\ket{0},\ket{+}\}$. One would first analyze the one-qubit density matrix to find that $\Pr(\ket{0})=\frac{2}{3}$ and $\rho_{0}=\frac{2}{3}\ket{0}\bra{0}+\frac{1}{3}\ket{+}\bra{+}$.

The word probability $\Pr(\ket{00})$ is the only necessary additional information to find $\rho_{0:2}$. The following simple measurement protocol can determine $\Pr(\ket{00})$: Measure two consecutive qubits with $M_{\pm}$. If the qubit is in state $\ket{+}$, one will never see outcome ‘$-$’. If the qubit is in state $\ket{0}$, one will see outcome ‘$-$’ with probability $\frac{1}{2}$. And so, $\Pr(\ket{00})=4\Pr($‘$--$’$|\rho_{0:2},M_{\pm}\otimes M_{\pm})$.

This procedure can be generalized to arbitrary 2-element alphabets $\mathcal{Q}=\{\ket{\psi_{0}},\ket{\psi_{1}}\}$. First, measure two consecutive qudits with a PVM $M_{\tilde{0}1}$, where one element is a projector onto $\ket{\psi_{1}}$ with outcome ‘$1$’ and the orthogonal projector corresponds to measurement outcome ‘$\tilde{0}$’. Second:

[TABLE]

This provides a clear advantage over the usual $9$ parameters necessary to reconstruct $\rho_{0:2}$ as it takes into account that the one-qubit marginals and stationarity each impose 3 constraints.

For $d=2$ and $|\mathcal{Q}|\geq 3$ we must determine additional parameters of the underlying classical distribution over $\mathcal{Q}$. We do so by repeatedly applying the SIC-POVM with elements $E_{y}=\frac{1}{2}\ket{\phi_{y}}\bra{\phi_{y}}$, with each $\ket{\phi_{y}}$ described by Eq. 52.

The probability of observing the length-2 measurement sequence $y_{0}y_{1}$ can be written as:

[TABLE]

There are $|\mathcal{Q}|^{2}$ $p_{x_{0},x_{1}}$’s. If a set of $p_{x_{0},x_{1}}$’s is a solution to this system of equations it is consistent with the measurement statistics, and the solution will be unique for $|\mathcal{Q}|=3$.

For $|\mathcal{Q}|=n$ and arbitrary $d$ we may construct a POVM from $\mathcal{Q}$ as we did for $\ell=1$. It is then possible infer a set of $p_{x_{0},x_{1}}$ that solves the resulting system of equations from measurement statistics. For length-2 words the equations are:

[TABLE]

There are $n^{2}$ equations, one for each length-2 measurement sequence corresponding to the POVM elements $E_{y_{0}}\otimes E_{y_{1}}$. Calculating the other possible outcomes (corresponding to $E_{n}$) is redundant due to normalization.

VI.6.3 $\ell\geq 3$

Extending this analysis to a length-$\ell$ density matrix $\rho_{0:\ell}$ takes the form:

[TABLE]

where each $\ket{\psi_{w}}$ has the form of Eq. (5). One can determine the length-$\ell$ word distributions uniquely for the general case where $|\mathcal{Q}|^{\ell}<d^{2\ell}$.

The various measurement strategies explored above for $\ell=2$ can be extended to arbitrary values of $\ell$. We will explicitly describe two: using a SIC-POVM for $d=2$ and using a POVM constructed from $\mathcal{Q}$ for arbitrary $d$.

Consider repeatedly applying the SIC-POVM with elements $E_{y}=\frac{1}{2}\ket{\phi_{y}}\bra{\phi_{y}}$, with each $\ket{\phi_{y}}$ described by Eq. (52). Taking $\ell$ measurements, one observes a length-$\ell$ word $y_{0:\ell}$. $\mathcal{Y}$ is the $4$-element alphabet of measured symbols.

The probability of observing the length-$\ell$ measurement sequence $y_{0:\ell}$ can be written as:

[TABLE]

where $\ket{\phi_{y_{0:\ell}}}=\bigotimes_{t=0}^{\ell}\ket{\phi_{y_{t}}}$ and the factor of $2^{\ell}$ comes from the POVM elements. Each of the $4^{\ell}$ sequences has a probability that can be estimated from measurement. This system of equations can be solved to find underlying length-$\ell$ word probabilities that are consistent with measurements. If $|\mathcal{Q}|\leq 3$ this solution is unique.

We can also measure $\ell$ times with a POVM constructed directly from $\mathcal{Q}$. In this case the resulting equations are:

[TABLE]

As before, one infer the $|\mathcal{Q}|^{\ell}$ underlying word probabilities ($p_{w}$’s) uniquely in the case where $|\mathcal{Q}|<d^{2}$.

VI.7 Source Reconstruction

After observing a separable qudit process and finding the length-$\ell$ density matrix $\rho_{0:\ell}$ can one infer the HMCQS that generated it? The following reconstructs the source that generates $\rho_{0:\ell}$ of an unknown process for different values of $\ell$. Note that a source which generates $\rho_{0:\ell}$ may fail to generate $\rho_{0:\ell+1}$.

VI.7.1 $\ell=1$

After determining $\rho_{0}$ an observer may construct an i.i.d. approximation of the quantum information source. Given any decomposition of $\rho_{0}$ into pure states $\ket{\psi_{{x}}}$—as in Eq. (3)—the corresponding HMCQS consists of one internal state $\mathcal{Q}=\{\ket{\psi_{{x}}}\}$ and the single transition probability for each $\ket{\psi_{{x}}}$ is its corresponding probability $\Pr(\ket{\psi_{{x}}})$ in the decomposition of $\rho_{0}$. A unique model may be obtained by taking $\rho_{0}$’s eigendecomposition. In this case the model emits each eigenstate $\ket{\psi_{i}}$ with probability equal to the corresponding eigenvalue: $\Pr(\ket{\psi_{i}})=\lambda_{i}$.

VI.7.2 $\ell=2$

With $\rho_{0:2}$ an observer begins to model a source that generates correlations between qudits. Doing so requires finding a separable decomposition of $\rho_{0:2}$ of Eq. (53)’s form. If $\mathcal{Q}$ is known, multiple procedures for finding such a separable decomposition have been introduced above. For a generic two-qudit density matrix, determining whether it is separable or entangled is generally NP-hard [58]. There are also many necessary and sufficient conditions for separability; for example, the Positive-Partial Transpose (PPT) criterion [59].

The following assumes that the observer has a separable decomposition of $\rho_{0:2}$ into alphabet states $\mathcal{Q}^{\prime}$ that may or may not be the source’s alphabet $\mathcal{Q}$. In general, the sets of basis states in the decomposition of a two-qudit density matrix may differ, but we require a symmetric decomposition such that the basis states of both qudits are $\mathcal{Q}^{\prime}$. From this decomposition they can construct an HMCQS with an underlying Markov dynamic described by Eq. (9). This HMCQS has $|\mathcal{Q}^{\prime}|$ internal states and transition probabilities $T_{\sigma_{x},\sigma_{x^{\prime}}}=\Pr(\ket{\psi_{x^{\prime}}}|\ket{\psi_{x}})$ that can be calculated from $\rho_{0:2}$. Different separable decompositions of $\rho_{0:2}$ yield different HMCQS, whose statistics over longer-length sequences may differ. Determining which is a more accurate model of the source requires performing tomography on $\rho_{0:3}$ to refine the model.

VI.7.3 $\ell\geq 3$

Finding a separable decomposition becomes more computationally expensive as the number of qudits increases [60]. Nevertheless, if one obtains a separable decomposition of $\rho_{0:3}$ where the basis states for all $3$ qudits are $\mathcal{Q}^{\prime}$, then one can create a length-$2$ Markov approximation of the source. Each length-$2$ sequence of qudits in $\mathcal{Q}^{\prime}$ corresponds to a different internal HMCQS state. Thus, it has $|\mathcal{Q}^{\prime}|^{2}$ internal states, unless some length-$2$ sequences are forbidden. The transition probabilities take the form $T_{\sigma_{x_{0},x_{1}},\sigma_{x_{1},x_{2}}}=\Pr(\ket{\psi_{x_{2}}}|\ket{\psi_{x_{0}}}\ket{\psi_{x_{1}}})$. Only transition probabilities that obey concatenation are nonzero.

One can continue in this manner, approximating the source given a separable decomposition of $\rho_{0:\ell}$ to obtain an HMCQS with $|\mathcal{Q}^{\prime}|^{\ell-1}$ states or fewer, if some sequences are forbidden. Each state corresponds to a word of length $\ell-1$ where the pure states composing the word are drawn from $\mathcal{Q}^{\prime}$. The number of internal states in the model grows exponentially with $\ell$, but not all of these states may lead to unique future predictions. If so, they can be combined without a loss of predictivity, as is done in classical computational mechanics. A general algorithm for doing so is beyond the present scope.

VI.8 Discussion

The preceding detailed many aspects of identifying an unknown quantum process by tomographically reconstructing the length-$\ell$ density matrices $\rho_{0:\ell}$. When correlations exist between qudits, this provides a predictive advantage over the common assumption that sources are i.i.d.. Starting with the method for reconstructing classical processes, we developed a variety of measurement protocols for different values of $d$ and $|\mathcal{Q}|$ and $\ell$ to find a process’ statistics when $\mathcal{Q}$ is known. We then introduced effective models for quantum sources derived entirely from separable decompositions of the density matrices $\rho_{0:\ell}$ reconstructed via tomography.

Since our aim is to harness correlations to improve predictions of future measurement outcomes, it is worth asking, How accurately can future measurement outcomes be predicted? To begin to answer this the following now defines maximally-predictive measurements for the special case of $\ell=2$ and for arbitrary $\ell$.

For a correlated qudit process, an observer with knowledge of the length-2 density matrix $\rho_{0:2}$ may perform a measurement on the first qudit and condition upon the outcome to reduce their uncertainty when measuring the second qudit. They apply $M_{0}$ (with possible outcomes $y_{i}$) on the first qubit $\rho_{0}$. This leaves the joint system in the classical-quantum state:

[TABLE]

where the $\rho^{y_{i}}_{1}$ are the qudit density matrices conditioned on outcome $y_{i}$.

The conditional von Neumann entropy of the second qubit is then:

[TABLE]

The rank-one measurement with the minimal uncertainty in measurement outcomes is in the eigenbasis of $\rho^{y_{i}}_{1}$. Different $y_{i}$ values generally correspond to different minimal-entropy measurements on the second qubit.

For two qubits, we can find the PVM for which the conditional von Neumann entropy of the second qubit is minimized. This leads to a basis-independent property of the process:

[TABLE]

where the minimum is taken over all PVMs on $\rho_{0}$.

If an experimenter reconstructs $\rho_{0:\ell}$, a measurement on all but the last qudit in the block with a measurement protocol $\mathcal{M}$ with possible outcomes $y_{0:\ell-1}$ leaves the block in the classical-quantum state:

[TABLE]

To minimize the conditional von Neumann entropy of the $\ell$-th qubit, we calculate:

[TABLE]

where the minimum is taken over all local measurement protocols on $\rho_{0:\ell-1}$.

Further development necessitates exploring the space of measurement protocols to find those with the greatest predictive advantage over i.i.d. models for arbitrary separable qudit processes.

Finally, we note that our procedure for source reconstruction required a number of model states that grows exponentially with $\ell$. Future work on finding minimal models from density matrices will also require combining states with identical predictions and performing inference over possible model topologies, as with classical Bayesian Structural Inference.

VII Conclusion

Inspired by prior information-theoretic studies of classical stochastic processes, we introduced methods to quantify structure and information production for stationary quantum information sources. We identified properties related to the quantum block entropy $S(\ell)$ that allow one to determine the amount of randomness and structure within a given qudit process. We gave bounds on informational properties of the resulting measured classical processes. In particular, we showed that they cannot have a lower entropy rate or block entropy (at any $\ell$) than the original quantum process.

We analyzed a number of hidden Markov chain quantum sources (HMCQSs), explaining how an observer synchronizes to a source’s internal states via measuring the emitted qudits. If the source allows synchronizing observations, then we showed that adaptive measurement protocols are capable of synchronizing and maintaining synchronization when fixed-basis measurements cannot.

Sequels will extend these methods and results in a number of ways. Despite focusing here on separable quantum sequences for simplicity, entangled qudit sequences can similarly be studied by combining a HMCQS and a $D$-dimensional quantum system capable of sequentially generating matrix product states [24]. Doing so will open up the study of entropy convergence of matrix product operators [61].

Many results exist for classical stochastic processes that may be extended to quantum processes. For example, there exist closed-form expressions for informational measures for nondiagonalizable classical dynamics [50, 62, 63, 64]. Extending these to quantum dynamics would allow for more accurate determination of the quantum information properties introduced here. Similarly, the preceding lays the groundwork for fluctuation theorems and large deviation theory of separable quantum processes. Finally, it will be worthwhile to develop a causal equivalence relation for quantum stochastic processes and develop quantum $\epsilon$-machines by extending classical results [65].

Separable quantum sequences also serve as a resource for information processing by finite-state quantum information transducers that transform one quantum process to another. Beyond interest in their own right, such operations have thermodynamic consequences, either requiring work to operate (as overcoming dissipation induced by Landauer erasure [66]) or acting as a quantum version of information-powered engines capable of leveraging environmental correlations to perform useful work [26, 67, 68]. This behavior has already been demonstrated for certain quantum processes [69].

Finally, though spatially-extended, ground and thermal states of spin chains under various Hamiltonians are quantum processes. And so, the quantum information measures introduced here can serve to classify these states according to the source complexity required to generate them.

Acknowledgments

We thank Fabio Anza, Sam Loomis, Alex Jurgens, and Ariadna Venegas-Li and participants of the Telluride Science Research Center Information Engines Workshops for helpful discussions. JPC acknowledges the kind hospitality of the Telluride Science Research Center, Santa Fe Institute, and California Institute of Technology for their hospitality during visits. This material is based upon work supported by, or in part by, Grant Nos. FQXi-RFP-IPW-1902 and FQXi-RFP-1809 from the Foundational Questions Institute and Fetzer Franklin Fund (a donor-advised fund of Silicon Valley Community Foundation) and grants W911NF-18-1-0028 and W911NF-21-1-0048 from the U.S. Army Research Laboratory and the U.S. Army Research Office.

Appendix A Information in Classical Processes

This section briefly recounts properties that quantify the randomness and correlation of classical stochastic processes as developed in Ref. [11]. Details and complete proofs can be found there. The main text here introduces versions appropriate to quantum processes.

A.1 Shannon Entropy

We quantify the amount of uncertainty in a discrete random variable $X$ with possible outcomes $\{x_{1},x_{2},...x_{n}\}$ by its Shannon entropy: [7]:

[TABLE]

We use $\log_{2}$, in which case the units for Shannon entropy are bits.

To study correlations between multiple random variables we use several additional information quantities related to the Shannon entropy. First, the joint entropy of two discrete random variables—$X$ and $Y$, with possible outcomes $\{x_{1},x_{2},...x_{n}\}$ and $\{y_{1},y_{2},...y_{m}\}$, respectively—is defined as:

[TABLE]

$X$ and $Y$ are statistically independent if and only if the joint entropy decomposes as $\operatorname{H}\left[X,Y\right]=\operatorname{H}\left[X\right]+\operatorname{H}\left[Y\right]$.

Second, the conditional entropy of $X$ conditioned on $Y$ is:

[TABLE]

$\operatorname{H}\left[X|Y\right]$ is the uncertainty in the value of $X$ after already knowing the value of $Y$. Note that $\operatorname{H}\left[X|Y\right]\geq 0$ and is not symmetric: $\operatorname{H}\left[X|Y\right]\neq\operatorname{H}\left[Y|X\right]$. If $X$ and $Y$ are uncorrelated, then $\operatorname{H}\left[X|Y\right]=\operatorname{H}\left[X\right]$.

From the above definitions one can derive the following identity, linking conditional and joint entropies:

[TABLE]

Third and finally, the mutual information between two random variables is:

[TABLE]

This is the amount of information one can gain about $X$ by having complete knowledge of $Y$. The mutual information is symmetric, and $\operatorname{I}\left[X:Y\right]=0$ if and only if $X$ and $Y$ are statistically-independent.

A.2 Block Entropy

For a classical stochastic process we quantify the amount of uncertainty in a block of $\ell$ consecutive random variables by taking the joint entropy $\operatorname{H}\left[{X}_{0:\ell}\right]$. This is the block entropy:

[TABLE]

where the sum is taken over all words of length $\ell$ and $\operatorname{H}\left[0\right]\equiv 0$.

$\operatorname{H}\left[\ell\right]$ is monotonically increasing and concave down, and its behavior as $\ell\to\infty$ is indicative of a process’ correlations and randomness [11]. The generic behavior of $\operatorname{H}\left[\ell\right]$ and its relation to other information properties that we will define can be seen in Fig. 2.

A.3 Shannon Entropy Rate

The following briefly summarizes Ref. [11]’s results. Refer there for a more thorough exploration of information-theoretic quantities related to multivariate systems and the block entropy.

First among these is the Shannon entropy rate $h_{\mu}$:

[TABLE]

The limit in Eq. (54) is guaranteed to exist for all stationary processes [70]. $h_{\mu}$ is irreducible randomness produced by an information source. Its units are bits per symbol.

The Shannon entropy rate can equivalently be written using the conditional entropy:

[TABLE]

Therefore, $h_{\mu}$ can equivalently be thought of as the average uncertainty in the next symbol if all preceding symbols are known.

To better appreciate $h_{\mu}$ we consider a few simple cases.

For an i.i.d. process the block entropy trivially is $\operatorname{H}\left[\ell\right]=\ell\operatorname{H}\left[{X}_{0}\right]$ and, therefore, $h_{\mu}=\operatorname{H}\left[{X}_{0}\right]$. Since there are no correlations between variables, knowledge of past symbols cannot reduce the uncertainty of the next.

If a process is periodic (for example consisting of alternating [math]’s and $1$’s), then a keen observer will note this pattern and be able to predict with certainty all future symbols of the process. In this case $h_{\mu}=0$.

For stationary Markov and hidden Markov processes, an observer can leverage past observations to reduce their uncertainty about succeeding symbols. $h_{\mu}$ will be their average uncertainty about the next symbol once they have accounted for all of the correlations with past symbols.

Graphically, $h_{\mu}$ corresponds to the slope of the block entropy curve as $\ell\to\infty$ as shown in Fig. 2.

A.4 Redundancy

For a stochastic process with alphabet $\mathcal{X}$ the maximum entropy rate is $\log_{2}|\mathcal{X}|$, corresponding to i.i.d. random variables ${X}_{t}$ with uniform distributions over all measurement outcomes ${x}_{t}$. Any other stationary process can be compressed down to its entropy rate $h_{\mu}<\log_{2}|\mathcal{X}|$.

The amount that a particular source can be compressed is known as its redundancy, defined as:

[TABLE]

$\mathbf{R}$ includes two very different effects: bias within individual random variables and correlations between different random variables. To determine the relative importance of those two factors requires closer examination of $\operatorname{H}\left[\ell\right]$.

A.5 Block Entropy Derivatives and Integrals

Since the limit in Eq. (54) exists, $\operatorname{H}\left[\ell\right]$ scales (at most) linearly. We are interested in how $\operatorname{H}\left[\ell\right]$ converges to its linear asymptote, and we will see that taking discrete derivatives of $\operatorname{H}\left[\ell\right]$ (and integrals of those derivatives) provides us with useful quantities for classifying processes.

Consider applying a discrete derivative operator $\Delta$ to a function $F:\mathbb{Z}\to\mathbb{R}$:

[TABLE]

We can apply $\Delta$ to $F$ multiple times to obtain higher-order derivatives:

[TABLE]

Taking discrete derivatives of $\operatorname{H}\left[\ell\right]$ yields a set of functions $\Delta^{n}\operatorname{H}\left[\ell\right]$. We then study how these discrete derivatives themselves converge to their asymptotic values. To do so, we take “integrals” of a discrete function $\Delta F(\ell)$ in the following manner:

[TABLE]

To study the convergence properties of each $\Delta^{n}\operatorname{H}\left[\ell\right]$, we compare it at each $\ell$ to its asymptotic value $\lim_{\ell\to\infty}\Delta^{n}\operatorname{H}\left[\ell\right]$. We do so with the following general integral form:

[TABLE]

where $\ell_{0}$ is the first value of $\ell$ for which $\Delta^{n}\operatorname{H}\left[\ell\right]$ is defined.

A.6 Entropy Gain

The first derivative of $\operatorname{H}\left[\ell\right]$ is known as the entropy gain. It is defined as:

[TABLE]

for $\ell>0$. We set $\Delta\operatorname{H}\left[0\right]\equiv\log_{2}(\mathcal{X})$. The entropy gain is the amount of additional uncertainty introduced by increasing the block size by one random variable, and its units are bits per symbol. Note that, because $\operatorname{H}\left[\ell\right]$ is monotone increasing and concave, $\Delta\operatorname{H}\left[\ell\right]\geq\Delta\operatorname{H}\left[\ell+1\right]\geq 0$, for all $\ell$. This behavior is shown in Fig. 3.

The entropy gain can be rewritten as a conditional entropy:

[TABLE]

in which case its relation to the entropy rate becomes clear. Using Eq. (55) we see that:

[TABLE]

For an observer with no prior knowledge of an information source, it will often be necessary to estimate the entropy rate of a source using finite sequences of data. In this case the entropy gain can serve as a finite-$\ell$ approximation of the true entropy rate:

[TABLE]

A.7 Predictability Gain

The second derivative of $\operatorname{H}\left[\ell\right]$ is the predictability gain, defined as:

[TABLE]

where $\ell>0$. Note that $\Delta^{2}\operatorname{H}\left[\ell\right]\leq 0$.

$|\Delta^{2}\operatorname{H}\left[\ell\right]|$ is the average amount of additional predictive information an observer obtains when expanding their observations from blocks of length $\ell-1$ to blocks of length $\ell$, and its units are bits per symbol2. Large values of $|\Delta^{2}\operatorname{H}\left[\ell\right]|$ imply that the $\ell$-th measurement is particularly informative to an observer and therefore greatly improves their estimate of the entropy rate as given by Eq. (59).

One can also calculate higher-order discrete derivatives of $\operatorname{H}\left[\ell\right]$. For our purposes this is not necessary except to note that, for stationary processes:

[TABLE]

For $n=2$ this follows from convergence of $h_{\mu}(\ell)$, and the argument for all $n>2$ is similar.

A.8 Total Predictability

We can now integrate the functions $\Delta^{n}\operatorname{H}\left[\ell\right]$. As a general heuristic, the larger the magnitude of these integrals, the more correlation or statistical bias exists within the process.

We begin by studying how the predictability gain $\Delta^{n}\operatorname{H}\left[\ell\right]$ converges to its asymptotic value $\lim_{\ell\to\infty}\Delta^{2}\operatorname{H}\left[\ell\right]=0$. Since $\Delta^{2}\operatorname{H}\left[0\right]$ is undefined, we will integrate using Eq. (57) with $\ell_{0}=1$ to obtain the total predictability $\mathbf{G}$:

[TABLE]

Since $\Delta^{2}\operatorname{H}\left[\ell\right]<0$ for all $\ell$, $\mathbf{G}<0$ as well. The units of $\mathbf{G}$ are bits per symbol. Graphically, it is the the area between the predictability gain curve and its linear asymptote of [math], as seen in Fig. 4.

To interpret $\mathbf{G}$’s value, we apply Eq. (56) to get:

[TABLE]

A process’ total predictability is then equal in magnitude to its redundancy, and we can interpret $|\mathbf{G}|$ as the amount of predictable information per symbol for a process. Here, we emphasize once more that for a given process with alphabet $\mathcal{X}$, any random variable has a maximum entropy of $\log_{2}(|\mathcal{X}|)$, that consists of two kinds of information: $h_{\mu}$, the irreducible randomness, and $|\mathbf{G}|$, the amount of information that an observer can possibly predict about it.

The total predictability is thus a function of the entropy rate for a given process and shares $h_{\mu}$’s weakness: it cannot identify statistical correlations between random variables. A large value of $|\mathbf{G}|$ could be the result of either an i.i.d. process with heavily-biased random variables or strong correlations between subsequent variables. Fortunately, our next quantity does distinguish between these cases.

A.9 Excess Entropy

Investigating the convergence of the entropy gain to the asymptotic entropy rate $h_{\mu}$ leads to a well-studied process property, the excess entropy:

[TABLE]

Since $\Delta\operatorname{H}\left[\ell\right]\geq h_{\mu}$, ${\bf E}\geq 0$ and its units are bits.

Our interpretation of ${\bf E}$ becomes clearer after applying Eq. (56) to obtain:

[TABLE]

While $h_{\mu}$ determines the linear asymptotic behavior of $\operatorname{H}\left[\ell\right]$, ${\bf E}$ encapsulates all sublinear effects. We largely discuss processes for which ${\bf E}$ is finite, known as finitary processes. A process for which ${\bf E}$ is infinite (for example if $\operatorname{H}\left[\ell\right]$ scales logarithmically with $\ell$), is known as an infinitary process. Graphically, ${\bf E}$ corresponds to the $\ell=0$ intercept of the linear asymptote to the block entropy curve, as shown in Fig. 2, as well as the area between the area between the entropy gain curve and its asymptote $h_{\mu}$ as seen in Fig. 3.

The excess entropy can also be written as a mutual information between two halves of a process’ chain of random variables:

[TABLE]

This suggests it is the total amount of information in a process’ past useful for predicting the future. It is therefore considered an indicator of the amount of process memory. A more structural approach reveals that ${\bf E}$ is a lower bound on the actual amount of memory required to predict a stochastic process [65].

Importantly, ${\bf E}$ easily distinguishes between i.i.d. processes (for which ${\bf E}=0$) and processes with correlations between random variables (${\bf E}>0$). For all processes that are periodic with period $p$, $h_{\mu}=0$ and $\operatorname{H}\left[\ell\right]$ reaches a maximum value of $\log_{2}p$ for $\ell=p$. Therefore, all period-$p$ processes have ${\bf E}=\log_{2}p$.

As with $h_{\mu}$, it is often useful for an observer to make an approximation of the true excess entropy using only finite length-$\ell$ symbol sequences. Using Eq. (61) we can estimate ${\bf E}$ as:

[TABLE]

A.10 Transient Information

Based upon our analysis of the excess entropy, we can now say that as $\ell\to\infty$ the block entropy curve has a linear asymptote:

[TABLE]

We capture the way that $\operatorname{H}\left[\ell\right]$ converges to this asymptote by taking another discrete integral to obtain the transient information:

[TABLE]

The units of ${\bf T}$ are bits$\times$symbol. ${\bf T}$ is represented graphically in Fig. 2 as the area between the $\operatorname{H}\left[\ell\right]$ curve and its linear asymptote for $\ell\to\infty$.

The transient information can be rewritten as:

[TABLE]

indicating that ${\bf T}$ is a measure of how difficult it is to synchronize to a process. An observer is considered “synchronized” when they are able to infer exactly which internal state the source currently occupies. If they remain synchronized, then they can optimally predict future measurement outcomes. That is, their estimate of the source’s entropy rate $h_{\mu}(\ell)$ is equal to its actual entropy rate $h_{\mu}$.

${\bf T}$ is a notable quantity since, unlike ${\bf E}$, it is capable of distinguishing between different period-$p$ processes.

A.11 Markov Order

The final property we introduce for classical stochastic processes is the Markov order. A process has Markov order $R$ if $R$ is the minimum value for which the following condition holds:

[TABLE]

From Eq. $\eqref{eq:markov}$ we conclude that a Markov process is one for which $R\leq 1$. More generally, for a process with Markov order $R$ the distribution for ${X}_{t}$ depends only on the previous $R$ symbols. Equivalently, $R$ is the value of $\ell$ for which the block entropy reaches its linear asymptote:

[TABLE]

This fact is represented graphically in Fig. 2.

The overwhelming majority of finite-state hidden Markov processes have infinite Markov order, meaning that $\operatorname{H}\left[\ell\right]<{\bf E}+h_{\mu}\ell$ for all $\ell$ [71]. Nevertheless, an observer can still make use of finite-$\ell$ estimates of the information properties defined here. In fact, these estimates typically converge exponentially fast with $\ell$ [72].

Appendix B Quantum Channels for Preparation and Measurement

The main text claims that a separable qudit process is the result of passing realizations of a classical process $\smash{\overleftrightarrow{{X}}}$ with symbol alphabet $\mathcal{X}$ through a classical-quantum channel that takes $x\in\mathcal{X}\to\ket{\psi_{{x}}}\in\mathcal{H}$. It also claims that the act of measurement can be described as a quantum-classical channel taking $\rho_{0:\ell}\to y_{0:\ell}$. The following elaborates on both claims, adopting the formalism of Ref. [6].

We first describe passing realizations of a classical process $\smash{\overleftrightarrow{{X}}}$ through a conditional quantum encoder. Consider a classical-quantum state composed of a classical register of dimension $|\mathcal{X}|$ and a qudit in $\mathcal{H}$ initialized in the state $\ket{0}$. Furthermore, let the classical register store the outcome of some classical random variable $X_{t}$ with outcomes $x\in\mathcal{X}$ such that:

[TABLE]

This state will serve as input to a conditional quantum encoder $\mathcal{E}_{XA\to B}$ that consists of a set $\{\mathcal{E}^{x}_{A\to B}\}$ of $|\mathcal{X}|$ completely-positive trace-preserving (CPTP) maps. We construct each map such that it transforms the initial quantum state $\ket{0}$ to the desired pure qudit state $\ket{\psi_{{x}}}$; i.e.:

[TABLE]

with $\mathcal{E}^{x}_{A\to B}$ being a unitary operation. (For $d=2$ we can consider rotations on the Bloch sphere.)

The encoding is:

[TABLE]

Now, taking $\ell$ classical registers that consist of length-$\ell$ words ${x}_{0:\ell}$ of a classical process $\smash{\overleftrightarrow{{X}}}$, we can use $\mathcal{E}_{XA\to B}$ to encode ${X}_{0:\ell}$ and obtain:

[TABLE]

where $\ket{\psi_{w}}$ take the separable form of Eq. (5) and $\rho_{0:\ell}$ therefore matches Eq. (6).

Measurement of qudits is described similarly. Let $M$ be a POVM with elements $\{E_{y}\}$ that acts on a qudit state $\rho$ in such a way that it records each measurement outcome in a classical register $Y$. The distribution over values in $Y$ is determined by:

[TABLE]

Likewise consider $\mathcal{M}_{0:\ell}$ to be a length-$\ell$ sequence of measurements with possible measurement outcome sequences $y_{0:\ell}$ determined according to some protocol $\mathcal{M}$ . When applying $\mathcal{M}_{0:\ell}$ to $\ell$ consecutive qudits in the joint state $\rho_{0:\ell}$ we assume $\mathcal{M}_{0:\ell}$ consists of local measurements in the form of Eq. (10). In this case we factor the POVM elements corresponding to particular sequences of measurement outcomes: $E_{y_{0:\ell}}=\bigotimes_{t=0}^{\ell-1}E_{y_{t}}$. A length-$\ell$ measurement outcome can be stored in $Y_{0:\ell}$, a set of $\ell$ classical registers, with its associated probability $tr(E_{y_{0:\ell}}\rho_{0:\ell})$ so that:

[TABLE]

where the last line assumes local measurements. Each $\ket{y_{0:\ell}}$ is then a separable state and all $\ket{y_{0:\ell}}$ are orthogonal.