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.
A toric logical string has constant energy barrier
Statement
If , the horizontal logical string has . If , the dual horizontal logical string has . In either case a noncontractible logical loop of the cheaper species has barrier at most , independently of .
Facts & Assumptions
Given: , fixed , the finite toric Hamiltonian, and the specified logical loops.
Pauli-path energy barrier: the barrier is the minimum peak energy excess over all paths of single-edge Pauli errors ending at the specified logical operator.
Exact finite-volume toric-code gap: the ground energy is .
Open toric strings have endpoint syndromes: an edge-simple open primal Z trail or dual X trail has the respective defects at exactly its two endpoints; a closed such trail has no defects.
Noncontractible toric logical loops: is the horizontal primal loop with edges , and is the dual horizontal loop with crossed edges .
Finite toric-code Hamiltonian: is the finite sum of star terms and plaquette terms .
Proof
Suppose . Apply in that order. After factors with , the partial string is a primal trail from to ; these endpoints are distinct, so [F3] gives exactly two e defects and no m defects. By [F5], changing one star eigenvalue from to changes its energy contribution from to , an increase of ; the excess is therefore . After the last factor the path is closed and has zero syndrome by [F3]. This is an elementary path in [F1] whose peak excess is at most .
Suppose . Apply in that order. The crossed dual edges form a closed horizontal dual loop. After factors with , the dual trail has distinct endpoint faces and ; [F3] gives exactly two m defects and no e defects. By [F5], each m defect raises the energy by , so the excess is . The final closed trail has zero syndrome by [F3] and ends at . This is an elementary path in [F1] with peak excess at most .
If , step 1.1 gives . If , step 1.2 gives . The bound is independent of .
Depends on
Used by
Dependency tree · two levels
16 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)