Lean, informalized

Nielsen & Chuang · Chapter 4, Quantum circuits · p. 207

Exercise 4.48 - A polynomial in nn bounds the Pauli terms that act on at most cc of nn qubits

Local Hamiltonians have polynomially many terms.

Hover over a blue or green term in the text, or a node in the graph, to find it in the other. Select it to read its declaration both in Lean and in words.

The Exercise

Take nn qubits and a Hamiltonian H=∑k=1LHkH = \sum_{k=1}^{L} H_k on them in which each term HkH_k acts on at most cc of the qubits, with cc fixed while nn grows. For c=2c = 2 the terms are fields on single qubits and couplings between pairs of qubits. The exercise asks to show that this restriction bounds the number LL of terms by a polynomial in nn.

The library states the claim for a Hamiltonian expanded in the Pauli strings defined below, tensor products of the Pauli matrices with one factor on each qubit, with real coefficients.

A Quantum System

A quantum system SS is described by its state space, a finite dimensional complex Hilbert space.✦ The qudit with dd levels is the system with state space ℂd\mathbb{C}^d with its standard inner product; a qubit is the qudit with two levels, and the qudit with 2n2^n levels is a register of nn qubits.✦ An observable AA on SS is a self adjoint operator on the state space of SS, A†=AA^\dagger = A.✦

Pauli Strings

The Pauli matrices are the four complex 2×22 \times 2 matrices σ0=I,σ1=X=(0110),σ2=Y=(0−ii0),σ3=Z=(100−1).\sigma_0 = I, \qquad \sigma_1 = X = \begin{pmatrix} 0 & 1 \\ 1 & 0 \end{pmatrix}, \qquad \sigma_2 = Y = \begin{pmatrix} 0 & -i \\ i & 0 \end{pmatrix}, \qquad \sigma_3 = Z = \begin{pmatrix} 1 & 0 \\ 0 & -1 \end{pmatrix}.(1)✦

For a string g=(g1,…,gn)g = (g_1, \dots, g_n) of indices in {0,1,2,3}\{0, 1, 2, 3\}, one for each of nn qubits, the Pauli string σg\sigma_g is the operator on the nn qubits σg=σg1⊗⋯⊗σgn,(σg)ij=∏k=1n(σgk)ikjk,\sigma_g = \sigma_{g_1} \otimes \cdots \otimes \sigma_{g_n}, \qquad (\sigma_g)_{ij} = \prod_{k=1}^{n} (\sigma_{g_k})_{i_k j_k},(2)✦ with rows and columns labelled by strings of bits i=(i1,…,in)i = (i_1, \dots, i_n) and j=(j1,…,jn)j = (j_1, \dots, j_n). As a 2n×2n2^n \times 2^n matrix, its rows and columns are labelled 0,…,2n−10, \dots, 2^n - 1 by reading each string of bits as a binary number.✦

The support of gg is the set of qubits at which the factor σgk\sigma_{g_k} is not the identity, supp⁡g={k:gk≠0},\operatorname{supp} g = \{\, k : g_k \neq 0 \,\},(3)✦ and its size |supp⁡g||\operatorname{supp} g| is the number of qubits on which σg\sigma_g acts.

For a string gg and a real number hh, the Pauli string Hamiltonian hσgh\,\sigma_g is the observable on the register of nn qubits that acts on ℂ2n\mathbb{C}^{2^n} as hh times the Pauli string σg\sigma_g on 2n2^n levels.✦

The Claim

Theorem 1. Let cc be a natural number. There is a polynomial pp with natural number coefficients, depending only on cc, with the following property. Given nn qubits and a real coefficient hgh_g for each string gg on nn qubits, some finite set TT of observables on the register of nn qubits satisfies hgσg∈T whenever |supp⁡g|≤c,|T|≤p(n).h_g\,\sigma_g \in T \ \text{ whenever } |\operatorname{supp} g| \le c, \qquad |T| \le p(n).(4)✦

The terms hgσgh_g \sigma_g with |supp⁡g|≤c|\operatorname{supp} g| \le c stand for the terms HkH_k of the exercise, so their number LL is at most the size of TT.

What Is Checked

The claim (4) is stated over the Pauli string Hamiltonians hgσgh_g \sigma_g, observables on the register of nn qubits built from the Pauli strings (2), and over the support (3), which expresses the locality condition.

The library proves that every Pauli string on 2n2^n levels is Hermitian.