Quantum Error Correction

Quantum Error Correction 

Introduction to Quantum Error Correction

What is Quantum Error Correction?

Quantum computers use qubits, which are extremely sensitive to environmental disturbances such as:

• Temperature fluctuations
• Electromagnetic radiation
• Interaction with surrounding particles

These disturbances cause quantum errors such as:

• Bit flip
• Phase flip
• Decoherence

Quantum Error Correction (QEC) is a method used to detect and correct errors in qubits without measuring their exact quantum state.

Why it is important

Problem	Explanation
Fragile qubits	Qubits lose information quickly
Decoherence	Interaction with environment destroys quantum state
Noise	External disturbances cause errors
Measurement collapse	Direct measurement destroys the superposition

Therefore, error correction is essential to build reliable quantum computers.

Shor Code (First Quantum Error Correction Code)

What is Shor Code?

The Shor Code was proposed by physicist Peter Shor in 1995. It protects 1 qubit of information using 9 physical qubits.

Main idea

The code protects against:

• Bit flip error
• Phase flip error

Process

Step	Explanation
Encoding	One logical qubit is encoded into 9 qubits
Error detection	Special quantum gates detect errors
Error correction	Corrective gates restore the original state
Decoding	Original qubit information is recovered

Example

Original qubit:

$$\mathrm{\mid }𝜓⟩=𝑎\mathrm{\mid }0⟩+𝑏\mathrm{\mid }1⟩$$

After encoding:

It becomes distributed among 9 qubits, making it possible to detect and correct errors.

Advantage

Protects against any single qubit error.

Theory of Quantum Error Correction

Quantum errors occur due to noise in quantum systems.

Types of quantum errors

Error Type	Description
Bit Flip Error	Qubit flips from |0⟩ to |1⟩
Phase Flip Error	Phase of qubit changes
Bit + Phase Flip	Combination of both errors
Decoherence	Loss of quantum information

Basic principle

Quantum error correction uses:

• Redundant encoding
• Syndrome measurement
• Error recovery operations

Key concept

Instead of copying qubits (which is impossible due to No-Cloning theorem), information is distributed across multiple qubits.

Constructing Quantum Codes

What are Quantum Codes?

Quantum codes are methods used to encode logical qubits into multiple physical qubits.

Steps to construct quantum codes

Step	Description
Encoding	Map logical qubits to physical qubits
Syndrome measurement	Identify type of error
Recovery operation	Correct the error
Decoding	Retrieve original quantum information

Example

Logical qubit:

$$\mathrm{\mid }{0}_{𝐿}⟩,\mathrm{\mid }{1}_{𝐿}⟩$$

These logical states are represented by multiple physical qubits.

Purpose

To protect quantum information from noise and decoherence.

Stabilizer Codes

What are Stabilizer Codes?

Stabilizer codes are a mathematical framework used to construct quantum error correcting codes. They use operators called stabilizers that keep the quantum state unchanged.

Key idea

If a state $\mathrm{\mid }𝜓⟩$ satisfies

$$𝑆\mathrm{\mid }𝜓⟩=\mathrm{\mid }𝜓⟩$$

then S is a stabilizer operator.

Components

Component	Description
Stabilizer group	Set of operators defining the code
Code space	Valid quantum states
Syndrome measurement	Detects error
Recovery operation	Corrects error

Example

Famous stabilizer codes include:

• Shor Code
• Steane Code

Fault-Tolerant Quantum Computation

Fault-tolerant quantum computation ensures that quantum operations continue correctly even if some components fail.

Why it is needed

Quantum hardware is extremely error-prone.

Key features

Feature	Description
Error detection	Identify faulty qubits
Error correction	Fix errors without collapsing state
Logical qubits	Encoded qubits used for reliable computation
Threshold theorem	If error rate is below a limit, computation becomes reliable

Benefit

Allows large-scale quantum computers to operate reliably.

Entropy and Information

Entropy measures uncertainty or information content in a system.

Higher entropy = more uncertainty.

Shannon Entropy

Shannon entropy is used in classical information theory.

Formula

$$𝐻(𝑋)=-\sum 𝑝(𝑥){\log }_2𝑝(𝑥)$$

Where:

• $𝑝(𝑥)$ = probability of event

Example

Event	Probability
0	0.5
1	0.5

Entropy = 1 bit

Interpretation

Maximum entropy occurs when all events are equally likely.

Basic Properties of Entropy

Property	Explanation
Non-negative	Entropy is always ≥ 0
Maximum for uniform distribution	Equal probabilities give maximum entropy
Additivity	Independent systems add entropy
Continuity	Small probability change → small entropy change

Von Neumann Entropy

Von Neumann entropy is the quantum equivalent of Shannon entropy.

Formula

$$𝑆(𝜌)=-𝑇𝑟(𝜌\log 𝜌)$$

Where

• $\mathrm{𝜌 =\; density\; matrix}$
• $𝑇𝑟$ = trace operator

Use

Measures quantum information content of a quantum system.

Strong Sub Additivity

Strong sub additivity is an important property of quantum entropy.

For systems A, B, C:

$$𝑆(𝐴,𝐵,𝐶)+𝑆(𝐵)\le 𝑆(𝐴,𝐵)+𝑆(𝐵,𝐶)$$

Meaning

The total entropy of combined systems follows certain constraints.

Importance

Used in:

• Quantum information theory
• Quantum communication
• Entanglement studies

Data Compression in Quantum Information

Data compression reduces amount of data required to represent information.

Classical compression

Example:

• ZIP files
• JPEG images

Quantum compression

Quantum data can also be compressed using Schumacher compression.

Advantage

Benefit	Explanation
Less storage	Requires fewer qubits
Efficient communication	Faster quantum data transfer
Reduced resources	Optimizes quantum memory

Entanglement as a Physical Resource

What is Entanglement?

Quantum entanglement occurs when two or more particles become linked.

The state of one particle instantly affects the other.

Example state:

$$\mathrm{\mid }𝜓⟩=\frac{1}{\sqrt{2}}(\mathrm{\mid }00⟩+\mathrm{\mid }11⟩)$$

Key properties

Property	Explanation
Non-local correlation	Particles affect each other instantly
Stronger than classical correlation	Cannot be explained by classical physics
Essential for quantum communication	Used in quantum teleportation

Applications

• Quantum cryptography
• Quantum teleportation
• Quantum computing
• Quantum networks

Quick Summary Table

Topic	Key Idea
Quantum Error Correction	Protects qubits from noise
Shor Code	First quantum error correction method
Quantum Codes	Encode logical qubits into many qubits
Stabilizer Codes	Mathematical structure for error correction
Fault-Tolerant Computing	Reliable quantum computation
Shannon Entropy	Classical information uncertainty
Von Neumann Entropy	Quantum information measure
Data Compression	Reduces information storage
Entanglement	Fundamental quantum resource