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.
Toric Code Anyons, Logical Operators, and Protection
1 · Prerequisites
- Algebraic Closure, Embeddings, and Separability
- Algebraic Extensions, Extension Degree, and Finite Fields
- Binary Operations, Monoids, Groups and Subgroups
- Channels, Kraus, Choi, and Stinespring Representations
- Classical and Quantum Error-Correcting Codes
- Composition Series, the Jordan–Hölder Theorem and Solvable Groups
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Cyclic Groups and Direct Products
- Determinants of Matrices over a Commutative Ring
- Diagonalisation and the Minimal Polynomial
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Divisibility, Greatest Common Divisors and Bézout's Identity
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Eigenvalues, Eigenvectors and the Characteristic Polynomial
- Finite Averaging and Character-Theory Prerequisites
- Finite Counting, Factorials and Binomial Coefficients
- Finite-Dimensional Complex Inner-Product Spaces and Matrix Interfaces
- Foundations of the Real Numbers for Analysis
- Free Modules, Exact Sequences, Projective and Injective Modules
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Hilbert Space Geometry and Riesz Representation
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Knill–Laflamme Recovery and Subsystem Codes
- Limits of Real Functions
- Linear Algebra Methods in Combinatorics
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Measurements, POVMs, and Instruments
- Modules, Submodules, Quotient Modules and the Isomorphism Theorems
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- Pauli and Clifford Groups, Binary Symplectic Tableaux
- Polynomial Rings, the Division Algorithm and Roots
- Primes, Euclid's Lemma and the Fundamental Theorem of Arithmetic
- Pure and Mixed States, Ensembles, and Schmidt Decomposition
- Qubits, Bloch Sphere, Pauli Algebra, and One-Qubit Gates
- Registers, Tensor Products, and Partial Trace
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Roots, Rational Powers, and Classical Inequalities
- Sequences and Limits
- Simple Field Extensions and the Construction of the Complex Numbers
- Splitting Fields
- Stabilizer and CSS Codes, Syndromes, and Procedures
- Stabilizer Circuits and Gottesman–Knill Simulation
- Suprema and Infima
- Sylow's Theorems, p-Groups and Nilpotent Groups
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- Tensor Products of Modules
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Fundamental Theorem of Algebra
- The Fundamental Theorem of Finite Abelian Groups
- The Galois Correspondence
- The Spectral Theorem, Positive Operators and Singular Value Decomposition
- The ZFC Axioms and the Basic Set Constructions
- Topology of ℝ
- Triangularisation, Generalised Eigenspaces and Jordan Canonical Form
- Vector Spaces, Linear Subspaces, Span and Direct Sums
2 · Summary
This page constructs the periodic square-lattice toric stabilizer code over , proves its check relations, two encoded qubits, e/m string syndromes, logical algebra, distance and recovery threshold. It also proves exact local indistinguishability in a specified contractible disk, the exact finite-volume Hamiltonian gap, and a constant upper bound on a logical-string energy barrier. These are finite-model results; no positive material-phase, small-local-perturbation-stability or thermal-lifetime conclusion is made.
3 · Logical flowchart
4 · Definitions, theorems and proofs
Periodic square cellulation of the torus
Definition
Fix an integer and write . The periodic square cellulation has vertices , horizontal edges from to , vertical edges from to , and faces , for . Every index is read modulo . The boundary of consists of . Equivalently, this is the quotient of the unit square tiling of by translations in .
The cellulation has vertices, edges, and faces. The condition ensures that the four edges in each star and face are distinct, and that every edge has two distinct endpoints and two distinct incident faces. The vertex-edge graph joins vertices joined by an edge. The face-adjacency graph joins faces sharing an edge; both graphs are connected.
Facts & Assumptions
Given: An integer and coordinate indices in .
Verification
The horizontal and vertical edges are indexed by two disjoint copies of , so there are edges; the vertex and face sets each have indices. At the four incident edges are . Their endpoints are distinct because .
The faces adjacent to are and , and the faces adjacent to are and . These pairs are distinct for ; each displayed face boundary has four distinct edges. Thus the stated incidences define a square cellulation without repeated incidences.
Repeated horizontal and vertical steps modulo connect any pair of vertices. The same coordinate moves connect any pair of face indices through shared edges. Therefore both graphs defined above are connected.
Finite square-lattice cycles are boundaries
Statement
In the infinite square lattice, every finitely supported edge chain over whose incidence at each vertex is even is the boundary of a finitely supported collection of square faces. The same conclusion holds for the translated dual square lattice.
Facts & Assumptions
Given: Finitely supported coefficients on the horizontal and vertical edges of the integer square lattice, satisfying the cycle equations
for every . All sums below are finite because the coefficients have finite support.
Proof
For each row , sum the cycle equations over . The horizontal terms cancel in pairs, giving , where . Finite support gives for all sufficiently large , so for every . Define a face coefficient in . For fixed , this coefficient is zero for sufficiently large by finite support and for sufficiently negative because then it equals . It is also zero for all but finitely many rows. Hence is a finitely supported face chain.
The vertical edge belongs to the boundaries of and , so its coefficient in is . Thus and the given chain agree on every vertical edge.
The horizontal edge belongs to the boundaries of and . Its coefficient in is . The cycle equation at replaces each summand by ; summing over telescopes to because the sequence is finitely supported. Thus and the given chain agree on every horizontal edge, proving . Translating the dual square lattice by identifies it with the same integer grid, so the identical construction proves the dual assertion.
Toric star and plaquette checks
Definition
For the periodic cellulation in Periodic square cellulation of the torus, put one qubit on each edge, ordered lexicographically by and then with horizontal before vertical edges. The physical Hilbert space is , where is the edge set. For an edge , write and for the corresponding one-qubit Pauli acting on that tensor factor and as the identity on every other factor. Define the star and plaquette checks by
All indices are in .
Facts & Assumptions
Given: An integer , its periodic square cellulation, and the ordered edge register.
Periodic square cellulation of the torus: the edges incident to are ; the boundary of is , with four distinct edges in each list.
The Pauli matrices: and are the specified Hermitian one-qubit matrices, and by direct multiplication.
Finite registers and their ordered computational bases: the physical space is the ordered tensor product of one copy of for each edge.
Tensor products of finitely many linear maps: tensor products of maps act on elementary tensors factor by factor and extend linearly.
The product basis is orthonormal and tensor dimensions multiply: ordered elementary computational-basis tensors span the finite register.
Verification
By [F1], each displayed check acts on four distinct edge factors. By [F2] and [F3], its factors are defined endomorphisms of the ordered physical register, so both and are well-defined tensor-product operators.
Each factor in either product is Hermitian and squares to the identity by [F2]. The factors act on distinct tensor coordinates, so [F4] makes their two compositions agree on every elementary tensor; those tensors span the register by [F5]. Therefore each full product is Hermitian and squares to the identity. These are the star and plaquette checks used below.
A contractible toric disk lifts to the square grid
Statement
Write the torus as with its periodic square cellulation. Let be a nonempty compact embedded topological disk with connected complement. Then the quotient map has a lift on which it is one-to-one and maps homeomorphically onto . Consequently every finite primal or dual edge chain supported in lifts to a finite chain in the infinite square tiling, and cycles lift to cycles.
Facts & Assumptions
Given: The quotient torus , the square cellulation, and a compact embedded disk homeomorphic to the closed unit disk.
Proof
For any , choose an open square about of side length less than . Its translates by distinct vectors in are disjoint, and the quotient map restricts to a homeomorphism from each translate onto the same open neighborhood of . These neighborhoods cover the torus. For a path, pull back this cover to the compact interval, take a finite subcover and a Lebesgue number, and partition the interval into pieces of smaller length. Each piece maps into one such neighborhood; once its initial lift is fixed, the inverse on the unique sheet through that lift defines the lift on the piece. These pieces agree at endpoints, and uniqueness follows from uniqueness of the local inverse. For a homotopy square, use a finite grid of rectangles whose images each lie in one evenly covered neighborhood. Starting from a lifted corner, the local inverses extend across adjacent rectangles; on a common edge two extensions agree because they are lifts agreeing at one endpoint. Thus paths and homotopies lift after their initial data are fixed.
Fix and a lift . For each , lift a path from to starting at . Any two such paths are homotopic relative to their endpoints inside , since the disk is contractible. By the homotopy lifting construction in step 1.1, the lifted endpoint varies continuously through the discrete fiber over , so it is constant during the homotopy. Thus the endpoint is independent of the chosen path. These endpoints define a section of over ; local inverse charts from step 1.1 make the section continuous and one-to-one.
The image is compact because is compact and the section is continuous, hence it is bounded. The square and dual square tilings are locally finite, so only finitely many of their edges meet . The lift preserves local edge incidences by step 1.1. Therefore every finite primal or dual cycle supported in lifts to a finite edge chain with even incidence at each lifted vertex.
Toric incidence maps have exactly one relation each
Statement
For , the star-support vectors in have span dimension , and their only relation is their total sum. The face-boundary vectors have the same span dimension and their only relation is their total sum. The dual-face incidence statement has the same rank.
Facts & Assumptions
Given: The periodic square cellulation with vertices , edges , and faces .
Periodic square cellulation of the torus: the vertex-edge graph and the face-adjacency graph are connected; every edge has two distinct endpoints and separates two distinct adjacent faces.
Rank-nullity: : for a linear map with finite-dimensional domain, the dimension of its image equals the dimension of its domain minus the dimension of its kernel.
Proof
Define by sending a coordinate vector at a vertex to its star-support vector and extending linearly. The coefficient of an edge joining vertices in is . Thus consists exactly of assignments constant along every edge. By [F1] the vertex graph is connected, so is the one-dimensional space of constant assignments. Since , [F2] gives . The all-vertex sum is zero because each edge has two endpoints, so this is the only star relation.
Define by sending a face coordinate vector to that face's boundary and extending linearly. An edge separating faces has coefficient in . Thus consists exactly of assignments constant along adjacent faces. By [F1] the face-adjacency graph is connected, so is the one-dimensional space of constant assignments. Since , [F2] gives . The all-face sum is zero because each edge borders two faces, so this is the only face-boundary relation. The dual face-adjacency graph has the same square-grid incidence, proving its incidence rank is also .
Toric e and m syndromes
Definition
For a nonzero vector that is a simultaneous eigenvector of all toric checks, its e syndrome is the set of vertices for which , and its m syndrome is the set of faces for which . A violated star is called an e defect and a violated plaquette is called an m defect. These are finite stabilizer-syndrome labels; the names do not assume that a material contains localized physical quasiparticles.
These eigenvalue labels agree with the commutation-sign syndrome of Stabilizer syndromes and logical Pauli operators when a Pauli error acts on a common check eigenvector, as verified below.
The checks are Hermitian involutions, as verified below; thus their eigenvalues on any nonzero simultaneous eigenvector are indeed signs.
Facts & Assumptions
Given: The toric checks on the finite edge register and their simultaneous-eigenvalue convention.
Toric star and plaquette checks: every toric check is a Hermitian involution.
Stabilizer syndromes and logical Pauli operators: a syndrome bit is for commutation sign and for sign .
Verification
A Hermitian involution has only eigenvalues and . Therefore each check eigenvalue on the given nonzero simultaneous eigenvector is one of these two signs, so the two sets in the Definition are well-defined finite subsets of vertices and faces.
Let be a common check eigenvector, and let be a Pauli error. For any check , write with . Then . Since is invertible, ; its negative-check sets therefore consist exactly of the checks with commutation bit . On an independent generating list these are the syndrome bits of [F2]. Thus the eigenvalue labels defined here are compatible with that error-syndrome convention, with stars and plaquettes kept separate.
Toric checks commute and have two global relations
Statement
All star and plaquette checks of Toric star and plaquette checks commute. The product of all stars is the identity, and the product of all plaquettes is the identity.
Facts & Assumptions
Given: The periodic torus with and its star and plaquette checks.
Toric star and plaquette checks: is on the four edges incident to , and is on the four edges of .
Pauli commutator is symplectic pairing: two Pauli operators commute when the mod-two symplectic pairing of their binary supports is zero; for an -support and a -support, this pairing is their overlap parity.
Periodic square cellulation of the torus: every edge has two distinct endpoints and borders two distinct faces, with all incidences read modulo .
Proof
For a fixed vertex , the only faces sharing its incident edges are . Their boundaries overlap the star support respectively in , , , and ; every other face has empty overlap. Hence every star-plaquette overlap has even size. By [F2], each star commutes with each plaquette. Two stars commute because all their nonidentity factors are ; two plaquettes commute because all their nonidentity factors are .
By [F3], every edge has exactly two endpoints, so in the product of all stars its factor occurs twice. Since , the total product is . Every edge borders exactly two faces, so the same argument with gives . The first total product is also .
Toric cycle classes are determined by two winding parities
Statement
Let be the space of primal edge chains with even incidence at every vertex, and let be the span of the face boundaries. Then , the quotient has dimension two, and the two winding parities give coordinates on that quotient. The same statement holds for dual edge chains, with dual face boundaries (the stars around primal vertices) in place of primal face boundaries. The horizontal loop has winding pair , and the vertical loop has pair ; their dual counterparts give the corresponding basis of the dual quotient.
Facts & Assumptions
Given: The periodic square cellulation for . Here with addition modulo two, and is the coordinate vector space on a finite set .
Periodic square cellulation of the torus: there are vertices and faces and edges, with horizontal and vertical edges indexed periodically.
Toric incidence maps have exactly one relation each: the span of face boundaries has dimension , and the vertex-edge and dual incidence graphs are connected.
Proof
The primal vertex-edge graph has the explicit spanning tree . The horizontal edges form a path through row zero, and each other row is attached to that path by one vertical column path; hence is connected and has no cycle. For each edge , add to the unique tree path between its endpoints. This gives a cycle containing and no other edge outside . These cycles are independent because the coefficient of each non-tree edge in a linear combination is its own coefficient. They span : subtract from any cycle the corresponding to its non-tree edges; the remainder is an even-incidence chain supported on the tree, and a nonempty finite forest has a leaf of odd degree, so the remainder is zero. Thus .
Every face boundary has even incidence at each vertex, so . By [F2], . For a cycle , define and , with all sums in . Summing the even-incidence equations over column shows ; summing over row shows . Thus the two parities are independent of the chosen cuts. Each face boundary crosses every such cut zero or two times, so both parities vanish on .
The horizontal fundamental loop has , and the vertical fundamental loop has . Therefore no nonzero combination of these loops lies in . A basis of together with is an independent family of cycles, which is the dimension of from step 1.1. It is therefore a basis of , proving that the winding map identifies with . The dual square cellulation has the same coordinate graph and incidence counts, so the identical argument proves its two winding coordinates.
Finite toric-code Hamiltonian
Definition
For and couplings , the finite toric-code Hamiltonian on is
The energy unit is fixed by . This is a finite-volume operator defined from the stabilizer checks; its definition makes no claim about a material realization or a thermodynamic phase.
Facts & Assumptions
Given: The finite register and commuting checks from Toric star and plaquette checks.
Toric star and plaquette checks: every star and plaquette is a Hermitian involution supported on four edges.
Toric checks commute and have two global relations: all checks commute.
Verification
Each coefficient and is real, and each summand is self-adjoint by [F1]. Their finite sum is therefore self-adjoint.
The terms commute pairwise by [F2], so is a finite sum of commuting local check operators. Its locality follows from the four-edge supports in [F1].
Toric checks decompose into joint syndrome eigenspaces
Statement
Delete the star and plaquette from the full check list, and call the remaining checks . They are independent commuting Hermitian involutions. For each sign string , the operator
is the orthogonal projection onto the corresponding joint eigenspace; the are pairwise orthogonal and sum to the identity. The omitted checks are determined by the retained ones, so every nonzero syndrome sector has an even number of e defects and an even number of m defects.
Facts & Assumptions
Given: The periodic toric checks for and the physical Hilbert space on qubits.
Toric star and plaquette checks: every check is a Hermitian involution supported on four distinct edge qubits.
Toric checks commute and have two global relations: all checks commute, and the product of all stars and the product of all plaquettes are both .
Toric incidence maps have exactly one relation each: after deleting one fixed star and one fixed plaquette, the remaining star and face-boundary supports are independent within their respective X and Z coordinates.
Toric e and m syndromes: e and m defects are exactly the negative star and plaquette checks, respectively.
Proof
A product of retained checks with identity binary support must have zero X support and zero Z support separately. By [F3], this forces the selected star subset and plaquette subset both to be empty, so the retained checks are independent. By [F1] and [F2] they are commuting Hermitian involutions. For a retained check and sign , put . Direct expansion using and gives and . The checks commute, so their factors commute; hence is a self-adjoint idempotent, thus an orthogonal projection.
If , choose an index with . Then , so . Summing over all sign strings and distributing the finite product gives . Thus the ranges are pairwise orthogonal and their direct sum is the whole Hilbert space; zero projections are allowed.
By [F2], the omitted star is the product of all retained stars, so on its eigenvalue is the product of their signs; the product of the eigenvalues over all stars is therefore . A finite list of signs in has product exactly when it contains an even number of minus signs. The same argument for the omitted plaquette gives even parity for the negative plaquette checks. By [F4], these are the e and m defect parities. The projectors therefore decompose the register into the stated full-check syndrome sectors.
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.
The periodic toric code encodes two qubits
Statement
For the periodic toric checks with , the common eigenspace is a valid stabilizer code on qubits. Its independent check rank is , so its dimension is and it encodes two logical qubits.
Facts & Assumptions
Given: An integer , the periodic toric checks, and the common eigenspace convention.
Toric checks commute and have two global relations: the checks are commuting Hermitian involutions; the product of all stars and the product of all plaquettes are both .
Toric incidence maps have exactly one relation each: the star supports have rank and their only relation is the total star sum; the face boundaries have rank and their only relation is the total face sum.
Stabilizer code space: a stabilizer code is the common eigenspace of an abelian subgroup of Hermitian Pauli operators that does not contain .
Stabilizer syndromes and logical Pauli operators: the binary Pauli label records the X and Z support vectors separately.
Stabilizer projector and code dimension: an -qubit stabilizer subgroup with independent generators has a nonzero code space of dimension .
Periodic square cellulation of the torus: the periodic lattice has vertices and faces and edges.
Proof
Omit the fixed star and fixed plaquette . By [F2], the remaining stars are independent, and the remaining plaquettes are independent; [F1] expresses each omitted check as the product of the retained checks of its type. Their combined binary supports are independent because an X-support and a Z-support occupy separate coordinates by [F4]. Thus these checks generate all checks with independent generators.
Let be their generated subgroup. By [F1] it is abelian and generated by Hermitian Paulis. If a product of selected generators had zero binary label, its X-support and Z-support would each be zero by [F4]. The two independent families in [F2] then force both selected subsets to be empty, so that product is . In particular, no product is , and . Hence satisfies the stabilizer hypotheses in [F3].
There are edge qubits by [F6]. The dimension theorem [F5] therefore gives ; [F3] and step 2.1 ensure that its hypotheses hold, and step 1.1 supplies the independent rank. The code is nonzero and encodes exactly two qubits.
Noncontractible toric logical loops
Definition
On the periodic torus, define four Pauli representatives
The supports are the two fixed fundamental primal cycles. The supports are the dual cycles crossing them. These operators are called the toric logical loops. As verified below, each is a nontrivial logical Pauli class in the periodic toric code.
Facts & Assumptions
Given: The periodic toric checks and the four specified Pauli loop representatives.
Toric star and plaquette checks: stars are X on the four incident edges and plaquettes are Z on the four boundary edges.
Pauli commutator is symplectic pairing: a Pauli commutes with a check exactly when its binary symplectic pairing with that check is zero; for these pure X/Z checks this is the parity of the shared support.
Toric cycle classes are determined by two winding parities: the two primal fundamental loops have winding pairs and ; the two dual loops have the corresponding nonzero dual winding classes; a cycle is a boundary exactly when both winding parities vanish.
Toric incidence maps have exactly one relation each: the only star-support relation and the only face-boundary relation are their respective total sums.
The periodic toric code encodes two qubits: the common check eigenspace is nonzero and has dimension four.
Stabilizer syndromes and logical Pauli operators: logical Pauli classes are normalizer elements modulo scalar phases and stabilizers.
Periodic square cellulation of the torus: indices are modulo ; horizontal edges join consecutive vertices in their first coordinate and vertical edges join consecutive vertices in their second coordinate. The dual edges cross the corresponding primal edges and join the adjacent faces.
Toric checks commute and have two global relations: the product of all stars and the product of all plaquettes are identity, and all checks commute.
Verification
The supports of and close because their successive horizontal and vertical edges meet at vertices modulo , by [F7]. The supports of and close on the dual graph because the crossed edges join successive adjacent faces modulo , also by [F7]. By [F1] and [F2], a primal Z cycle commutes with every star and plaquette, and a dual X cycle commutes with every plaquette and star. Their winding pairs are nonzero by [F3], so none is a boundary. If a pure Z loop were in the stabilizer, its X support would be zero; by [F4] the selected star factors would either be empty or the full star family, and [F8] makes that full product . The loop would therefore be a product of plaquettes, contrary to its nonzero winding. Interchanging X and Z gives the same conclusion for the dual loops. Hence all four lie in and define nontrivial logical classes by [F6].
The code is nonzero by [F5], so these normalizer classes act on its four-dimensional code space. The four formulas fix the representatives whose pairings are calculated in the subsequent logical-algebra result.
Remarks
The commutation pairings for these fixed representatives are listed in Two anticommuting toric logical Pauli pairs. This is an orientation-only forward reference; the verification above does not depend on that theorem.
Exact finite-volume toric-code gap
Statement
For the finite toric-code Hamiltonian with , the ground space is the four-dimensional toric code space and the ground energy is . The exact spectral gap above it is .
Facts & Assumptions
Given: , fixed couplings , the Hamiltonian, the toric code space, and the joint-check syndrome labels.
Finite toric-code Hamiltonian: is the finite sum .
Toric checks decompose into joint syndrome eigenspaces: the check eigenvalue sectors are an orthogonal decomposition of the Hilbert space; each defect parity is even.
The periodic toric code encodes two qubits: the common eigenspace has dimension four.
Open toric strings have endpoint syndromes: a one-edge primal Z string creates exactly two e defects, and a one-edge dual X string creates exactly two m defects.
Toric e and m syndromes: e and m defect counts are the numbers of star and plaquette checks with eigenvalue .
Proof
On a joint-check eigenspace with negative star signs and negative plaquette signs, each star sum is and each plaquette sum is . By [F1] the Hamiltonian acts there by the scalar .
The all-positive sector is the code space by definition, is nonzero by [F3], and has energy . Every other nonzero sector has at least one defect species present; by [F2] its defect count is even, hence at least two. Step 1.1 then places its energy at least above .
If , choose a one-edge primal path and apply its Z string to a nonzero code vector. By [F4] the result is a nonzero joint eigenvector with exactly two e defects, so its energy is . If , use a one-edge dual path and its X string instead; it yields a nonzero joint eigenvector with exactly two m defects and energy . These states attain the lower bound from step 2.1, proving .
Exact indistinguishability in a contractible disk
Statement
Let be the periodic toric code and let be its orthogonal code projector. Let be a compact embedded disk in the torus with connected complement. Let be a set of edge qubits such that contains both the primal edge segment and its crossing dual edge segment for every . Then every operator supported on has scalar compression to the code:
for some .
Facts & Assumptions
Given: The periodic toric checks, a disk region as in the Statement, and an operator supported on its edge set .
Toric star and plaquette checks: stars are X on the four edges incident to a vertex and plaquettes are Z on the four edges in a face boundary.
Toric checks commute and have two global relations: the check operators commute.
Stabilizer code space: the code is their common eigenspace.
Stabilizer projector and code dimension: is the orthogonal projector onto the stabilizer code space. Together with [F3], this means every check satisfies .
Support and weight of an operator on a finite register: support on means, after the declared wire permutation, the operator is .
The Pauli matrices: the one-qubit matrix units are , , , and , by direct substitution.
The product basis is orthonormal and tensor dimensions multiply: ordered elementary computational-basis tensors form a basis of the finite register.
Tensor products of finitely many linear maps: tensor products of one-qubit maps act factor by factor on elementary tensors and extend linearly.
Pauli commutator is symplectic pairing: a Pauli commutes with every check exactly when its binary symplectic pairing with each check label is zero.
Stabilizer syndromes and logical Pauli operators: a phase-aware Pauli label records its X and Z supports separately; equal binary labels differ only by a scalar phase.
Finite square-lattice cycles are boundaries: every finite primal or dual cycle in the infinite square tiling is a sum of face boundaries.
A contractible toric disk lifts to the square grid: primal and dual cycles supported in lift to finite cycles in the infinite square tiling.
Periodic square cellulation of the torus: the quotient sends each unit face to the correspondingly indexed torus face and sends its four boundary edges to the displayed periodic edge boundary; the same incidence identity holds for translated dual squares and star supports. By linearity the quotient therefore sends finite primal and dual boundaries to torus boundaries.
The periodic toric code encodes two qubits: the code projector is nonzero.
Proof
The basis matrix units span all operators on the finite register by [F7]. Each is the tensor product of one-qubit matrix units by [F8]. The four identities in [F6] therefore express every global matrix unit as a linear combination of tensor Pauli operators. Hence tensor Paulis span the full operator space. If is supported on , apply the same expansion to in [F5] and tensor with identity outside ; every resulting Pauli term is supported on a subset of .
Consider one tensor Pauli from this expansion. If it anticommutes with a check , then the commutation fact [F2] and the common- code definition [F3] make the projector relation [F4] applicable. It gives , so . If commutes with all checks, write it as a phase times . By [F1] and [F9], has even incidence at every primal vertex and has even incidence at every dual vertex. They are therefore primal and dual cycles. Their supports lie among the qubits in ; by [F12] both cycles lift to finite square-grid cycles. By [F11], the lifted Z cycle is a sum of square face boundaries and the lifted X cycle is a sum of dual face boundaries. Projecting these finite face chains to the torus gives products of plaquette checks and star checks with exactly the original support labels. Indeed, the quotient is a chain map because the boundary of each unit face maps to the stated four-edge torus boundary by [F13]; repeated image faces cancel in pairs over . Thus differs by a scalar phase from a product of checks, by [F10], and is a scalar multiple of by [F3] and [F4].
Every term in the Pauli expansion of from step 1.1 has either zero compression or scalar compression by step 2.1. Summing these finitely many terms gives . The code projector is nonzero by [F14], so the scalar can be chosen as the sum of the scalar coefficients of those terms.
Remarks
The disk and support hypotheses are finite-cellulation statements. This theorem proves exact local indistinguishability for the specified toric stabilizer model; it makes no perturbation-stability or finite-temperature lifetime claim.
A single primal-dual crossing anticommutes
Statement
Let be a primal path and a dual path whose edge supports share exactly one physical qubit. Then their string Paulis anticommute: . This is the algebraic mutual e/m string sign.
Facts & Assumptions
Given: A primal Z string and a dual X string with exactly one shared edge-qubit.
Open toric strings have endpoint syndromes: is Z on the primal path edges and is X on the primal edge-qubits crossed by the dual path.
Pauli commutator is symplectic pairing: two Pauli strings commute with sign , where is the parity of their X/Z support overlap.
Proof
The X and Z supports meet at exactly one qubit, so their binary symplectic pairing is . By [F2], .
The sign is obtained from the finite Pauli commutator alone. No trajectory, Hamiltonian evolution, or dynamical exchange is part of the hypotheses, so the result asserts the mutual string algebra and no braiding experiment.
Remarks
The sign matches the conventional e/m mutual-statistics label for the toric code. The theorem proves the finite operator identity only.
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.
Toric code distance is L
Statement
For the periodic toric stabilizer code with , the minimum weight of a normalizer Pauli outside the scalar-phase stabilizer is .
Facts & Assumptions
Given: , the toric checks on edge qubits, their binary Pauli support convention, and their logical Pauli quotient.
Toric star and plaquette checks: stars are X on incident primal edges and plaquettes are Z on face-boundary edges.
Toric cycle classes are determined by two winding parities: a primal or dual cycle is a boundary exactly when both winding parities vanish; every nonboundary cycle has nonzero winding in one of the two coordinate directions.
Stabilizer syndromes and logical Pauli operators: the binary label of a Pauli records its X and Z supports, and normalizer Paulis are those commuting with all checks; logical classes are modulo phases and stabilizers.
Pauli commutator is symplectic pairing: a Pauli commutes with a check exactly when their binary symplectic pairing is zero.
Noncontractible toric logical loops: is a nontrivial logical Pauli supported on the horizontal edges .
Stabilizer distance: when the code encodes at least one qubit, distance is the minimum weight in .
Support and weight of an operator on a finite register: the weight of a Pauli is the number of edge qubits on which it is nonidentity.
The periodic toric code encodes two qubits: the code has dimension and encodes two qubits.
Proof
Let be a Pauli in the normalizer. Commuting with every star forces the Z-support to have even incidence at every primal vertex; commuting with every plaquette forces the X-support to have even incidence at every dual vertex, by [F1] and [F4]. Thus is a primal cycle and is a dual cycle.
If both cycles were boundaries, their supports would be products of plaquette and star checks respectively, so would be a scalar-phase stabilizer. Hence a nontrivial logical Pauli has at least one nonboundary cycle by [F2] and [F3]. That cycle has a nonzero winding parity. For a horizontal winding, each of the disjoint vertical cuts is crossed an odd number of times; for a vertical winding, each of the disjoint horizontal cuts is crossed an odd number of times. In either case its support contains at least one distinct edge from each cut, hence at least edges. The Pauli support contains the support of each nonzero X or Z chain, even when both bits occur on one qubit, so [F7] gives .
The operator from [F5] has exactly distinct edge factors and is logically nontrivial. Thus the set defining [F6] is nonempty and contains a weight- element. The code encodes two qubits by [F8], so [F6] applies; combining this upper bound with step 2.1 gives .
Two anticommuting toric logical Pauli pairs
Statement
The representatives of Noncontractible toric logical loops obey and commute within each Z pair and each X pair. Their four classes form a basis of the logical Pauli quotient of the two-qubit toric code.
Facts & Assumptions
Given: The four specified normalizer representatives and the two-qubit toric stabilizer code.
Noncontractible toric logical loops: uses the horizontal primal row , the vertical primal column , uses , and uses .
Pauli commutator is symplectic pairing: the commutator sign of two Pauli strings is , where is their binary symplectic pairing; for pure X/Z supports it is the overlap parity.
Stabilizer syndromes and logical Pauli operators: logical Paulis are classes in , with scalar phases and stabilizers identified.
The periodic toric code encodes two qubits: the code encodes two qubits.
Dimension of the logical Pauli quotient: an -qubit stabilizer code encoding qubits has a binary logical Pauli quotient of dimension .
A single primal-dual crossing anticommutes: primal Z and dual X strings with exactly one shared physical edge anticommute.
Proof
By [F1], and share only , while and share only . [F6] gives anticommutation for these equal-index pairs. The cross pairs and have disjoint physical-edge supports, so [F2] gives commutation for unequal indices. Two Z strings commute with one another and two X strings commute with one another because their factors have the same Pauli type.
Suppose a product , with , represented the identity class in [F3]. It would then commute with every normalizer representative. Commuting with in turn and using step 1.1 forces . Hence the four classes are independent.
By [F4] the code has , and [F5] gives logical quotient dimension . The four independent classes from step 2.1 therefore form a basis of that quotient.
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 .
Toric code corrects Pauli errors below half the distance
Statement
Let satisfy . Every finite Pauli error channel whose Kraus operators lie in the span of Pauli operators of weight at most has an exact recovery on the periodic toric code. In particular, every unknown Pauli error of weight at most is exactly correctable.
Facts & Assumptions
Given: The periodic toric code on qubits and an integer with .
Toric code distance is L: the code has stabilizer distance .
Stabilizer distance detection and correction: a finite stabilizer error channel with Kraus operators in the span of Paulis of weight at most has an exact recovery whenever .
The periodic toric code encodes two qubits: the toric code is a nonzero finite-dimensional stabilizer code.
Proof
By [F3], the common toric code space is nonzero and finite-dimensional; it is the stabilizer code defined by the commuting toric checks.
By [F1], its distance is . The hypothesis is therefore exactly the strict condition in [F2]. Applying [F2] gives one finite exact recovery for every error channel in the stated Pauli span, and hence for each Pauli error of weight at most . No circuit-level noisy procedure or hardware threshold is asserted.
A finite toric gap does not imply arbitrary perturbation stability
Statement
For each finite , the toric Hamiltonian has an exact positive gap, contractible-disk local indistinguishability, and a constant upper bound on a logical-string energy barrier. These unperturbed facts alone do not imply stability under arbitrary perturbations: the explicit global-projector perturbation closes the gap above the original code space and enlarges the ground space, where is the ground projector and . This does not refute stability theorems for sufficiently small local perturbations, and it makes no claim about thermal dynamics or a material realization.
Facts & Assumptions
Given: The finite periodic toric Hamiltonian with , couplings , and its code projector .
Exact finite-volume toric-code gap: the code is the ground space, the ground energy is , and the exact gap is .
Exact indistinguishability in a contractible disk: every operator supported in the stated contractible disk has scalar compression to the code.
A toric logical string has constant energy barrier: one noncontractible logical string has an unperturbed Pauli-path energy barrier at most .
The periodic toric code encodes two qubits: has rank four, while the full Hilbert space has dimension .
Finite toric-code Hamiltonian: is a finite self-adjoint operator on the -dimensional register.
Counterexample
Since [F1] identifies the code as the ground eigenspace of the self-adjoint finite operator [F5], its orthogonal projector commutes with : for in the code and , . The complement is nonzero by [F4], so the restriction of to it has a least eigenvalue. By [F1] that eigenvalue is . The other finite-volume properties [F2] and [F3] concern this same unperturbed Hamiltonian and code.
Define . The operator is a nonzero orthogonal projection by [F4], so is self-adjoint and . It vanishes on the code and subtracts from every eigenvalue on the orthogonal complement. The construction uses the global code projector and is not asserted to belong to a local perturbation class.
The code eigenvalue remains after adding . Every excited eigenvalue becomes , and a nonzero eigenspace with now also has eigenvalue . Thus the original code is no longer the full ground space: the energy gap above that four-dimensional code space is zero and the perturbed ground space is strictly larger. The finite unperturbed gap, local indistinguishability, and barrier statements therefore do not by themselves prove stability against arbitrary perturbations. No thermal evolution or material model was specified, so no memory-lifetime or physical-phase conclusion follows from these finite operator facts.
5 · Examples, counterexamples and false statements
None yet.