Alphabeta Math
DefinitionDefinition: AI-adaptedProof: AI-generatedPipeline-generated
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 L≥3, Je,Jm>0, a unit vector ψ in the toric code space, and a specified nontrivial logical Pauli representative Q. An elementary Pauli path to Q is a finite sequence E0,…,ET with E0=I, ET a scalar-phase multiple of Q, and Er+1=PrEr, where each Pr is X, Y, or Z on a single edge and the identity on every other edge.

For any prefix Pauli E, define its energy excess ε(E):=⟨Eψ,HLEψ⟩−Ecode, where Ecode:=−L2(Je+Jm) is the energy of every code vector. The Pauli-path energy barrier of Q is

BL(Q):=min⁡(E0,…,ET)max⁡0≤r≤Tε(Er),

where the minimum ranges over elementary Pauli paths to Q. 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.

[F1]

Finite toric-code Hamiltonian: HL is the stated finite sum of star and plaquette checks.

[F2]

The periodic toric code encodes two qubits: the code space has dimension four and every code vector has every check eigenvalue +1.

[F3]

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.

[F4]

The Pauli matrices: the one-qubit Pauli factors are I,X,Y,Z, all unitary.

[F5]

Pauli commutator is symplectic pairing: conjugating a check by a Pauli changes its sign by a value in {+1,−1} determined by their binary supports.

Verification

1.1F1F2F5givenalgebra

For any unit code vector ψ, each check has eigenvalue +1 by [F2], so [F1] gives ⟨ψ,HLψ⟩=−L2(Je+Jm)=Ecode. For any Pauli prefix E and any check g, [F5] gives gEψ=±Egψ=±Eψ. Thus Eψ has a joint check syndrome, and each term of HL has a fixed expectation on it. The sign pattern depends on E and the checks, not on the choice of code vector ψ. Therefore ε(E) is well-defined and independent of that choice.

1.2F3F4construct

Every Q in [F3] is a finite tensor product of one-edge Pauli factors I,X,Y,Z 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.

2.1F1F2step 1.2algebra∎

By [F1] and [F2], the energy excess of any prefix is 2Jea+2Jmb, where a,b∈{0,…,L2} 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