The Setting
The finite-scale induction concerns exponentially small transition amplitudes between sectors specified by local qubit states, with cutoffs that are powers of the total number of qubits.
A classical bit is an element of ✦, and a word assigns a bit to each wire.✦ A quantum operator on qubits is a complex matrix indexed by these words✦; a single-qubit operator is a complex matrix indexed by bits.✦ All operator norms are Euclidean operator norms. The adjoint is denoted by , and conjugation of an operator by means .✦
For a one-qubit vector , its outer product is the single-qubit operator in (1); for a family of single-qubit operators, its tensor product is the quantum operator on qubits with the entries given there. (1)
Product projection data on qubits consist of a support and local vectors , normalized on that support as in (2). (2)✦ Write and let denote the identity on the relevant space. The mismatch pattern projection , for a set of wire indices, is the tensor product in (3). (3)✦
For product projection data on qubits, the product projection is the projection that selects the prescribed local vectors on the support of .✦ For product projection data on qubits and a real cutoff , the high spectral projection is the sum of the mismatch pattern projections of with at least mismatches, and the low spectral projection is the complementary projection, as defined in (4). (4)
For product projection data on qubits, the spectral functional calculus is the map that sends a function to the operator in (5). For a real polynomial , the operator and the real number , its weighted coefficient cost, are given in the same equation; write for its degree, with . (5)
Uniform Localization
A local-layer matrix is a tensor product of single-qubit unitary operators, and a reflection-layer matrix is the matrix of a layer of reflections on pairwise disjoint sets of wires. For a natural depth , the enlarged reflection-circuit class is the class of operators of depth at most defined recursively by (6). Identity layers are allowed, and the rightmost matrix acts first. (6)✦
For a natural depth and real exponents , the uniform localization assertion requires (7) for all sufficiently large , simultaneously for every and all product projection data . (7)✦
The Claim
Theorem 1. Let be product projection data on qubits, a quantum operator, and a real polynomial. Let be real, with and . Suppose (8) holds for every choice of product projection data with . (8) Then the polynomial transition estimate is (9). (9)✦
Suppose instead that is unitary and that real numbers satisfy (10). The finite backward estimate is (11). (10) (11)✦
Let be a nonnegative integer and assume for every pair of real exponents . Let real exponents satisfy (12), and assume . (12) The uniform backward conclusion is (13). (13)✦
In the paper, the result reads: for , assume for every fixed ; for fixed real , implies .
What Is Checked
The uniform statement (13) is over the recursively defined circuit classes and normalized product projection data, while the finite statements (11) and (9) concern real polynomials and arbitrary qubit counts, with unitarity required for the finite backward estimate.