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.
Dimension of the logical Pauli quotient
Statement
Let and let be an -qubit stabilizer group generated by independent commuting Hermitian Pauli checks with . Then the logical Pauli quotient is a binary vector space of dimension . Consequently, it is nontrivial exactly when the stabilizer code encodes at least one qubit.
Facts & Assumptions
Given: , a stabilizer subgroup , its binary symplectic label space, and the normalizer/logical quotient convention.
Binary Pauli label and quotient: quotienting phase-aware Paulis by the scalar center identifies their binary labels with .
Stabilizer labels form an isotropic space of the same rank: the label image of is an isotropic subspace of dimension .
Pauli commutator is symplectic pairing: a Pauli commutes with every element of exactly when its label belongs to .
Stabilizer syndromes and logical Pauli operators: the logical quotient is .
Stabilizer projector and code dimension: the code dimension is , so the encoded-qubit count is .
Binary symplectic form: is nondegenerate on and .
If and is a linear subspace of , then is finite-dimensional, , and if and only if : every linearly independent subset of a finite-dimensional subspace extends to a basis, with no choice principle.
Rank-nullity: : the dimension of a finite-dimensional domain is the sum of the kernel dimension and image dimension.
The dual family of a finite basis is a basis of the dual space, with the same dimension: the algebraic dual of a finite-dimensional space has the same dimension.
Proof
By [F1], phase classes of Paulis are the vectors of . By [F2] the stabilizer labels form an -dimensional subspace . The commutator criterion [F3] identifies the normalizer labels exactly with . The scalar phases label zero, so the subgroup has image . Therefore is identified with .
The nondegenerate pairing [F6] gives an injective map , . Restricting functionals from to is onto: extend a basis of to one of by [F7], then extend each functional by assigning zero to the added basis vectors. Since by [F9], injectivity and rank-nullity [F8] make onto. Thus the composite is onto; its codomain has dimension by [F9], and its kernel is . By [F8], .
Since , the quotient dimension is . By [F5], is the number of encoded qubits; hence this dimension is , which is zero exactly when .
Depends on
- Finite-dimensional vector space, and its dimension $\dim_F V$; infinite-dimensional means having no finite basis
- Binary Pauli label and quotient
- Binary symplectic form
- Stabilizer code space
- Stabilizer subgroup
- Stabilizer syndromes and logical Pauli operators
- Stabilizer labels form an isotropic space of the same rank
- If $\dim_F V = n$ and $U$ is a linear subspace of $V$, then $U$ is finite-dimensional, $\dim_F U \le n$, and $\dim_F U = n$ if and only if $U = V$
- The dual family of a finite basis is a basis of the dual space, with the same dimension
- Binary Pauli quotient isomorphism
- Pauli commutator is symplectic pairing
- Stabilizer projector and code dimension
- Rank-nullity: $\dim_F V=\operatorname{nullity}T+\operatorname{rank}T$
Used by
- Stabilizer distance Definition
- Two anticommuting toric logical Pauli pairs Theorem
Dependency tree · two levels
60 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
- John Preskill, Quantum Computation, Chapter 7: Quantum Error Correction (standard reference, not scraped)
- Ronald de Wolf, Quantum Computing: Lecture Notes, §20.1 (standard reference, not scraped)