Scribd
Upload
3 views

SurfaceCode_Hoang_Swapnil

The document presents an overview of the Surface Code, a topological quantum error-correcting code proposed by A. Kitaev in 2003, highlighting its construction, error handling, and decoding methods. It details the Minimum Weight Perfect Matching Decoder used for error correction and discusses the challenges posed by degeneracy in decoding. The presentation includes visualizations and references for further reading on the topic.

Uploaded by

Hoàng Lý Minh
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
3 views

SurfaceCode_Hoang_Swapnil

The document presents an overview of the Surface Code, a topological quantum error-correcting code proposed by A. Kitaev in 2003, highlighting its construction, error handling, and decoding methods. It details the Minimum Weight Perfect Matching Decoder used for error correction and discusses the challenges posed by degeneracy in decoding. The presentation includes visualizations and references for further reading on the topic.

Uploaded by

Hoàng Lý Minh
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 22

See discussions, stats, and author profiles for this publication at: https://www.researchgate.

net/publication/380852024

SURFACE CODE

Presentation · December 2023


DOI: 10.13140/RG.2.2.15040.14083

CITATIONS READS

0 30

2 authors:

Swapnil Saha Hoang Ly Minh


Rutgers, The State University of New Jersey Rutgers, The State University of New Jersey
9 PUBLICATIONS 8 CITATIONS 6 PUBLICATIONS 32 CITATIONS

SEE PROFILE SEE PROFILE

All content following this page was uploaded by Swapnil Saha on 25 May 2024.

The user has requested enhancement of the downloaded file.


SURFACE CODE
(TORIC CODE)
Hoang Ly Minh
Swapnil Saha

1
Outline
1. Introduction
2. Construction
3. Errors and Syndrome
4. Decoding: Minimum Weight Perfect Matching Decoder
5. Visualization

2
Introduction
- Topological code

- Recently proposed by A. Kitaev in 2003

- Scalable with length (compared to [9,1,3] Shor or [7,1,3]


Steane code)
- Favored by its symmetry and LDPC-ness. (measurements
of high-weight checks are too noisy in quantum hardware)
3
Construction
1

4 Xp 2

3
Zv L=4

- A torus of size L x L, (physical) qubits lie on edges


- X stabilizers: a plaquette of 4 X operators, Ex: Xp = X1X2X3X4
- Z stabilizers: a vertex at the cross of 4 Z operators.
} Intersect at 0 or 2
qubits, so commute.

All checks have 4 operators → LDPC


4
Construction

Defining Stabilizers = Defining Code!


Just like in the case of Classical ECC

5
Errors and Syndrome
- X errors captured by Z stabilizers (vertices)
and vice versa.

- Only vertices incident to ODD number of X


errors are turned on. Same for Z errors.

- Each continuous series of X errors are


captured by 2 end vertices (excitations).

6
Code parameters
- L2 plaquettes, 1 can be derived from others:

(Recall the 5-Qbit QEC code, only 4 checks).

So L2 - 1 independent X checks. Same for Z checks → 2L2 – 2


checks (n-k)
- Encoding 2L2 - (2L2 – 2) = 2 Qbits (k)
- Minimum distance is L
4 sequential X or Z errors
do not turn on any checks

So it’s a [2L2, 2, L] code.

7
Decoder

The Minimum Weight Perfect Matching Decoder

A little background on Graph Theory !

8
A reminder on Graph
• Weighted graph 𝐺 (𝑉, 𝐸, 𝑊)

• 𝑉 = {𝑣𝑖} – set of all vertices

• 𝐸 = {𝑒𝑖𝑗} – set of edges, 𝑖 ≠ 𝑗

• 𝑊 = {𝑤𝑒}, 𝑒 ∈ 𝐸- set of weights

9
Example
• Vertices set 𝑉 = {𝑣1, 𝑣2, 𝑣3, 𝑣4}

• Edge set 𝐸 = {𝑒12, 𝑒13, 𝑒14, 𝑒23, 𝑒24, 𝑒34}

• Complete Graph ∀vi, vj, ∈ V, i ≠ j, ∃𝑒𝑖𝑗 ∈ 𝐸

10
The Minimum Weight Perfect Matching Decoder
Matching
• Subset of Edges, 𝑀 ⊆ 𝐸
• Any two edges in 𝑀 do not share any common
vertices.
• 𝑀 = {𝑒14, 𝑒23}

Perfect Matching
• Every vertex in 𝑉 is incident to exactly one edge in 𝑀
• 𝑀 = {𝑒13, 𝑒24} 11
Minimum Weight Perfect Matching
• The smallest sum of the weights of its
edges (weighted sum).
• Sum weight = σ𝑒∈𝑀 𝑤𝑒
• 𝑀 = 𝑒12, 𝑒34 - Minimum Weight
Perfect Matching
Sum weight = 2 + 3 = 5
12
Steps to Decode Error
1. Identify the excited vertices.
2. Make a complete graph 𝐺 with the vertices

13
Steps to Decode Error
1. Identify the excited vertices.
2. Make a complete graph 𝐺 with the vertices
3. Calculate the weight 𝑊 of the shortest path between
the vertices.

14
Steps to Decode Error
1. Identify the excited vertices.
2. Make a complete graph 𝐺 with the vertices
3. Calculate the weight 𝑊 of the shortest path between
the vertices.
4. Find the minimum weight perfect matching of graph 𝐺
5. Perfect matching > Correction Operator !

15
Summary of Error Decoding

Remove the Error


Or
Make the Error into a Stabilizer !

16
Visualization Example

A nice visualization website


Interactive Code Visualizer

17
Thank You !

18
Backup
- MWPM can be solved via Blossom algorithm, which has a worst-case
complexity O(n3), expected O(n2).

- There’re also other decoding methods: Union-Find,…

19
Backup
- Different errors can give the same excitations/syndrome: Degeneracy

p
p p
p

- In general, degeneracy makes the Decoding computationally hard: For every 2 excitations,
find all possible errors that output the syndrome patterns (exponential in L)
- Assuming i.i.d. noise, this reduces to find the minimum distance path between 2 excitations

20
References
• https://arthurpesah.me/blog/2023-05-13-surface-
code/
• iOlius, A.D., Fuentes, P., Orús, R., Crespo, P.M.
and Martinez, J.E., 2023. Decoding algorithms for
surface codes. arXiv preprint arXiv:2307.14989.

21
View publication stats

You might also like