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 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 .
Depends on
- Toric star and plaquette checks
- Toric cycle classes are determined by two winding parities
- Noncontractible toric logical loops
- The periodic toric code encodes two qubits
- Stabilizer distance
- Stabilizer syndromes and logical Pauli operators
- Support and weight of an operator on a finite register
- Pauli commutator is symplectic pairing
Used by
Dependency tree · two levels
24 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)