Title: Claude Shannon
1Claude Shannon meets Quantum Mechanics An
Introduction to Quantum Shannon Theory
Mark M. Wilde
George Washington University, Math Department
Seminar, Friday, September 18, 2009
2The Quantum Revolution
Quantum Theory developed from 1900-1925
Ideas such as Indeterminism, Heisenberg
uncertainty, superposition, interference, and
entanglement are part of quantum theory
3The Information Revolution
4The Quantum Information Revolution
The Second Quantum Revolution or The Second
Information Revolution
Ideas such as teleportation, superdense
coding, the Schumacher qubit, quantum
compression, and capacity of a quantum channel
are important here
Named Quantum Shannon Theory
5Overview
- The Physical Bit vs. the Shannon Bit
- The idea of Typical Sequences
- Shannons Noiseless and Noisy Coding Theorems
- The density operator formalism
- The Physical Qubit vs. the Schumacher Qubit
- The idea of Typical Subspaces
- The Quantum Noiseless and Noisy Coding Theorems
6Physical Bit vs. Shannon Bit
Examples of Physical Bits
Shannon bit
- Independent of physical medium
- Measure of uncertainty of random variable
- (units are bits)
7Information and Entropy
Information Content is a Measure of Surprise
8Entropic Quantities
Given two random variables X and Y
9Why are Entropies Important?
Entropies are the answer to operational questions
10What is Capacity?
The ultimate rate at which two parties can
communicate or perform some given task.
Capacity theorem has two parts
Direct Coding Theorem For any rate below
capacity (above compression rate), there exists a
coding scheme that achieves that rate with
vanishing error.
Converse Theorem For any coding scheme with
vanishing error, its rate is below
capacity (above compression rate)
11The Idea of Typical Sequences
A typical sequence is one for which
is close to
12Asymptotic Equipartition Property
13Shannons Noiseless Coding Theorem
Proof Keep only the typical sequences (throw
away atypical sequences).
14Simple Noisy Channel Model
Alice inputs a letter x
Model channel as conditional probability density
How much information can Alice transmit to Bob?
15The Idea of Conditional Typicality
Similar to the idea of typical sequences
16Shannons Channel Code Idea
Alice chooses codewords xn randomly according to
distribution pX(x)
Bobs output sequences are typical according to
pY(y)
Given a particular sequence xn, output sequence
is conditionally typical according to pYX(yx)
17A Random Packing Argument
Can distinguish about 2nI(XY) signals
18Achieving Capacity
Have freedom in choosing the distribution pX(x)
for the code
19The Physical Quantum Bit
20Physical Qubit vs. Schumacher Qubit
21A Qubit Ensemble
Examples
22The Density Operator Formalism
23The Spectral Decomposition
Ensemble is essentially classical!
24Von Neumann Entropy
Formal generalization of Shannon entropy
25Quantum Information Source
Suppose quantum information source outputs a
large number of quantum states
26The Idea of Typical Subspaces
Borrow Shannons idea of typical sequences and
apply to quantum information source
Projector defines a quantum measurement
27Schumacher Compression
28Noisy Quantum Channel Model
Model channel as a completely positive,
trace-preserving map
How much information can Alice transmit to Bob?
29Sending Classical Information over a Quantum
Channel
Coding Strategy (similar to that for classical
case)
Use the channel many times so that law of large
numbers comes into play
Channel input states are product states
Allow for small error but show that the error
vanishes with large block length
Holevo, IEEE Trans. Inf. Theory, 44, 269-273
(1998). Schumacher Westmoreland, PRA, 56,
131-138 (1997).
30Sending Classical Information over a Quantum
Channel (ctd.)
Encoder just maps classical signal to a tensor
product state
Decoder performs a measurement over all the
output states to determine transmitted classical
signal
31Sending Classical Information over a Quantum
Channel (ctd.)
32Breaking the Additivity Conjecture
Can entanglement help for encoding classical
information?
Yes!
33Other Notions of Capacity
Entanglement-Assisted Classical and Quantum
Capacities
Trade-off problems
THANK YOU!