Manuscript Oai212-A@1 · Oai212-A.tex · lemma · 79323841
Lemma: Exact support update
Bridge 1 supplement: a standard random-circuit comparison · lines 724–749 · proof included or linked
Oai212-A@1#lem:clifford-update
At an edge event, a pair of empty sites remains empty. If at least one endpoint is occupied, the new two-site support has probabilities
These probabilities do not depend on the incoming nonzero pair.
Proof. Clifford conjugation acts transitively on nonidentity Pauli operators. One elementary justification is to use single-qubit Cliffords to turn nonidentity tensor factors into factors, then CNOTs and swaps to reduce their product to one factor. Inverting such reductions maps any nonidentity Pauli to any other. Uniform Clifford sampling therefore gives a uniform nonidentity two-site Pauli.
There are such Paulis. The support counts are , , and , respectively. Divide by .
Displayed formulas in this passage
unlabeled · line 729
Nearby in this section
- section: Bridge 1 supplement: a standard random-circuit comparison
- assumption: Model specification: Poisson random-Clifford circuit
- section: Bridge 1 supplement: a standard random-circuit comparison
- theorem: Theorem: Explicit finite-volume FPP comparison
- corollary: Corollary: A controlled large-dimension scaling
- remark: Remark: The order of limits is essential