Quantum error correction you can check, not just trust.
Independent researcher and developer in Longueuil, Québec.
qector.store · Research Archive · ORCID · LinkedIn · QECTOR organization
I write decoders for quantum error correction codes, and I publish the evidence behind every result. A QECTOR decoder checks its own answer: each correction it returns reproduces the syndrome, H c = s (mod 2), or the call fails.
| Project | What it is |
|---|---|
| QECTOR Decoder v3 | Python library with a compiled Rust core: Union-Find, exact MWPM, BP-OSD and Relay-BP for qLDPC codes, CPU and GPU batch decoding, Stim and Sinter integration. |
| QECTOR Claude Plugin | Verified QEC decoding inside Claude Code and Claude Desktop, through an air-gapped MCP server. |
| QECTOR Decoder Workbench | Free desktop app for Windows and Linux: explore codes and Tanner graphs, run 19 decoders, export reproducible results. |
| qector-proof | Executable certification suite for the decoder, with a hash-locked install. |
pip install qector-decoder-v3- [[832, 10, 15]], machine-checked. A quantum LDPC code with 832 physical qubits, 10 logical qubits and minimum distance exactly 15. Coq proves the whole result with no axioms; Lean and Isabelle cross-check it. Proofs
- Fold-and-lift. An exact method for certifying the minimum distance of quasi-cyclic CSS codes. For the [[832, 10]] code it takes 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. Proofs
Every record, with the kind of evidence it carries, is in the QECTOR Research Archive on Zenodo.
- Research and personal use: QECTOR Decoder v3 is source-available under the PolyForm Noncommercial License 1.0.0, free for personal, academic and non-commercial research.
- Commercial use: plans at qector.store/pricing.
- Bugs and failed reproductions: open an issue in the repository concerned. For security problems, follow the security policy.


