How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Support and weight of an operator on a finite register
Definition
Fix an ordered physical register with finite-dimensional factors. For , form and in the inherited order, and let be the declared bijective wire permutation. An operator is supported in if there is with
Its weight is . The minimum exists because the full set supports every operator and has finitely many subsets. Let ; scalar identity operators have weight zero. The weight is invariant under reordering the tensor factors by their declared wire permutation (Operator support weight is invariant under wire permutation ↗).
Here is the tensor map of Tensor products of finitely many linear maps. The product factors may have arbitrary finite dimensions; qubits are the special case for every .
Remarks
The register tensor pairing and exact permutation convention are supplied by Ordered tensor registers, their inner product, and wire permutations and Finite wire permutations are unitary basis permutations. Their current bodies were inspected; Operator support weight is invariant under wire permutation ↗ proves the resulting weight invariance.
Depends on
Used by
- Distance corrects unlocated errors and known erasures Corollary
- Code Deviation and Fault Spread Definition
- Detectable operators and distance of a finite-register quantum code Definition
- Finite ordered channel-location schedules Definition
- Stabilizer distance Definition
- Quantum repetition subspace projector and a distance-one boundary error Example
- Detectable operators form a subspace and quantum distance is well defined Lemma
- Operator support weight is invariant under wire permutation Lemma
- CSS syndrome correction Theorem
- Exact indistinguishability in a contractible disk Theorem
- Stabilizer distance detection and correction Theorem
- Toric code distance is L Theorem
Dependency tree · two levels
20 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Richard Cleve, Quantum Information Processing course notes, §§36.1, 36.3, and 37.3 (standard reference, not scraped)
- John Preskill, Quantum Computation, Chapter 7, §7.4.1 (standard reference, not scraped)