11 Rem 10: Parallelization of Gauging Measurements
This chapter formalizes the conditions under which gauging measurements can be applied to multiple logical operators in parallel. Two conditions are required: (1) commutativity—no pair of logical operators acts by different non-trivial Paulis on any common qubit, and (2) bounded overlap—at most a constant number of logical operators share support on any single qubit. Additionally, a space-time tradeoff is established: one can perform \(2m-1\) measurements of equivalent logical operators in parallel for \(d/m\) rounds, using majority vote to determine the classical outcome.
Two Pauli types \(p, q \in \mathrm{StabPauliType}\) are compatible if they do not conflict on the same qubit. A conflict occurs when one is purely \(X\)-type and the other is purely \(Z\)-type. Formally,
\(X\) and \(Z\) are not compatible: \(\neg \, \mathrm{compatible}(X, Z)\).
By simplification using the definition of compatibility, this is immediate since \(X = X \land Z = Z\) holds.
\(Z\) and \(X\) are not compatible: \(\neg \, \mathrm{compatible}(Z, X)\).
By simplification using the definition of compatibility, this is immediate since \(Z = Z \land X = X\) holds.
Every Pauli type is compatible with itself: for all \(p \in \mathrm{StabPauliType}\), \(\mathrm{compatible}(p, p)\).
We perform case analysis on \(p\). In each case (\(I\), \(X\), \(Y\), \(Z\)), simplification using the definition of compatibility shows that neither conflicting conjunction holds.
The identity type is compatible with any Pauli type: for all \(p\), \(\mathrm{compatible}(I, p)\).
By simplification using the definition of compatibility, since \(I \neq X\) and \(I \neq Z\).
Any Pauli type is compatible with the identity: for all \(p\), \(\mathrm{compatible}(p, I)\).
By simplification using the definition of compatibility, since \(I \neq X\) and \(I \neq Z\).
Compatibility is symmetric: for all Pauli types \(p\) and \(q\),
By unfolding the definition of compatibility, the result follows by propositional tautology: the two conjunctions simply swap the roles of \(p\) and \(q\).
Two Pauli operators \(P, Q \in \mathrm{PauliOp}(n)\) are Pauli-compatible if for every qubit \(i \in \mathrm{Fin}(n)\), their Pauli types at position \(i\) are compatible:
If \(P\) and \(Q\) are Pauli-compatible, then \(Q\) and \(P\) are Pauli-compatible.
Let \(i\) be an arbitrary qubit index. By hypothesis, \(\mathrm{compatible}(P_i, Q_i)\) holds. Applying the symmetry of compatibility (Lemma 274), we obtain \(\mathrm{compatible}(Q_i, P_i)\).
For any Pauli operator \(P\), the identity operator is Pauli-compatible with \(P\).
Let \(i\) be an arbitrary qubit index. The identity operator has Pauli type \(I\) at every position, and \(I\) is compatible with any Pauli type by Lemma 272.
For any Pauli operator \(P\), \(P\) is Pauli-compatible with the identity operator.
Let \(i\) be an arbitrary qubit index. The identity operator has Pauli type \(I\) at every position, and any Pauli type is compatible with \(I\) by Lemma 273.
Let \(C\) be a stabilizer code. A finite set of logical operators \(\mathcal{L} \subseteq \mathrm{LogicalOp}(C)\) satisfies the commutativity condition if every pair of operators in \(\mathcal{L}\) is Pauli-compatible:
For any logical operator \(L\), the singleton set \(\{ L\} \) satisfies the commutativity condition.
Let \(L_1 \in \{ L\} \) and \(L_2 \in \{ L\} \). Since both are singletons, \(L_1 = L\) and \(L_2 = L\). Substituting, for any qubit \(i\), we need \(\mathrm{compatible}(L_i, L_i)\), which holds by self-compatibility (Lemma 271).
The overlap degree of a qubit \(i\) with respect to a set of logical operators \(\mathcal{L}\) is the number of operators in \(\mathcal{L}\) whose support contains \(i\):
A set of logical operators \(\mathcal{L}\) satisfies the bounded overlap condition with bound \(k\) if for every qubit \(i\), the overlap degree is at most \(k\):
This condition is required to maintain the LDPC property during code deformation.
If \(k \ge |\mathcal{L}|\), then the bounded overlap condition with bound \(k\) is trivially satisfied.
Let \(i\) be an arbitrary qubit. We unfold the definition of overlap degree. Then:
where the first inequality holds because filtering a finite set can only reduce its cardinality, and the second inequality is our hypothesis.
For any logical operator \(L\), the singleton set \(\{ L\} \) satisfies the bounded overlap condition with bound \(1\).
Let \(i\) be an arbitrary qubit. We unfold the definition of overlap degree. The filtered set is a subset of \(\{ L\} \), so its cardinality is at most \(|\{ L\} | = 1\).
A set of logical operators is parallelizable if it satisfies both conditions for parallel gauging measurement. A ParallelizableLogicals structure for a stabilizer code \(C\) consists of:
A finite set \(\mathcal{L}\) of logical operators (the operators to measure in parallel),
An overlap bound \(k \in \mathbb {N}\) (must be constant to maintain the LDPC property),
A proof that \(\mathcal{L}\) satisfies the commutativity condition,
A proof that \(\mathcal{L}\) satisfies the bounded overlap condition with bound \(k\).
The number of logical operators being measured in parallel is \(|\mathcal{L}|\).
For any logical operator \(L\), \(\mathrm{numLogicals}(\mathrm{singleton}(L)) = 1\).
This follows directly from the fact that \(|\{ L\} | = 1\).
Two logical operators \(L_1\) and \(L_2\) have disjoint support if their operator supports are disjoint:
A set of logical operators \(\mathcal{L}\) has pairwise disjoint support if every pair of distinct operators has disjoint support:
If two logical operators \(L_1\) and \(L_2\) have disjoint support, then they are Pauli-compatible.
Let \(i\) be an arbitrary qubit index. We consider two cases. If \(i \in \mathrm{support}(L_1.\mathrm{op})\), then by disjointness \(i \notin \mathrm{support}(L_2.\mathrm{op})\). Unfolding the definition of support, \(L_2.\mathrm{op}\) has Pauli type \(I\) at position \(i\). By simplification with \(h_2\), the identity is compatible on the right (Lemma 273). If \(i \notin \mathrm{support}(L_1.\mathrm{op})\), then \(L_1.\mathrm{op}\) has Pauli type \(I\) at position \(i\), and compatibility follows from the identity being compatible on the left (Lemma 272).
If \(\mathcal{L}\) has pairwise disjoint support, then \(\mathcal{L}\) satisfies the commutativity condition.
Let \(L_1 \in \mathcal{L}\) and \(L_2 \in \mathcal{L}\). We consider whether \(L_1 = L_2\). If \(L_1 = L_2\), then after substitution, for any qubit \(i\) we need \(\mathrm{compatible}(L_{1,i}, L_{1,i})\), which holds by self-compatibility. If \(L_1 \ne L_2\), then by pairwise disjointness they have disjoint support, and the result follows from Lemma 291.
If \(\mathcal{L}\) has pairwise disjoint support, then the bounded overlap condition holds with bound \(1\).
Let \(i\) be an arbitrary qubit. We unfold the definition of overlap degree. Suppose for contradiction that the overlap degree exceeds \(1\). Then \(1 {\lt} |\{ L \in \mathcal{L} \mid i \in \mathrm{support}(L.\mathrm{op})\} |\). By the pigeonhole principle (one-lt-card), there exist distinct \(L_1, L_2\) in the filtered set with \(L_1 \ne L_2\). Extracting membership from the filter, both \(L_1\) and \(L_2\) have \(i\) in their support and belong to \(\mathcal{L}\). By pairwise disjointness, \(\mathrm{support}(L_1.\mathrm{op}) \cap \mathrm{support}(L_2.\mathrm{op}) = \emptyset \). But \(i\) belongs to both supports, hence \(i \in \mathrm{support}(L_1.\mathrm{op}) \cap \mathrm{support}(L_2.\mathrm{op})\), contradicting the intersection being empty.
For codes supporting many disjoint logical representatives, parallel logical gates are possible. Formally, if \(\mathcal{L}\) has pairwise disjoint support, then there exists a \(P : \mathrm{ParallelizableLogicals}(C)\) with \(P.\mathrm{logicals} = \mathcal{L}\) and \(P.\mathrm{overlapBound} = 1\).
We take \(P = \mathrm{fromDisjoint}(\mathcal{L}, h)\). By construction, \(P.\mathrm{logicals} = \mathcal{L}\) and \(P.\mathrm{overlapBound} = 1\), both holding by reflexivity.
A space-time tradeoff for gauging measurement consists of:
A code distance \(d \in \mathbb {N}\),
A tradeoff parameter \(m \in \mathbb {N}\) with \(m {\gt} 0\),
A proof that \(m \mid d\).
One performs \(2m - 1\) measurements of equivalent logical operators in parallel, for \(d/m\) rounds, and takes a majority vote to determine the classical outcome.
The number of parallel measurements of equivalent logical operators is \(2m - 1\).
The number of measurement rounds is \(d / m\).
When \(m \mid d\), we have \(\mathrm{numRounds} \cdot m = d\).
This follows directly from \(\mathrm{Nat.div\_ mul\_ cancel}\) applied to the divisibility hypothesis \(m \mid d\).
The majority vote threshold is \(m\): at least \(m\) out of \(2m - 1\) measurements must agree.
The majority threshold equals the number of parallel measurements plus one, divided by two:
We unfold the definitions of majority threshold and number of parallel measurements. Using the hypothesis \(m {\gt} 0\), the equality \(m = ((2m - 1) + 1) / 2\) follows by integer arithmetic (omega).
The total number of logical measurements across all rounds is
The total measurements equal \((2m - 1) \cdot (d / m)\).
This holds by definitional equality (reflexivity).
The minimal space overhead tradeoff sets \(m = d\), yielding \(2d - 1\) parallel measurements in a single round. This is constructed with distance \(d\), parameter \(m = d\), positivity from \(d {\gt} 0\), and divisibility from \(d \mid d\).
For the minimal space tradeoff, \(\mathrm{numParallelMeasurements} = 2d - 1\).
This holds by definitional equality (reflexivity).
For the minimal space tradeoff, \(\mathrm{numRounds} = 1\).
This follows from \(\mathrm{Nat.div\_ self}\) applied to \(d {\gt} 0\), giving \(d / d = 1\).
The minimal time overhead tradeoff sets \(m = 1\), yielding \(1\) parallel measurement over \(d\) rounds. This is constructed with distance \(d\), parameter \(m = 1\), positivity from \(1 {\gt} 0\), and divisibility from \(1 \mid d\).
For the minimal time tradeoff, \(\mathrm{numParallelMeasurements} = 1\).
This holds by definitional equality (reflexivity).
For the minimal time tradeoff, \(\mathrm{numRounds} = d\).
This follows from \(\mathrm{Nat.div\_ one}\), giving \(d / 1 = d\).
Gauging measurement can be applied to multiple logical operators in parallel if and only if both conditions are satisfied. Formally, for a stabilizer code \(C\), a finite set \(\mathcal{L}\) of logical operators, and a bound \(k\):
We prove both directions separately.
Forward direction: Assume both conditions hold, i.e., we have \(h_{\mathrm{comm}} : \mathrm{CommutativityCondition}(\mathcal{L})\) and \(h_{\mathrm{bound}} : \mathrm{BoundedOverlapCondition}(\mathcal{L}, k)\). We construct \(P\) as the structure \((\mathcal{L}, k, h_{\mathrm{comm}}, h_{\mathrm{bound}})\). Then \(P.\mathrm{logicals} = \mathcal{L}\) and \(P.\mathrm{overlapBound} = k\), both by reflexivity.
Backward direction: Assume there exists \(P\) with \(P.\mathrm{logicals} = \mathcal{L}\) and \(P.\mathrm{overlapBound} = k\). Substituting, the commutativity and bounded overlap conditions are exactly the fields \(P.\mathrm{commutativity}\) and \(P.\mathrm{boundedOverlap}\).
For any space-time tradeoff \(T\), the number of parallel measurements \(2m - 1\) is odd.
We unfold the definition of \(\mathrm{numParallelMeasurements}\). Using \(m {\gt} 0\), we exhibit the witness \(m - 1\) satisfying \(2m - 1 = 2(m - 1) + 1\), which holds by integer arithmetic (omega).
The majority vote always gives a definite outcome. Formally, for any space-time tradeoff \(T\):
This follows directly from \(\mathrm{Nat.odd\_ iff.mp}\) applied to the fact that the number of parallel measurements is odd (Lemma 311).