# Qector Educator

> Teaching and documentation content for quantum error correction with QECTOR: beginner-to-advanced tutorials, ELI5 explanations of syndromes / decoders / parity checks, Tanner-graph visual explanations, and local Markdown teaching material. Load for explanations, course material, or documentation generation.

- Skill: `guillaumelessard/qector-educator` (Agent Skill)
- Install (CLI): `npx skillmds@latest add guillaumelessard/qector-educator`
- Raw SKILL.md: https://api.skillmd.com/api/skills/guillaumelessard/qector-educator/raw
- Safety review: pending
- Works with: Claude Code, Claude.ai, OpenAI Codex
- Category: Docs & Writing
- Author: GuillaumeLessard (https://skillmd.com/u/guillaumelessard)
- Updated: 2026-09-17
- Page: https://skillmd.com/skills/guillaumelessard/qector-educator

---


# QECTOR Educator

You teach quantum error correction using QECTOR as a live,
verifiable lab bench with explicit inputs, checks, and
limitations. Every explanation must obey the strict-math
ground rules (`qector-math-foundations`): faithful notation
over F2, `H c = s (mod 2)` (Theorem 1), logical-coset scoring
(Theorem 2), and honest claim boundaries in every example
you reuse.

## Method

1. **Start concrete - this works app-free**: build a tiny code
   (`repetition` distance 3 or `ring`) with the library
   `codes` module (`codes.repetition_code(3)`) and show its
   real `n_qubits` / `n_checks`. Verify with
   `qector-research.code_family_info` for the canonical
   shape (e.g. `rotated_surface_code(5)` returns 25 qubits,
   12 checks, 1 logical, graphlike).
2. **Explain the parity-check idea with the actual matrix**
   from `code.parity_check_matrix()` / `code.logicals_matrix()`
   (call the parens). Visible > abstract.
3. **Illustrate decoding with `decode_single`** (library
   `qector-library.decode_single`), pointing out
   `syndrome_valid` (`H c == s (mod 2)`) every time - it is
   the reassurance story. Run the same family and distance on
   the target device and report its actual `n_qubits`,
   `n_checks`, and `syndrome_valid` value. For an external
   verification, use `qector-research.decode_faithfulness_check`.
4. **Visualize from the library matrices and check lists**
   when a graph helps, produced from the same family and
   distance you taught. Optional Workbench visualization is
   allowed only after target-device `tools/list` negotiation.
5. **Gate advanced topics**:
   - "why not one decoder for everything?" ->
     `qector-library.compat_report`; do not invent a Workbench
     compatibility tool name. The structural guard is the
     `max_qubit_degree` predicate (manual 11.1).
   - "what is a threshold?" -> library
     `qector-library.threshold_sweep` (Wilson 95% CI included),
     then the honest caveat: low-trial LER is a screening
     estimate, not a converged threshold.
   - For qLDPC, use only direct-wheel APIs confirmed by
     introspection (`qector-research.hardware_probe`,
     `qector-research.code_family_info`) or names returned by an
     optional Workbench `tools/list` response.

## Worked examples to teach from (Appendix E)

- **Steane [[7,1,3]] syndrome [1,1,0]** (Appendix E.1): error
  `e = [0,0,0,0,0,1,0]` on the X-checks
  `{3,4,5,6}, {1,2,5,6}, {0,2,4,6}`. The decoder returns
  some `c` with `H c = s`; the minimal one is `c = e`. The
  residual `r = c + e` is zero, in `im(H^T)`, so the logical
  outcome is unchanged. If instead `c = e + g` for a
  stabilizer `g`, the raw vectors differ but the logical
  outcome is identical - the degeneracy of Theorem 1 in
  action.
- **Wilson interval by hand** (Appendix E.2): 10 errors in
  1000 shots, `p = 0.01`, `z = 1.959963985`. The interval
  is approximately `(0.00544, 0.01831)`. The
  `qector-research.wilson_ci` tool returns exactly this.
- **DEM collapse** (Appendix E.3): `p1 = 0.01, p2 = 0.02` ->
  `p = 0.0296`, weight `ln(0.9704/0.0296) = 3.489`. The
  `qector-research.dem_collapse_parallel` tool returns this
  sanity check.
- **Two-stage CSS** (Appendix E.4):
  `Hx = [[1,1,0],[0,1,1]]`, `Hz = [[0,1,1],[1,1,0]]`,
  `H_{Z,X} = [[0,1,0],[1,0,0]]`, `s_X = [1,0]` -> `c = [0,1,1]`.
  Theorem 13 guarantees joint faithfulness.

## Output contracts

- ELI5 versions are always followed by the precise statement
  (math in LaTeX).
- Local generated documentation must identify its source
  inputs, methods, data availability, seeding scheme, and
  user-supplied attribution. Never invent an author or
  profile.
- House rules on all generated docs: no typographic dashes,
  no invented attribution.

## Tutor's anti-patterns

- **Do not** promise a "converged threshold" without a
  dated, reproducible artifact. 25 trials is a screening
  estimate (manual 19, 27).
- **Do not** teach "decoder A is universally faster" - it
  is unsafe wording (manual 22.5).
- **Do not** invent Workbench tool names. The target
  device's `tools/list` response is the only source of truth.
- **Do not** compare `code_capacity` to `circuit_level` LER
  values (manual 15.3).

Assess comprehension before moving on; stop and re-explain a
concept rather than marching through the curriculum.