Quantum error correction you can check, not just trust.
Decoders, machine-checked proofs and open research data, by Guillaume Lessard (Longueuil, Québec).
![[[832,10,15]] machine-checked](https://img.shields.io/badge/%5B%5B832%2C10%2C15%5D%5D-machine--checked-0B7A75?style=for-the-badge){kind=icon}
Website · Software · Research · Licensing · Contact
QECTOR is an independent quantum error correction project. It builds decoding software that checks its own answers, and it publishes the evidence behind its results: proofs a computer has verified, data you can rerun, and checksums for every release.
The rule behind all of it: every correction a QECTOR decoder returns reproduces the syndrome, H c = s (mod 2), or the call fails.
| Project | Latest | What it is |
|---|---|---|
| QECTOR Decoder v3 | 1.0.1 on PyPI | Python library with a compiled Rust core: Union-Find, exact MWPM (Blossom), sparse Blossom, BP-OSD and Relay-BP for qLDPC codes, CPU and GPU batch decoding, Stim and Sinter integration. 18 wheels (CPython 3.9 to 3.14, Linux x86_64, Windows x64, macOS Apple silicon) with Sigstore build provenance and PyPI attestations. |
| QECTOR Claude Plugin | 2.0.1 | Verified QEC decoding inside Claude Code and Claude Desktop: an air-gapped MCP server (12 tools by default, 41 in the research profile), schema-validated in both directions, with signed release manifests and SHA256SUMS. Pins qector-decoder-v3==1.0.1. |
| QECTOR Decoder Workbench | 1.0.7 | Free desktop application for Windows and Linux: explore codes and Tanner graphs, run 19 decoders on 10 code families, export reproducible results. Ships an 85-tool MCP server. |
| qector-proof | certification suite | Executable checks of qector-decoder-v3==1.0.0 against the Reference Manual v1.0.0, with a reproducible, hash-locked install. |
pip install qector-decoder-v3Everything below is on Zenodo with a DOI, in the QECTOR Research Archive. Each record states what kind of evidence it carries: machine-checked proof, computer-assisted proof, measured benchmark, or developer-run certification.
- [[832, 10, 15]], machine-checked. The genus5 GB CLEAN quantum LDPC code has 832 physical qubits, 10 logical qubits and minimum distance exactly 15. Coq 8.18 proves the whole result, lower bound included, with no axioms; Lean 4.19 and Isabelle2025-2 cross-check it. Formal proofs · verification bundle
- Fold-and-lift. An exact method for certifying the minimum distance of quasi-cyclic CSS codes whose circulant size carries a large power of two. For the [[832, 10]] code it runs in about one second per sector on one CPU core. Paper
- LCL-832 as a Metastable Effective Theory. Every theorem of version 4.0 is machine-checked in Coq, using only the three standard axioms of Coq's real numbers. Formal proofs
- QECTOR Decoder v3 documentation. Reference manual · verification report · benchmark datasets
Verification was run by the author unless a record says otherwise. Independent rebuilds and reviews are welcome.
- Papers, reports and data: CC BY 4.0 unless a record says otherwise.
- QECTOR software: source-available under the PolyForm Noncommercial License 1.0.0. Free for personal, academic, educational and non-commercial research.
- Commercial use (company R&D, hosted services, redistribution) needs a licence: plans at qector.store/pricing. Licences are signed tokens verified offline, with no licence server.
| Website | www.qector.store |
| Commercial Licensing | [email protected] |
| Support | [email protected] |
| Pricing | qector.store/pricing |
| Research Archive | zenodo.org/communities/id01t |
QECTOR
© 2026 Guillaume Lessard / iD01t Productions
ORCID 0009-0000-3465-3753
Building reliable, verified tools for fault-tolerant quantum computing research.