MerLean-example

13 Rem 8: Freedom in Deformed Checks

The deformed code is uniquely determined as a codespace, but there is freedom in choosing the generating set: the Gauss’s law checks \(A_v\) are fixed, the flux checks \(B_p\) can use any generating set of cycles for \(G\), and the deformed checks \(\tilde{s}_j\) have freedom in choosing the paths \(\gamma _j\). Different choices of \(\gamma \) give equivalent codes: if \(\gamma \) and \(\gamma '\) both satisfy \(\partial \gamma = \partial \gamma ' = S_Z(s)|_V\), then \(\tilde{s}(\gamma ') = \tilde{s}(\gamma ) \cdot B_c\) for some product of flux operators \(B_c\). In particular, the difference \(\gamma + \gamma '\) lies in \(\ker (\partial )\) (the cycle space).

13.1 Path Difference Lies in Cycle Space

Theorem 228 Path Difference in Kernel of Boundary

Let \(G\) be a simple graph on vertices \(V\), and let \(s\) be a Pauli operator on \(V\). If \(\gamma , \gamma ' : E(G) \to \mathbb {Z}/2\mathbb {Z}\) both satisfy the boundary condition \(\partial \gamma = S_Z(s)|_V\) and \(\partial \gamma ' = S_Z(s)|_V\), then

\[ \partial (\gamma + \gamma ') = 0. \]
Proof

Since the boundary map \(\partial \) is linear, we have \(\partial (\gamma + \gamma ') = \partial \gamma + \partial \gamma '\). Unfolding the boundary condition, \(\partial \gamma = S_Z(s)|_V\) and \(\partial \gamma ' = S_Z(s)|_V\). Thus \(\partial (\gamma + \gamma ') = S_Z(s)|_V + S_Z(s)|_V\). By extensionality, for each vertex \(v\), this equals \(S_Z(s)|_V(v) + S_Z(s)|_V(v) = 0\) since we work over \(\mathbb {Z}/2\mathbb {Z}\) where \(a + a = 0\).

Theorem 229 Path Difference in Kernel (LinearMap.ker Version)

Under the same hypotheses as above, \(\gamma + \gamma ' \in \ker (\partial _G)\).

Proof

By the characterization of the kernel as \(\{ x \mid \partial x = 0\} \), this follows directly from the fact that \(\partial (\gamma + \gamma ') = 0\).

13.2 Pure-Z Edge Operator

Definition 230 Pure-Z Edge Operator
#

Given an edge vector \(\delta : E(G) \to \mathbb {Z}/2\mathbb {Z}\), the pure-Z edge operator is defined as

\[ \operatorname {pureZEdgeOp}(\delta ) := \widetilde{\operatorname {ext}}(\mathbf{1}, \delta ), \]

i.e., the deformed operator extension of the identity operator \(\mathbf{1}\) with edge-path \(\delta \). This operator acts as the identity on all vertex qubits and applies \(Z_e\) on edge qubit \(e\) whenever \(\delta (e) = 1\).

Theorem 231 Pure-Z Edge Operator Is Pure Z-Type

For any edge vector \(\delta \), the pure-Z edge operator has no X-support:

\[ \operatorname {xVec}(\operatorname {pureZEdgeOp}(\delta )) = 0. \]
Proof

By extensionality, we verify for each qubit \(q\) in the extended system \(V \oplus E(G)\). For vertex qubits \(q = \operatorname {inl}(v)\), the X-component is \(0\) by definition of \(\operatorname {deformedOpExt}\). For edge qubits \(q = \operatorname {inr}(e)\), the X-component is also \(0\) by definition. Hence \(\operatorname {xVec} = 0\).

Theorem 232 Pure-Z Edge Operator Is Self-Inverse

For any edge vector \(\delta \),

\[ \operatorname {pureZEdgeOp}(\delta ) \cdot \operatorname {pureZEdgeOp}(\delta ) = \mathbf{1}. \]
Proof

This follows directly from the fact that \(\widetilde{\operatorname {ext}}(P, \gamma ) \cdot \widetilde{\operatorname {ext}}(P, \gamma ) = \mathbf{1}\) applied with \(P = \mathbf{1}\) and \(\gamma = \delta \).

13.3 Deformed Checks Differ by a Pure-Z Edge Operator

Theorem 233 Deformed Check Difference Is Pure-Z on Edges

For any Pauli operator \(s\) on \(V\) and edge-paths \(\gamma , \gamma ' : E(G) \to \mathbb {Z}/2\mathbb {Z}\),

\[ \tilde{s}(\gamma ') = \tilde{s}(\gamma ) \cdot \operatorname {pureZEdgeOp}(\gamma + \gamma '). \]
Proof

Unfolding the definitions of \(\tilde{s}\) and \(\operatorname {pureZEdgeOp}\), we apply the multiplication law for deformed operator extensions: \(\widetilde{\operatorname {ext}}(s, \gamma ) \cdot \widetilde{\operatorname {ext}}(\mathbf{1}, \gamma + \gamma ') = \widetilde{\operatorname {ext}}(s \cdot \mathbf{1}, \gamma + (\gamma + \gamma '))\). Since \(s \cdot \mathbf{1} = s\) and \(\gamma + (\gamma + \gamma ') = \gamma '\) (the latter because \(\gamma + \gamma = 0\) in \(\mathbb {Z}/2\mathbb {Z}\), so \(\gamma + (\gamma + \gamma ') = (\gamma + \gamma ) + \gamma ' = 0 + \gamma ' = \gamma '\)), we obtain \(\widetilde{\operatorname {ext}}(s, \gamma ')\). The result follows by symmetry.

Theorem 234 Deformed Check Difference – Alternate Form

Equivalently, \(\tilde{s}(\gamma ') = \tilde{s}(\gamma ) \cdot \operatorname {pureZEdgeOp}(\gamma ' + \gamma )\).

Proof

Since addition in \(\mathbb {Z}/2\mathbb {Z}\) is commutative, \(\gamma ' + \gamma = \gamma + \gamma '\). The result then follows from the previous theorem.

13.4 The Difference Operator Commutes with All Checks

Theorem 235 Pure-Z Edge Operator Commutes with Gauss’s Law

If \(\delta : E(G) \to \mathbb {Z}/2\mathbb {Z}\) satisfies \(\partial \delta = 0\), then for every vertex \(v \in V\),

\[ [\operatorname {pureZEdgeOp}(\delta ),\; A_v] = 0, \]

i.e., the pure-Z edge operator commutes with the Gauss’s law operator at \(v\).

Proof

We first show that \(\delta \) satisfies the boundary condition for the identity operator: since \(\partial \delta = 0\) and \(S_Z(\mathbf{1})|_V = 0\) (the identity has no Z-support on vertices), we have \(\partial \delta = S_Z(\mathbf{1})|_V\). The result then follows from the theorem that \(\widetilde{\operatorname {ext}}(P, \gamma )\) commutes with \(A_v\) whenever the boundary condition holds.

Theorem 236 Pure-Z Edge Operator Commutes with Flux

For any edge vector \(\delta \) and any cycle index \(p\),

\[ [\operatorname {pureZEdgeOp}(\delta ),\; B_p] = 0, \]

i.e., the pure-Z edge operator commutes with the flux operator \(B_p\).

Proof

Expanding the symplectic inner product and splitting the sum over vertices and edges: for the vertex sum, each term vanishes because both operators have zero X-component and zero Z-component on vertices (the pure-Z edge operator has identity on vertices, and the flux operator is pure Z on edges with zero X on vertices). For the edge sum, each term vanishes because both operators have X-component equal to zero on edges (the pure-Z edge operator has \(\operatorname {xVec} = 0\) everywhere, and the flux operator is pure Z-type). Hence the symplectic inner product is zero.

For any edge vector \(\delta \), any deformed code data, and any check index \(j\),

\[ [\operatorname {pureZEdgeOp}(\delta ),\; \tilde{s}_j] = 0, \]

i.e., the pure-Z edge operator commutes with every deformed original check.

Proof

Unfolding the definitions of \(\operatorname {deformedOriginalChecks}\) and \(\operatorname {deformedCheck}\), we expand the symplectic inner product and split the sum over vertices and edges. For the vertex sum: the pure-Z edge operator has \(\operatorname {xVec} = 0\) and \(\operatorname {zVec} = 0\) on vertices, so each vertex term vanishes. For the edge sum: the deformed operator extension has \(\operatorname {xVec} = 0\) on edges, and the pure-Z edge operator also has \(\operatorname {xVec} = 0\) on edges, so each edge term vanishes. Hence the total symplectic inner product is zero.

13.5 Different Paths Yield the Same Stabilizer Group

Let \(\operatorname {data}\) and \(\operatorname {data}'\) be two instances of \(\operatorname {DeformedCodeData}\) (with potentially different edge-paths). For each check index \(j\), there exists a Pauli operator \(B\) on the extended system such that:

  1. \(\tilde{s}_j(\gamma '_j) = \tilde{s}_j(\gamma _j) \cdot B\),

  2. \(\operatorname {xVec}(B) = 0\) (i.e., \(B\) is pure Z-type),

  3. \(\partial (\gamma _j + \gamma '_j) = 0\) (i.e., the path difference lies in the cycle space).

Proof

We take \(B = \operatorname {pureZEdgeOp}(\gamma _j + \gamma '_j)\). Then:

  1. The equality \(\tilde{s}_j(\gamma '_j) = \tilde{s}_j(\gamma _j) \cdot B\) follows from the deformed check difference theorem.

  2. The pure Z-type property \(\operatorname {xVec}(B) = 0\) follows from the fact that pure-Z edge operators have no X-support.

  3. The boundary condition \(\partial (\gamma _j + \gamma '_j) = 0\) follows from the path difference kernel theorem, using the boundary conditions \(\partial \gamma _j = S_Z(s_j)|_V\) and \(\partial \gamma '_j = S_Z(s_j)|_V\) stored in both data and data\('\).

Theorem 239 Different Paths Produce the Same Code

For any two instances \(\operatorname {data}\) and \(\operatorname {data}'\) of \(\operatorname {DeformedCodeData}\) and any check index \(j\):

\[ \tilde{s}_j^{\operatorname {data}'} = \tilde{s}_j^{\operatorname {data}} \cdot \operatorname {pureZEdgeOp}(\gamma _j + \gamma '_j). \]
Proof

This follows directly from the deformed check difference theorem applied to the original check \(s_j\) with edge-paths \(\gamma _j\) (from data) and \(\gamma '_j\) (from data\('\)).

Theorem 240 Path Differences Lie in the Cycle Space

For any two instances \(\operatorname {data}\) and \(\operatorname {data}'\) of \(\operatorname {DeformedCodeData}\) and any check index \(j\):

\[ \gamma _j + \gamma '_j \in \ker (\partial _G). \]
Proof

This follows from the path difference kernel membership theorem, using the boundary conditions stored in data and data\('\).

13.6 Gauss’s Law and Flux Checks Are Fixed

Theorem 241 Gauss’s Law Checks Are Independent of Path Choice

For any two instances \(\operatorname {data}\) and \(\operatorname {data}'\) of \(\operatorname {DeformedCodeData}\) and any vertex \(v \in V\):

\[ \operatorname {deformedCodeChecks}(\operatorname {data}, \operatorname {gaussLaw}(v)) = \operatorname {deformedCodeChecks}(\operatorname {data}', \operatorname {gaussLaw}(v)). \]
Proof

This holds by reflexivity: the Gauss’s law checks \(A_v\) do not depend on the edge-path data at all, so both sides are definitionally equal.

Theorem 242 Flux Checks Are Independent of Path Choice

For any two instances \(\operatorname {data}\) and \(\operatorname {data}'\) of \(\operatorname {DeformedCodeData}\) and any cycle index \(p\):

\[ \operatorname {deformedCodeChecks}(\operatorname {data}, \operatorname {flux}(p)) = \operatorname {deformedCodeChecks}(\operatorname {data}', \operatorname {flux}(p)). \]
Proof

This holds by reflexivity: the flux checks \(B_p\) do not depend on the edge-path data at all, so both sides are definitionally equal.

13.7 Pure-Z Edge Operator Commutes with All Checks

Theorem 243 Pure-Z Edge Operator Commutes with All Deformed Code Checks

Let \(\delta : E(G) \to \mathbb {Z}/2\mathbb {Z}\) satisfy \(\partial \delta = 0\), and let \(\operatorname {data}\) be any deformed code data. Assume that for every cycle \(c\) and vertex \(v\), the number of edges in \(c\) incident to \(v\) is even. Then for every check index \(a \in V \sqcup C \sqcup J\):

\[ [\operatorname {pureZEdgeOp}(\delta ),\; \operatorname {allChecks}(a)] = 0. \]
Proof

We proceed by cases on the check index \(a\):

  • Case \(a = \operatorname {gaussLaw}(v)\): The result follows from the theorem that the pure-Z edge operator commutes with Gauss’s law operators when \(\partial \delta = 0\).

  • Case \(a = \operatorname {flux}(p)\): The result follows from the theorem that the pure-Z edge operator commutes with flux operators.

  • Case \(a = \operatorname {deformed}(j)\): The result follows from the theorem that the pure-Z edge operator commutes with deformed original checks.

13.8 Corollaries

Let \(s\) be a Pauli operator on \(V\), and let \(\gamma , \gamma '\) be edge-paths both satisfying the boundary condition for \(s\). Then

\[ [\tilde{s}(\gamma ),\; \tilde{s}(\gamma ')] = 0, \]

i.e., the two deformed checks commute.

Proof

Unfolding the definition of deformed check, we compute the symplectic inner product by splitting the sum over vertices and edges. For the vertex sum: both deformed checks have the same X-vector and Z-vector on vertices (both coming from \(s\)), so the contribution is \(\sum _{v \in V} (s^X_v \cdot s^Z_v + s^Z_v \cdot s^X_v)\). Since multiplication in \(\mathbb {Z}/2\mathbb {Z}\) is commutative, each term is \(s^X_v \cdot s^Z_v + s^X_v \cdot s^Z_v = 0\) (as \(a + a = 0\) in characteristic 2). For the edge sum: both deformed operator extensions have X-component equal to \(0\) on edges, so each term \(0 \cdot z + z' \cdot 0 = 0\). Hence the total symplectic inner product is zero.

Theorem 245 Recovering a Deformed Check from Another

For any Pauli operator \(s\) and edge-paths \(\gamma , \gamma '\):

\[ \tilde{s}(\gamma ) = \tilde{s}(\gamma ') \cdot \operatorname {pureZEdgeOp}(\gamma ' + \gamma ). \]
Proof

This is the deformed check difference theorem applied with the roles of \(\gamma \) and \(\gamma '\) swapped: \(\tilde{s}(\gamma ) = \tilde{s}(\gamma ') \cdot \operatorname {pureZEdgeOp}(\gamma ' + \gamma )\).