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.
Open toric strings have endpoint syndromes
Statement
Let be a primal edge trail with no repeated edge and distinct endpoints . The Pauli string has commutation syndrome at exactly the two endpoint stars and at every other star or plaquette. Let be a dual edge trail with no repeated edge and distinct endpoint faces . The string has commutation syndrome at exactly those two endpoint plaquettes and at every other plaquette or star.
If either kind of edge-simple trail is closed, its corresponding string has zero syndrome at every check.
Facts & Assumptions
Given: The toric checks, an edge-simple primal or dual trail, and the finite check-eigenvalue convention for syndromes.
Toric star and plaquette checks: stars are on incident primal edges, and plaquettes are on boundary edges.
Toric e and m syndromes: an e or m defect is a check with eigenvalue ; the corresponding commutation sign specifies whether a string creates that defect when applied to a common check eigenvector.
The Pauli matrices: on one qubit, , while commutes with and commutes with .
Proof
In the mod-two support of a primal trail, each internal visit to a vertex contributes one incoming and one outgoing edge, hence even incidence. After pairing arrivals and departures at every visit, the distinct endpoints have odd incidence and every other vertex has even incidence. By [F3], a string anticommutes with a star exactly when the number of shared edges is odd. Thus it anticommutes with exactly and . It commutes with every plaquette because both use only factors.
In the dual graph, the same incidence count gives odd overlap exactly at the two endpoint faces. A dual edge crosses the primal edge carrying the same qubit, so [F3] makes the string anticommute with exactly the two endpoint plaquettes. It commutes with all stars because both use only factors. By [F2], these signs are precisely the stated e and m endpoint syndromes.
For a closed edge-simple primal trail, every vertex has even degree in its mod-two edge support: arrivals and departures pair at every visit, including the common initial and final vertex. Thus every star overlap is even, and every plaquette overlap is even because both strings use only . For a closed dual trail, the same incidence count gives even overlap with every plaquette, and its X string commutes with all stars. Hence both closed strings have zero syndrome.
Depends on
Used by
Dependency tree · two levels
9 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
- Alexei Kitaev, Fault-tolerant quantum computation by anyons (standard reference, not scraped)
- Eric Dennis, Alexei Kitaev, Andrew Landahl, and John Preskill, Topological quantum memory (standard reference, not scraped)