Scribd
Upload
19 views14 pages

Quantum Shannon Theory

The document discusses Quantum Shannon Theory, highlighting the ability to convey classical bits using quantum states, particularly qubits, when pre-shared entangled states are available. It covers mathematical formalism, analogues of Shannon's theorems, and the unique properties of quantum information, such as the inability to copy or perfectly distinguish quantum states. Additionally, it explores data compression, quantum channels, and the limitations on transmitting classical information through quantum channels.

Uploaded by

Soumendra Banerjee
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
19 views14 pages

Quantum Shannon Theory

The document discusses Quantum Shannon Theory, highlighting the ability to convey classical bits using quantum states, particularly qubits, when pre-shared entangled states are available. It covers mathematical formalism, analogues of Shannon's theorems, and the unique properties of quantum information, such as the inability to copy or perfectly distinguish quantum states. Additionally, it explores data compression, quantum channels, and the limitations on transmitting classical information through quantum channels.

Uploaded by

Soumendra Banerjee
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 14

QUANTUM

SHANNON
THEORY
Anish Banerjee
(ELL714: Basic Information Theory)
MOTIVATING EXAMPLE
Alice wants to convey two classical bits to Bob sending only one bit
Input 𝑎𝑏 ∈ {00,01,10,11}

Output 𝑎𝑏

Alice can convey both bits if she can send a qubit!


(given that they pre-share an entangled state)
AGENDA
Mathematical Formalism
Analogues of Shannon’s
Theorems:
Data Compression
Channel Capacity
Quantum states cannot be
copied

STRANGE
PROPERTIES
Quantum states cannot be
OF perfectly distinguished
QUANTUM
INFORMATION
Quantum states can share
entanglement
INFORMATION SOURCE

CLASSICAL QUANTUM
Modelled as a random variable Modelled as a density matrix 𝜌
𝑋 over a source alphabet Σ: over quantum states:
X 1 2 … N X |𝜓1 ⟩ |𝜓2 ⟩ … |𝜓𝑁 ⟩
Pr(X) 𝑝1 𝑝2 … 𝑝𝑁 Pr(X) 𝑝1 𝑝2 … 𝑝𝑁

Unit vectors in a finite


dimensional vector space 𝜌 = ෍ 𝑝𝑖 |𝜓𝑖 ⟩⟨𝜓𝑖 |
with inner product
𝑥
EXAMPLE
1 0
0 = 1 = Properties of 𝜌:
0 1
0 + |1⟩ 1 1
+ = = •Unit Trace
2 2 1 tr 𝜌 = 1
0 0 =
1
10 =
1 0 •Positive Semidefinite
0 0 0 𝜓𝜌𝜓 ≥0
1 1 1 1 1
+ + = 11 =
2 1 2 1 1 Ensemble: 𝑝𝑖 , 𝜌𝑖
1 1 1 3 1
𝜌= 0 0 + + + = 𝜌 = ෍ 𝑝𝑖 𝜌𝑖
2 2 4 1 1 𝑖
Image source: Quantum Insider
FUNCTIONS OF OPERATORS

Spectral Decomposition 𝑓(𝜌) = ෍ 𝑓(𝜆𝑘 )|𝑘⟩⟨𝑘|


Theorem 𝑘

log(𝜌) = ෍ log𝜆𝑘 |𝑘⟩⟨𝑘|


𝜌 = ෍ 𝜆𝑘 |𝑘⟩⟨𝑘| 𝑘
𝑘
𝜌log 𝜌 = ෍ 𝜆𝑘 log𝜆𝑘 𝑘 𝑘
𝜆𝑘 : Eigenvalues (positive) 𝑘
|𝑘⟩: Eigenvectors (orthonormal)
𝑺 𝝆 = −𝐭𝐫 𝝆𝐥𝐨𝐠𝝆 = − ෍ 𝝀𝒌 𝐥𝐨𝐠𝝀𝒌
𝒌
DATA COMPRESSION:
SHANNON V/S SCHUMACHER
{Xi} : i.i.d. information source with Shannon entropy H(X)
R>H(X) ∃ a reliable compression scheme of rate R
Alphabet {1,2,3, … } { 𝜙1 , 𝜙2 , 𝜙3 , …}

Information Source 𝑋 𝜌 = ෍ 𝑝𝑥 |𝜙𝑥 ⟩⟨ 𝜙𝑥 |


𝑥
Typical Sequence Subspace
Entropy 𝐻(𝑋) 𝑆(𝜌)

{|𝜓𝑖 ⟩} : i.i.d. quantum information source with Von Neumann entropy S(ρ)
R>S(ρ) ∃ a reliable compression scheme of rate R
QUANTUM CHANNELS
A channel which can transmit quantum and classical information.
Also known as a quantum operation
Modelled as a Completely Positive Trace Preserving Map:

ρ 𝚽 𝚽(ρ)
CLASSICAL INFORMATION VIA
QUANTUM CHANNELS
Not completely solved.
If the sender can only produce product states:
Theorem [Holevo-Schumacher-Westmoreland (HSW)]
QUANTUM
INFORMATION VIA
QUANTUM CHANNELS?
Alice wants to send a classical message to
Bob by encoding it in a quantum state.
𝑝𝑖 , 𝜌𝑖

THE
𝑖∈[𝑛]

𝜌𝑥

HOLEVO
BOUND Whatever measurement Bob performs:
Recover 𝑥

𝐼 𝑋: 𝑌 ≤ 𝑆 𝜌 − ෍ 𝑝𝑖 𝑆(𝜌𝑖 )
𝑖

Corollary: n qubits cannot transmit more than n bits.


THANK YOU

You might also like