Texts and readings in mathematics
Quantum Coding Theorems
Kalyanapuram Rangachari Parthasarathy
Abstract
We restrict ourselves to finite level systems. Elementary classical probability theory is woven around the notions of a finite sample space or an alphabet A, events which are subsets of A, random variables which are real or complex-valued functions on A and probability distributions which are, once again, functions on A with values in the unit interval adding to unity. An event E ⊂ A can be equivalently replaced by the two-valued indicator function 1 E which is one on the set E and zero on the complement E′ of E in A. Thus all the basic objects, namely, events, random variables and distributions are functions on A. Complex-valued functions on A constitute a commutative algebra A $$ \mathcal{A} $$ with complex conjugation as an involution. Thus an event can be identified as an element f ∈ A $$ \mathcal{A} $$ satisfying f = f2 = f̄ where the bar indicates complex conjugation. A real-valued random variable is an element f ∈ A $$ \mathcal{A} $$ satisfying f = f̄ whereas a probability distribution is an element p ∈ A $$ \mathcal{A} $$ satisfying p(x) ≥ 0 ∀ x ∈ A and ∑ x∈A p( x )=1 . $$\sum\limits_{x \in A} {p\left( x \right) = 1} .$$ . Note that every nonnegative function on A has the form f f̄ for some f ∈ A $$ \mathcal{A} $$ .