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.
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.
Depends on
- Periodic square cellulation of the torus
- Toric star and plaquette checks
- Toric checks commute and have two global relations
- The periodic toric code encodes two qubits
- Finite square-lattice cycles are boundaries
- A contractible toric disk lifts to the square grid
- Stabilizer code space
- Stabilizer projector and code dimension
- Stabilizer syndromes and logical Pauli operators
- The Pauli matrices
- Finite registers and their ordered computational bases
- The product basis is orthonormal and tensor dimensions multiply
- Tensor products of finitely many linear maps
- Support and weight of an operator on a finite register
- Pauli commutator is symplectic pairing
Used by
Dependency tree · two levels
41 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)
- John Preskill, Quantum Computation, Chapter 9: Topological Quantum Computation (standard reference, not scraped)