An interpretation of Union-Find Decoder on Weighted Graphs - INSPIRE

DataBETA

An interpretation of Union-Find Decoder on Weighted Graphs

Nov 6, 2022

20 pages

e-Print:

2211.03288 [quant-ph]

View in:

ADS Abstract Service

reference search21 citations

Citations per year

Abstract: (arXiv)

Union-Find (UF) and Minimum-Weight Perfect Matching (MWPM) are popular decoder designs for surface codes. The former has significantly lower time complexity than the latter but is considered somewhat inferior, in terms of decoding accuracy. In this work we present an interpretation of UF decoders that explains why UF and MWPM decoders perform closely in some cases: the UF decoder is an approximate implementation of the blossom algorithm used for MWPM. This interpretation allows a generalization of UF decoders for weighted decoding graphs and explains why UF decoders achieve high accuracy for certain surface codes.

References(24)

Figures(16)

[1]

Linear-time maximum likelihood decoding of surface codes over the quantum erasure channel

Nicolas Delfosse
(
- Caltech and
- UC, Riverside and
- Microsoft, Redmond
)
,
Gilles Zémor
(
- IMB, Bordeaux
)

- Phys.Rev.Res. 2 (2020) 3, 033042
•
DOI:
- 10.1103/PhysRevResearch.2.033042

[2]

Photon Bubble Turbulence in Cold Atom Gases

- Nature Commun. 12 (2021) 1-6
•
e-Print:
- 1604.08114
•
DOI:
- 10.1038/s41467-021-23493-2

[3]

Wu, Y

N. Liyanage
,
S. Puri
,
L. Zhong

[4]

Personal communication. Google Quntum AI Team (September,)

H. Oscar
,
C. Gidney

[5]

QEC-playground: a decoder testbed for quantum error correction. URL

- https://github,
- https://github.com/yale-paragon/QEC-Playground

[6]

An Introduction to Topological Quantum Codes

H. Bombin
(
- Perimeter Inst. Theor. Phys.
)

- "Topological Codes", in "Quantum Error Correction", edited by Daniel A. Lidar and Todd A. Brun, Cambridge University Press, New York, 2013
•
e-Print:
- 1311.0277

[7]

The surface code with a twist

T.J. Yoder
,
I.H. Kim

- Quantum 1 (2017) 2

[8]

Low-distance surface codes under realistic quantum noise

- Phys.Rev.A 90 (2014) 6, 062320
•
DOI:
- 10.1103/PhysRevA.90.062320

[9]

An o (v— v— c— e—) algoithm for finding maximum matching in general graphs. In 21st Annual Symposium on Foundations of Computer Science (sfcs), 17-27

S. Micali
,
V.V. Vazirani

[10]

Faster scaling algorithms for general graph matching problems. Journal of the ACM (JACM) 38, 815-853

H.N. Gabow
,
R.E. Tarjan

[11]

Maximum skew-symmetric flows and matchings

A.V. Goldberg
,
A.V. Karzanov

- Math.Programming 100 (2004) 537-568

[12]

Almost-linear time decoding algorithm for topological codes

Nicolas Delfosse
(
- Caltech and
- UC, Riverside and
- Microsoft, Redmond
)
,
Naomi H. Nickerson
(
- Imperial Coll., London
)

- Quantum 5 (2021) 595
•
e-Print:
- 1709.06218
•
DOI:
- 10.22331/q-2021-12-02-595

[13]

Paths, trees, and flowers

J. Edmonds

- Can.J.Math. 17 (1965) 449-467

[14]

: a new implementation of a minimum cost perfect matching algorithm. Mathematical Programming Computation 1, 43-67

Kolmogorov
,
V. Blossom, V

[15]

Understanding and using linear programming

J. Matousek
,
B. Gärtner

[16]

Minimum weight perfect matching of fault-tolerant topological quantum error correction in average $O(1)$ parallel time

Austin G. Fowler
(
- UC, Santa Barbara and
- Melbourne U.
)

e-Print:
- 1307.1740

[17]

Fault-tolerant weighted union-find decoding on the toric code

- Phys.Rev.A 102 (2020) 1, 012419
•
DOI:
- 10.1103/PhysRevA.102.012419

[18]

Quantum codes on a lattice with boundary. arXiv preprint

S.B. Bravyi
,
A.Y. Kitaev

[19]

Fault-tolerant quantum computing with color codes

Andrew J. Landahl
(
- Sandia and
- New Mexico U.
)
,
Jonas T. Anderson
(
- New Mexico U.
)
,
Patrick R. Rice
(
- New Mexico U. and
- Los Alamos
)

e-Print:
- 1108.5738

[20]

Practical Quantum Error Correction with the XZZX Code and Kerr-Cat Qubits

Andrew S. Darmawan
(
- Kyoto U., Yukawa Inst., Kyoto and
- JST, PRESTO
)
,
Benjamin J. Brown
(
- Sydney U.
)
,
Arne L. Grimsmo
(
- Sydney U.
)
,
David K. Tuckett
(
- Sydney U.
)
,
Shruti Puri
(
- Yale U.
)

- PRX Quantum 2 (2021) 3, 030345
•
e-Print:
- 2104.09539
•
DOI:
- 10.1103/PRXQuantum.2.030345

[21]

Decoder for the Triangular Color Code by Matching on a Möbius Strip

- PRX Quantum 3 (2022) 1, 010310
•
DOI:
- 10.1103/PRXQuantum.3.010310

[22]

Fusion Blossom: a fast minimum-weight perfect matching (mwpm) solver for quantum error correction (QEC). URL

- https://github.com,
- https://github.com/yale-paragon/fusion-blossom

[23]

Pymatching v2

O. Higgott
,
C. Gidney

[24]

How to write a 21st century proof

L. Lamport

- J.Fixed Point Theor.Appl. 11 (2012) 43-63