English
Related papers

Related papers: PyMatching: A Python package for decoding quantum …

200 papers

Fault-tolerant quantum computing relies on Quantum Error Correction, which encodes logical qubits into data and parity qubits. Error decoding is the process of translating the measured parity bits into types and locations of errors. To…

Quantum Physics · Physics 2024-04-05 Narges Alavisamani , Suhas Vittal , Ramin Ayanzadeh , Poulami Das , Moinuddin Qureshi

In this work, we introduce a fast implementation of the minimum-weight perfect matching (MWPM) decoder, the most widely used decoder for several important families of quantum error correcting codes, including surface codes. Our algorithm,…

Quantum Physics · Physics 2025-01-22 Oscar Higgott , Craig Gidney

Decoding a quantum error correction code is generally NP-hard, but corrections must be applied at a high frequency to suppress noise successfully. Matchable codes, like the surface code, exhibit a special structure that makes it possible to…

Realizing the full potential of quantum computation requires Quantum Error Correction (QEC). QEC reduces error rates by encoding logical information across redundant physical qubits, enabling errors to be detected and corrected. A common…

Quantum Physics · Physics 2026-01-05 Yotam Peled , David Zenati , Eliya Nachmani

Decoding algorithms are essential to fault-tolerant quantum-computing architectures. In this perspective we explore decoding algorithms for the surface code; a prototypical quantum low-density parity-check code that underlies many of the…

Quantum Physics · Physics 2024-02-29 Benjamin J. Brown

The Minimum-Weight Perfect Matching (MWPM) decoder is widely used in Quantum Error Correction (QEC) decoding. Despite its high accuracy, existing implementations of the MWPM decoder cannot catch up with quantum hardware, e.g., 1 million…

Quantum Physics · Physics 2023-05-16 Yue Wu , Lin Zhong

Minimum-Weight Perfect Matching (MWPM) decoding is important to quantum error correction decoding because of its accuracy. However, many believe that it is difficult, if possible at all, to achieve the microsecond latency requirement posed…

Hardware Architecture · Computer Science 2025-02-21 Yue Wu , Namitha Liyanage , Lin Zhong

Different choices of quantum error-correcting codes can reduce the demands on the physical hardware needed to build a quantum computer. To achieve the full potential of a code, we must develop practical decoding algorithms that can correct…

Quantum Physics · Physics 2025-06-18 Zohar Schwartzman-Nowik , Benjamin J. Brown

The minimum weight perfect matching (MWPM) decoder is the standard decoding strategy for quantum surface codes. However, it suffers a harsh decrease in performance when subjected to biased or non-identical quantum noise. In this work, we…

The union-find decoder is a leading algorithmic approach to the correction of quantum errors on the surface code, achieving code thresholds comparable to minimum-weight perfect matching (MWPM) with amortised computational time scaling…

Quantum Physics · Physics 2025-04-10 Sam J. Griffiths , Dan E. Browne

Efficient and realistic error decoding is crucial for fault-tolerant quantum computation (FTQC) on near-term devices. While decoding is a classical post-processing task, its effectiveness depends on accurately modeling quantum noise, which…

Quantum Physics · Physics 2025-09-10 Yi Tian , Y. Zheng , Xiaoting Wang , Ching-Yi Lai

Surface codes exploit topological protection to increase error resilience in quantum computing devices and can in principle be implemented in existing hardware. They are one of the most promising candidates for active error correction, not…

Quantum Physics · Physics 2016-09-22 Bettina Heim , Krysta M. Svore , Matthew B. Hastings

The minimum-weight perfect matching (MWPM) decoder is a standard decoding strategy for surface codes, but its performance degrades considerably under biased noise. In this paper, a modified surface code, termed the XYZ planar code, is…

Information Theory · Computer Science 2026-05-25 Zhiwei Wang , Liqi Wang

PyUnfold is a Python package for incorporating imperfections of the measurement process into a data analysis pipeline. In an ideal world, we would have access to the perfect detector: an apparatus that makes no error in measuring a desired…

Data Analysis, Statistics and Probability · Physics 2018-06-12 James Bourbeau , Zigfried Hampel-Arias

Fault-tolerant quantum computation (FTQC) requires fast and accurate decoding of quantum errors, which is often formulated as a minimum-weight perfect matching (MWPM) problem. A determinant-based approach has been proposed as a novel method…

Quantum Physics · Physics 2026-04-03 Ryo Mikami , Hayata Yamasaki

Errors in surface code have typically been decoded by Minimum Weight Perfect Matching (MWPM) based method. Recently, neural-network-based Machine Learning (ML) techniques have been employed for this purpose. Here we propose a two-level (low…

PyPM is a Python-based domain specific language (DSL) for building rewrite-based optimization passes on machine learning computation graphs. Users define individual optimizations by writing (a) patterns that match subgraphs of a computation…

Programming Languages · Computer Science 2024-12-19 Joseph W. Cutler , Alex Collins , Bin Fan , Mahesh Ravishankar , Vinod Grover

Pyqcm is a Python/C++ library that implements a few quantum cluster methods with an exact diagonalization impurity solver. Quantum cluster methods are used in the study of strongly correlated electrons to provide an approximate solution to…

Strongly Correlated Electrons · Physics 2024-01-10 Théo N. Dionne , Alexandre Foley , Moïse Rousseau , David Sénéchal

Reducing space and time overheads of fault-tolerant quantum computation (FTQC) has been receiving increasing attention as it is crucial for the development of quantum computers and also plays a fundamental role in understanding the…

Quantum Physics · Physics 2025-08-14 Yugo Takada , Hayata Yamasaki

Topological quantum error-correcting codes are a promising candidate for building fault-tolerant quantum computers. Decoding topological codes optimally, however, is known to be a computationally hard problem. Various decoders have been…

Quantum Physics · Physics 2020-04-01 Milap Sheth , Sara Zafar Jafarzadeh , Vlad Gheorghiu
‹ Prev 1 2 3 10 Next ›