The Setting
A product projection transported through a bounded-depth quantum circuit can connect sectors with different numbers of local mismatches. Lemma 5 concerns transitions from a low mismatch sector to a high one, both measured relative to product projection data.
On total qubits, a word assigns a classical bit to each wire.✦ A quantum operator is a complex matrix indexed by pairs of words✦; a single-qubit operator is a complex matrix indexed by pairs of classical bits.✦ All operator norms below are Euclidean operator norms.
For a one-qubit vector , the outer product is the single-qubit operator with entries given by (1). (1)✦ For single-qubit operators , the tensor product is the quantum operator whose entries are specified by (2). (2)✦
Mismatch Sectors and Circuit Localization
Product projection data on qubits consist of a support and local vectors , normalized on : for every .✦ Writing and denoting the single-qubit identity operator by , the product projection and the mismatch pattern projection for a set of wires are defined in (3). (3) For product projection data on qubits and a real cutoff , the high spectral projection is the sum of the mismatch pattern projections with at least mismatches, and the low spectral projection is its complement, as in (4). (4)
For a nonnegative integer , the enlarged reflection-circuit class on qubits is the class of operators of depth at most defined recursively from local layers and reflection layers. At depth zero, its members are local-layer matrices. At depth , membership means that , where , is a reflection-layer matrix and is a local-layer matrix. The rightmost matrix acts first, and identity layers are allowed.
For operators and on qubits, the conjugate of by is the operator , where denotes the adjoint.✦ For real exponents , the uniform localization assertion means that there is a threshold , depending only on , such that (5) holds for every , every and all product projection data on qubits. (5)✦
The Claim
Theorem 1 (Lemma 5). Let , let be product projection data on qubits, and let be an operator on those qubits. Take real numbers and with . Suppose that for every product projection datum on qubits. The finite propagation bound is (6), where is the least nonnegative integer at least . (6)✦
Fix a natural depth and assume for every pair of real exponents . Let and . Then, for all sufficiently large , uniformly over every and all product projection data on qubits, the low propagation estimate is (7). (7)✦
What Is Checked
The finite estimate is stated over arbitrary operators and product projection data on qubits; the asymptotic estimate is stated over the enlarged reflection-circuit class under the family of uniform localization assertions at depth .