Parallel Minimum-Weight Parity Factor Decoding for Quantum Error Correction

The Minimum-Weight Parity Factor (MWPF) de-coder is renowned for its accuracy in Quantum Error Correction (QEC) for various space-time codes, including surface codes and quantum LDPC codes. This work explores the scalability of MWPF decoders through parallelization, similar to parallel MWPM decoders. We introduce a dynamic fusion graph to schedule fusion operations in dynamic quantum circuits. It allows parts of the decoding graph to be solved and fused at a later stage, without having the full fusion tree at the very beginning. It also reduces the overhead caused by the traversing of the fusion tree. The dynamic fusion graph represents a novel and efficient method for real-time QEC decoding, providing enhancements in throughput and scalability for fault-tolerant quantum computing.

Authors

Institutions

Publication Details

Published
2024-09-15
DOI
https://doi.org/10.1109/qce60285.2024.10415
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Parallel Minimum-Weight Parity Factor Decoding for Quantum Error Correction

Yang Liu, Yue Wu, Lin Zhong
Quantum Computing Algorithms and Architecture
article

Parallel Minimum-Weight Parity Factor Decoding for Quantum Error Correction

Yang Liu, Yue Wu, Lin Zhong
article en

Abstract

The Minimum-Weight Parity Factor (MWPF) de-coder is renowned for its accuracy in Quantum Error Correction (QEC) for various space-time codes, including surface codes and quantum LDPC codes. This work explores the scalability of MWPF decoders through parallelization, similar to parallel MWPM decoders. We introduce a dynamic fusion graph to schedule fusion operations in dynamic quantum circuits. It allows parts of the decoding graph to be solved and fused at a later stage, without having the full fusion tree at the very beginning. It also reduces the overhead caused by the traversing of the fusion tree. The dynamic fusion graph represents a novel and efficient method for real-time QEC decoding, providing enhancements in throughput and scalability for fault-tolerant quantum computing.

Yale University (US)
Openalex Percentile: Top 77%
Quantum Computing Algorithms and Architecture
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.