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.
Pauli-path energy barrier
Definition
Fix , , a unit vector in the toric code space, and a specified nontrivial logical Pauli representative . An elementary Pauli path to is a finite sequence with , a scalar-phase multiple of , and , where each is , , or on a single edge and the identity on every other edge.
For any prefix Pauli , define its energy excess , where is the energy of every code vector. The Pauli-path energy barrier of is
where the minimum ranges over elementary Pauli paths to . This is a finite-code energy quantity; it is not a thermal lifetime.
Facts & Assumptions
Given: The finite Hamiltonian, a nonzero toric code space, a unit code vector, and a specified logical Pauli representative.
Finite toric-code Hamiltonian: is the stated finite sum of star and plaquette checks.
The periodic toric code encodes two qubits: the code space has dimension four and every code vector has every check eigenvalue .
Stabilizer syndromes and logical Pauli operators: every Pauli is a phase-aware tensor product of one-qubit Pauli factors and its logical class is defined modulo scalar phase and stabilizers.
The Pauli matrices: the one-qubit Pauli factors are , all unitary.
Pauli commutator is symplectic pairing: conjugating a check by a Pauli changes its sign by a value in determined by their binary supports.
Verification
For any unit code vector , each check has eigenvalue by [F2], so [F1] gives . For any Pauli prefix and any check , [F5] gives . Thus has a joint check syndrome, and each term of has a fixed expectation on it. The sign pattern depends on and the checks, not on the choice of code vector . Therefore is well-defined and independent of that choice.
Every in [F3] is a finite tensor product of one-edge Pauli factors from [F4], up to scalar phase. Applying its nonidentity factors one edge at a time gives at least one elementary path, so the set of paths in the Definition is nonempty.
By [F1] and [F2], the energy excess of any prefix is , where count its violated stars and plaquettes. This is a finite set of possible real values. Hence the set of peak excesses over the nonempty path family is a nonempty subset of a finite set, and its minimum exists.
Depends on
Used by
Dependency tree · two levels
17 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)
- John Preskill, Quantum Computation, Chapter 9: Topological Quantum Computation (standard reference, not scraped)