Metadata-Version: 2.1
Name: mwps
Version: 0.0.0
Classifier: Programming Language :: Rust
Classifier: Programming Language :: Python
Classifier: Programming Language :: Python :: 3
Classifier: Programming Language :: Python :: 3 :: Only
Classifier: Programming Language :: Python :: 3.7
Classifier: Programming Language :: Python :: 3.8
Classifier: Programming Language :: Python :: 3.9
Classifier: Programming Language :: Python :: Implementation :: CPython
Classifier: Programming Language :: Python :: Implementation :: PyPy
Classifier: Intended Audience :: Developers
Classifier: Intended Audience :: Information Technology
Classifier: Intended Audience :: System Administrators
Classifier: License :: OSI Approved :: MIT License
Classifier: Operating System :: Unix
Classifier: Operating System :: POSIX :: Linux
Classifier: Environment :: Console
Classifier: Environment :: MacOS X
Classifier: Topic :: Software Development :: Libraries :: Python Modules
Classifier: Topic :: Internet
License-File: LICENSE
Summary: Hypergraph Minimum-Weight Parity Subgraph (MWPS) Solver for Quantum LDPC Codes
Keywords: QEC,quantum-computing,error-correction,visualization
Home-Page: https://hyper-mwps.com
Author: Yue Wu <wuyue16pku@gmail.com>
Author-email: Yue Wu <wuyue16pku@gmail.com>
License: MIT
Requires-Python: >=3.7
Description-Content-Type: text/markdown; charset=UTF-8; variant=GFM
Project-URL: Source Code, https://github.com/yuewuo/mwps

# mwps
Hypergraph Minimum-Weight Parity Subgraph (MWPS) Algorithm for Quantum LDPC Codes

**This is a placeholder for the project. We plan to release the code in summer 2023.**

## Background

Solving MWPS on hypergraph is essential for QEC decoding because it can implement exact Most Likely Error (MLE) decoder on topological codes assuming independent physical qubit errors. Existing work like MWPM decoder can only model independent errors that generate 1 or 2 defect vertices. We model such a decoding problem as solving MWPS on the decoding graph in [this tutorial](https://tutorial.fusionblossom.com/problem-definition.html). Extending the MWPS algorithm to hypergraph, however, requires substantial modification over [the existing MWPS algorithm on normal graph](https://github.com/yuewuo/fusion-blossom). Hypergraph MWPS algorithm can model any independent error that generates arbitrary number of defect vertices, enabling applications in not only decoding depolarizing noise channel but also other decoding codes like color code and tailored surface code.


