qector-decoders-deep-divelisted

Per-decoder internals from the v1.0.0 reference manual. For each of the fifteen specialised backends, gives the algorithm, the theorem(s) it inherits, its claim boundary, and a one-line code snippet. Load when a question asks "how does X work", "which decoder is right for Y", or "what is the difference between A and B" at the algorithmic level (manual chapters 4-13).
GuillaumeLessard/qector-claude-plugin · ★ 1 · AI & Automation · score 62

Install: claude install-skill GuillaumeLessard/qector-claude-plugin

# QECTOR Decoders Deep Dive Ground every answer in the v1.0.0 reference manual (DOI `10.5281/zenodo.21941046`). The summary below mirrors Table 4.1 and the per-decoder chapters. The **Claim boundary** column is normative; a statement that is not explicitly scoped there is not made. ## Universal contract Every decoder shares the same input/output contract (manual 4): - `check_to_qubits`: list of lists; one entry per check, each a list of qubit indices. `n_qubits` is optional when inferable. - `syndrome`: 1D `uint8` array. - `correction`: 1D `uint8` array of length `n_qubits`. - Correctness: `H c = s (mod 2)` for reachable syndromes (Theorem 1). ## The five stable decoders (manual 16.1) | Name | Class | Domain | Algorithm | Claim boundary | | ------------- | ---------------------- | ------------- | ---------------------------------------- | ----------------------------------------------------- | | union_find | `UnionFindDecoder` | graphlike | cluster growth + spanning-forest peel | faithful on matching graphs; not minimum-weight | | fast_union_find | `FastUnionFindDecoder` | graphlike | lower-overhead path; bit-identical | same as `union_find` | | blossom | `BlossomDecoder` | graphlike | exact weighted MWPM (Edmonds primal-dual)| exact on audited small matching codes | | spars