Field Theory and The Sum-of-Squares for Quantum Systems
M. B. Hastings

TL;DR
This paper explores the sum-of-squares hierarchy for quantum spin and fermion systems using quantum field theory techniques, and examines the challenges in approximating the SYK model's ground state energy with various methods.
Contribution
It introduces new insights into the sum-of-squares hierarchy for quantum systems and analyzes limitations of classical approximation methods for the SYK model.
Findings
Limitations on the Lanczos method starting from Gaussian states
Constraints on approximating SYK ground state energy with Gaussian wavefunctions
Application of quantum field theory ideas to sum-of-squares hierarchy
Abstract
This is a collection of various result and notes, addressing the sum-of-squares hierarchy for spin and fermion systems using some ideas from quantum field theory, including higher order perturbation theory, critical phenomena, nonlocal coupling in time, and auxiliary field Monte Carlo. This paper should be seen as a sequel to Refs. 1,2. Additionally in this paper, we consider the difficulty of approximating the ground state energy of the Sachdev-Ye-Kitaev (SYK) model using other methods. We provide limitations on the power of the Lanczos method, starting with a Gausian wavefunction, and on the power of a sum of Gaussian wavefunctions (in this case under an assumption).
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Chromodynamics and Particle Interactions · Physics of Superconductivity and Magnetism · Theoretical and Computational Physics
Field Theory and The Sum-of-Squares for Quantum Systems
Matthew B. Hastings
Abstract
This is a collection of various result and notes, addressing the sum-of-squares hierarchy for spin and fermion systems using some ideas from quantum field theory, including higher order perturbation theory, critical phenomena, nonlocal coupling in time, and auxiliary field Monte Carlo. This paper should be seen as a sequel to Ref. Hastings and O’Donnell (2022) and Ref. Hastings (2022). Additionally in this paper, we consider the difficulty of approximating the ground state energy of the Sachdev-Ye-Kitaev (SYK) model using other methods. We provide limitations on the power of the Lanczos method, starting with a Gausian wavefunction, and on the power of a sum of Gaussian wavefunctions (in this case under an assumption).
I Introduction and Background
The difficulty of simulating quantum systems on a classical computer has been recognized almost since the dawn of digital computers. The world’s first commercially available digital computer was the Ferranti Mark I. Its successor was the Ferranti “Mercury”. In 1964, Bonner and FisherBonner and Fisher (1964) used a Ferranti Mercury to simulate a one-dimensional quantum spin chain with up to sites. In this influential paper, they explicitly described the exponentially growing size of the Hilbert space (even using translation symmetry to reduce the size), and lamented that their “relatively slow” computer restricted the available system sizes. Of course, the importance of this exponential growth must have been understood well before that time, especially to anyone who attempted a hand calculation, but it is remarkable that some of the earliest computers were used to simulate quantum many-body problems.
In this regard, many of the simulation methods used in practice are attempts to find some polynomial time algorithm which gives reasonable answers at least in some regime. For example, perturbation methods work at weak coupling, with a polynomial overhead at any given order of perturbation theory; DMRG and matrix product states work well in one-dimensional systems with low entanglementSchollwöck (2011); and so on.
One particularly intriguing approach is based on the sum-of-squares hierarchy. This method can give rigorous lower bounds on the ground state energy of a quantum system. Any given level of the hierarchy takes a polynomial time, with the order of the polynomial increasing at higher levels of the hierarchy111This statement skips over some details. At any given order of the hierarchy, one has a semidefinite progam of polynomial size, and commonly it is stated that such programs can be solved in polynomial time up to small additive error. There can be some tricky hidden parameters in these claims (see https://www.cs.cmu.edu/~odonnell/papers/sos-automatizability.pdf , Ref. O’Donnell (2017) ), but it seems that those issues cannot arise for the present problem.. See Refs. Goemans and Williamson (1995); Charikar and Wirth (2004) for algorithms for classical systems, while for quantum systems with fermions the method is known as the reduced density matrix method (RDM)Coleman (1963); Erdahl (1978); Percus (1978); Mazziotti and Erdahl (2001); Nakata et al. (2001); Mazziotti (2012); Klyachko (2006). There is also a sum-of-squares hierarchy for qudit systemsHelton and McCullough (2004); Navascués et al. (2008); Doherty et al. (2008); Pironio et al. (2010).
In this paper we give several results about the sum-of-squares. These results are largely unrelated to each other, but there is a general theme that they have some relation to field theory methods. In Section II, we discuss auxiliary field quantum Monte Carlo, showing a relation between optimal decompositions of the interaction (from the point of view of the sign problem) and a certain restricted version of the sum-of-squares method. In Section III, we discuss the ability of sum-of-squares to reproduce perturbation theory for fermionic systems; we extend results of Hastings (2022), which showed that second order perturbation theory could be reproduced by a fragment of degree- sum-of-squares but that it could not be reproduced by degree- sum-of-squares. We show that for any given order of perturbation theory, there is some order of the sum-of-squares which reproduces it. We do not, however, find the minimal order of sum-of-squares which can reproduce a given order of perturbation theory, and we leave this as an open question. In Section IV, we discuss critical phenomena in the sum-of-squares framework, showing that in several cases the leading order sum-of-squares gives critical exponents which coincide with the large- vector model. In Section V, we consider methods related to the sum-of-squares applied to systems which have a nonlocal interaction in time. Finally, in Section VI, we consider the ability of various classical variational methods to approximate the ground state energy of the SYK modelSachdev and Ye (1993); Kitaev (2015). While this section does not involve the sum-of-squares hierarchy directly, there is some relation because in Ref. Hastings and O’Donnell (2022) it was shown that sum-of-squares methods could certify one-sided bounds on the ground state energy within constant factors, with high probability.
I.1 Background
A review of the hierarchy is in Ref. Hastings and O’Donnell (2022). Some of the results extend results in Ref. Hastings (2022). Since this paper is to some extent a sequel to those two papers, we will not give detailed definitions if they are explained there.
To very briefly sketch the idea of the hierarchy, one first chooses some set of operators, . In the so-called “degree sum-of-squares”, the set of operators will be the set of monomials of degree at most in some operators, such as creation and annihilation operators for fermionic systems, or Pauli spin operators for some system of qubits. Given this set of operators, one introduces a matrix, , with matrix elements given by
[TABLE]
where is a pseudo-expectation value. What does “pseudo-expectation value” mean? This means that we impose three conditions on . First, we impose some linear relations, determined by the algebra of operators. That is, if for some we have , for some scalar , then we impose . Examples of these relations include things like if is a Pauli spin operator, or if are Majorana operators. The second condition on is that is Hermitian. The third condition is that is positive semi-definite.
Remark: because of these linear constraints, for degree- sum-of-squares we can take the set to be a set which spans the same vector space of operators as the set of all monomials of degree at most . For example, with Maorana operators, we do not need both and , but only need one of them.
Note that given any quantum density matrix , the expectation value is such a pseudo-expectation. Such an is necessarily positive semi-definite because for any operator , we have . Conversely, if the set of operators is complete in that every operator on the given Hilbert space is a linear combination of operators in the set, then every pseudo-expectation defines some quantum state such that , but if the set of operators includes, for example, only operators up to some given degree, then there may be pseudo-expectation values that do not correspond to any quantum density matrix .
The sum-of-squares hierarchy defines a semi-definite program by minimizing the pseudo-expectation value of the Hamiltonian, subject to these constraints. This is a semi-definite program, called the “primal” problem.
It is standard that, given a primal semi-definite program which involves minimizing some quantity subject to constraints, there is a dual problem which involves maximizing some quantity subject to constraints, and the minimum of the primal is greater than or equal to the maximum of the dual. In this particular case, the so-called “duality gap” vanishes, and the minimum of the primal equals the maximum of the dual. The dual problem has a particularly simple explanation in this case. It is equivalent to: given a Hamiltonian , find a deomposition
[TABLE]
where and are non-negative scalars and where the are linear combinations of operators in the given set (e.g., polynomials of degree at most ). For the optimal decomposition, is equal to the ground state energy, and any such decomposition proves that the ground state energy is .
Note that, for example, even if is a sum of terms which are degree at most in some variables, one may use which are polynomials of higher degree in such a decomposition, so that using the (anti-)commutation relations of the algebra one can show that the result is equal to . Of course, we may absorb into the definition of , rescaling and writing , but sometimes it is more convenient to write it this way using .
I.2 Notation, and Conventions
A remark on norms: given an un-normalized state (i.e., a positive semi-definite matrix), the norm we use, unless we say otherwise, is the norm. So, given any state , we say “the projection of onto some subspace is ” to mean that the trace of the projection of onto is
We use the notation to indicate that is a sum-of-squares, i.e., it is a sum of operators . If we are discussing a particular order of sum-of-squares, when we use we implicitly mean that the sum-of-squares is at most of that given order.
We use computer-science big- notation throughout. We use to indicate the number of fermionic modes or qubits, following Hastings and O’Donnell (2022). We use later to denote a particular orthogonal group.
We use to denote Pauli operators on a given qubit in a qubit system. We use to denote Majorana operators, . We also use creation and annihilation operators which obey canonical anti-commutation relations, with . Even for fermionic systems which might not obey particle-number conservation, we will see that there are some uses for creation and annihilation operators.
II Auxiliary Field Quantum Monte Carlo and the Importance of Commutators
The sum-of-square method above considers decomposition of a Hamiltonian as for some scalar . Here, the operator may not be normal, meaning that the commutator might not vanish. Suppose indeed for some Hermitian operators , with . Then
[TABLE]
The first two terms on the right-hand side are squares of Hermitian operators, but the commutator is not.
Indeed, if we restrict to sum-of-squares of Hermitian operators, so that we decompose for Hermitian , then the method becomes weaker than if we allow non-Hermitian . For example, consider a system with two qubits with Hamiltonian
[TABLE]
First consider a decomposition with non-Hermitian . Let us consider the following, where are some real scalars that we adjust (here we use the standard convention for Pauli matrices that ):
[TABLE]
where means the same term as the first except with qubits and interchanged. Then, we need to take
[TABLE]
and we have Optimizing over , we may obtain
[TABLE]
in agreement with the exact ground state.
Remark: this decomposition is almost the same as that used in Hastings (2022) to show that we may reproduce low order perturbation theory with the sum-of-squares, except that here we have allowed a more general decomposition with . If we restrict to , we reproduce low order perturbation theory.
Now suppose instead that we consider only a decomposition of as a sum of squares of Hermitian operators. Again we consider the degree- sum-of-squares. The dual formulation is in terms of a pseudo-expectation, , as before. However, now rather than requiring that the matrix of pseudo-expectation values be Hermitian and positive semi-definite, we will take all operators defining that matrix to be Hermitian, and we will only require that the matrix be Hermitian and that the symmetric part of the matrix be positive semi-definite. Taking the operators to be drawn from the set , we consider the following pseudo-expectation. The diagonal elements of the matrix of pseudo-expectation values are of course all equal to . Let ; this of course implies that . Assume and let Finally, let all other matrix elements have vanishing real part; i.e., their contribution to the symmetric part of the matrix vanishes. Note that the various linear constraints imposed on pseudo-expectation values by the Pauli commutation relations imply that , i.e., the real part of that matrix element vanishes as required. Similarly, .
One may verify that this defines a matrix whose symmetric part is positive semi-definite but now we are only able to show that at this order of sum-of-squares.
Given that this formulation of the sum-of-squares using only Hermitian term in the squares is weaker than the more general formulation, the reader may wonder why it is worth considering. One answer is that it is worth discussing simply to emphasize why we want to use non-Hermitian operators in the squares. However, there is also an interesting relation to auxiliary-field quantum Monte Carlo (AFQMC); see Blankenbecler et al. (1981); Sugiyama and Koonin (1986) for original AFQMC papers, and see later work (too much to summarize here) for various methods of improving the sign problem. Suppose we have a Hamiltonian for a fermion system which is a sum of quadratic and quartic terms. Then, suppose we find a decomposition where the operators are Hermitian and are quadratic in the fermion fields; note that is a quadratic term in the Hamiltonian while includes quadratic and quartic terms. We choose to be a sum-of-squares of linears in the fermion operators so is positive semi-definite. Then, we can implement an auxiliary-field Monte Carlo in imaginary time. To do this, one may use Trotter-Suzuki to approximate the imaginary time evolution by a product
[TABLE]
where is a small timestep in imaginary time, and where the product is taken in some arbitrary order. Then, use a Hubbard-Stratonovich decoupling
[TABLE]
This turns the evolution in imaginary time to the evolution under a quadratic Hamiltonian coupled to a fluctuating field. In this case, there is a sign problem, but the magnitude of the sign problem depends on the difference between and the exact ground state energy. That is, if the the ground state energy is , then at large inverse temperature , we have . The operator is unitary for any , and so the decay is due to a combination of the fluctuating sign due to averaging over different fluctuating auxiliary fields as well as any additional decay due to . To say it differently, the weight of any configuration is non-increasing as imaginary time increases (it may decrease due to the term but cannot increase); so, any decay in the average sign must lead to a decay in the total weight. Thus, an optimal solution to the semi-definite program may give an optimal decomposition for AFQMC as we can lower bound the decay in the sign problem at long time by a constant times .
Of course, in many cases solutions using a real coupling to the auxiliary field, rather than imaginary, may lead to a better sign problem.
Some numerical experiments on quartic Hamiltonians show that there is a large loss in accuracy of the semi-definite program by using only Hermitian terms in the sum-of-square (for example, on some small molecules of 5-10 orbitals, changing from errors of Hartree using non-Heritian terms in the sum-of-squares to Hartree using only Hermitian terms). However, even so the resulting error in the ground state energy ( Hartree in this case) suggests that it might lead to a manageable sign problem. When doing these calculations, we allowed the operators to be spin [math] or spin , and also allowed them to be particle-number-nonconserving; indeed, allowing that full generality was needed to obtain the optimal solution of the semidefinite program.
Remark: this idea has some similarity of Levy and Clark (2021), in that one finds some optimal way of writing a Hamiltonian to minimize a sign problem by a variational method. Here the variational method is solving a semi-definite program, there the variational method involved maximizing an energy of a quantum Monte Carlo simulation.
For the rest of this paper, we consider the general case where the operators may be non-Hermitian.
III Perturbation Theory for Fermionic Systems
Here we discuss the relationship between the sum-of-squares and perturbation theory. Following Hastings (2022), we consider a Hamiltonian
[TABLE]
where
[TABLE]
where all are positive scalars, where is a small parameter controlling the perturbation theory, and where each term is a sum of products of creation operators and annihilation operators, with the term normal ordered so that the annihilation operators are to the right of the creation operators. Thus, all terms , except for , annihilate the unperturbed ground state (i.e., when all number operators are equal to [math]).
For small , there is a well-studied theory of perturbatively solving this Hamiltonian for the ground state energy as a function of , which we denote . Indeed, there are several such perturbation methods, such as Rayleigh-Schrodinger, Brillouin-Wigner, and Green’s function (diagrammatic) methods. These methods all yield the same power series in the end, but may organize the computation differently.
We address two questions. First, we consider a perturbative solution of the semi-definite program at a given order of the sum-of-squares. Second, a related question, we consider whether the sum-of-squares at a given order can reproduce a given order of perturbation theory; here, we say that it reproduces a given order of perturbation theory if it proves a lower bound on the ground state energy which is at least . Indeed, in all such cases where it does this we will find that it reproduces it up to error .
Remark: of course, for physical system, the quantities in Eq. 1 may have either sign. If they are negative, then the ground state of has some filled states. However, by applying a particle-hole conjugation we can bring it into the form above with . This particle-hole conjugation also means that terms may arise with even if the original Hamiltonian conserves number.
III.1 General Formalism for Perturbative Solution of Semidefinite Program and the Rank of the Reduced Density Matrix
We choose a basis for operators which are polynomials of degree at most in the creation and annihilation operators. A suitable basis is to use normal ordered monomials, i.e., the annihilation operators are to the right of the creation operators. We write such an operator as
[TABLE]
where are bit strings of length , where is the number of fermionic degrees of freedom. Each operator is defined to be the product of for such that the -th bit of is nonzero, with the product taken in the order of increasing .
When , the exact ground state of is of course easy to find and one may calculate the expectation values of products of operators in this ground state. Further, it is easy to show that any degree sum-of-squares, for , reproduces all these expectations of monomials, for monomials of degree .
In particular, the result for is as follows. Let and let . Then if or . If , then , where the -function is a Kronecker delta-function.
With this choice of basis, and this solution of the semidefinite program for , we may begin perturbation theory. First, however, we remark on an interesting property regarding the rank of the matrix of pseudoexpectation values for a primal solution to the semidefinite program.
III.1.1 Rank of
Note that at the matrix is diagonal, so the number of zero eigenvalues is simply equal to the number of zero entries on the diagonal. The zero diagonal entries entries correspond to the case where with and with nonzero. At , the number of zero eigenvalues, keeping which are monomials of degree at most , is equal to the number of choices of such that the total Hamming weight is and such that . Thus, the number of zero eigenvalues equals
[TABLE]
We emphasize that the matrix of pseudoexpectation values obtained by solving the sum-of-squares hierarchy at any given order (of at least ) in the case reproduces the exact expectation values in the ground state, and so in particular they have the same number of zero eigenvalues.
Now consider the following toy problem. Take and let
[TABLE]
where means to add the Hermitian conjugate.
The exact ground state wavefunction can be written as a sum where is the empty state (i.e., the state annihilated by all ) and is the state with four particles (i.e., the state annihlated by all ). Indeed, the ground state energy is the lowest eigenvalue of the two-by-two matrix
[TABLE]
and hence
We now show that degree- sum-of-squares reproduces this, by writing for some . We can guess an appropriate choice of by looking at the exact solution for the ground state wavefunction: we must have . One choice is to pick a quadruple all distinct, with , and let where is a scalar. Without loss of generality, let us pick so that they give an even permutation of the sequence (if they are an odd permutation, then the sign of below is changed). By inspecting the ground state wavefunction, we see that we need
[TABLE]
Then, where . Summing over all choices of , if we pick
[TABLE]
then this gives the desired term .
However, we do not yet have the correct term in the Hamiltonian. However, after some algebra, we find that
[TABLE]
for some non-negative scalar . Further is a sum of squares, as for . So, in this way we find the desired decomposition of as a sum of squares, giving the exact ground state energy at this order.
Now consider the rank of the matrix of pseudoexpectation values, , for a solution of the semidefinite program, restricting to operators of degree at most in the fermionic operators. Since degree- sum-of-squares reproduces the exact solution, we may consider the rank of the matrix of expectation values in the true ground state. One finds that the ground state is annihilated by any operator of the form for , and there are such operators. It also is annihilated by the operators and there are such operators. Indeed, the number of zero eigenvalues is equal to . This compares with the case where we found that the number of zero eigenvalues equals
Thus, the rank of the matrix of pseudoexpectation values increases when becomes nonzero. Indeed, even if consider the rank restricted to the submatrix where the operator has even fermion parity, then the number of zero eigenvalues at is equal to while the number at is equal to so even in that submatrix the rank has increased.
III.1.2 General Formalism
Now we develop a general formalism for a perturbative solution of the primal semidefinite for a Hamiltonian of form Eq. 1 at a fixed order of the sum-of-squares.
The presentation here is not rigorous. For example, we will ignore any questions of convergence of the series.
Assume we have a perturbative expansion
[TABLE]
where is the solution at and is given by a series as
One simplification is that , using the basis of operators above, is a projector. Let . We may perturbatively impose the requirement , where the inequality is interpreted as meaning that is positive semi-definite.
To impose this requirement perturbatively, we need to ensure that the lowest eigenvalue of is . To do this, it is convenient to use Brillouin-Wigner perturbation theory. This perturbation theory is simpler than Rayleigh-Schrodinger perturbation theory in the case of a degenerate ground state. One complication that occurs in Brillouin-Wigner perturbation theory is that it involves denominators, where is the lowest eigenvalue of the perturbed system and is some nonzero eigenvalue of the unperturbed system; however we will see that these denominators simplify greatly. In our case, all these are equal to . The result of Brillouin-Wigner perturbation theory, is that there is some eigenvalue close to zero if
[TABLE]
has an eigenvalue equal to .
However, note that (assuming is ), reducing must increase the eigenvalues of this matrix since it increases the second order term and all higher terms in the series obey . So, if there is a negative eigenvalue of this matrix for some then there is also a negative eigenvalue for .
The result is that, perturbatively, positivity of is equivalent to the requirement that
[TABLE]
If we write where , then this is equivalent to
[TABLE]
One obvious way to satisfy this is to have . However, such a choice of might not obey the linear relations imposed on by the canonical anticommutation relations. Indeed, this is precisely why we considered the rank of in Section III.1.1: if we had then the rank of would not change, but the rank does change in some cases.
It may be interesting to continue to develop this theory, to understand the perturbative solution of the sum-of-squares. However, in the next section we turn to an alternative approach to show that the sum-of-squares can reproduce perturbation theory.
III.2 Perturbation Theory and the Sum-of-Squares
We now consider the question of reproducing a given order of perturbation theory using an appropriate order of the sum-of-squares. For sufficiently small , there is a power series in which defines a unitary such that where is the ground state at given and is the unperturbed ground state. We may prove this, for example, using exactOsborne (2007); Bravyi and Hastings (2011) quasi-adiabatic continuationHastings (2004) to construct a unitary describing the adiabatic evolution (for small enough , the gap between ground and first excited state remains open, as needed for this method) of the ground state. Alternatively, one may use higher-order Schrieffer-Wolff methodsBravyi et al. (2011).
Let
[TABLE]
for each . Since , we have
[TABLE]
The power series in for defines a power series in for . The term of order in this power series is a polynomial in the creation and annihilation operators of degree at most . For brevity, let us simply say the term “is a polynomial in ”. The term of order is equal to .
Similarly, we can define a power series in for where the term term of order in this power series is a polynomial in operators of degree at most . Again for brevity, let us simply say the term “is a polynomial in ”.
Using this power series for in terms of , we can write the Hamiltonian as a power series in where each term is a polynomial in . The term of order is equal to
[TABLE]
That is, it is the same as except with replaced with .
Let
Note that we have canonical anti-commutation relations also for , i.e., and So, we may take the representation of in terms of and normal order the terms, using these anti-commutation relations. This then expresses where is and is a sum of normal ordered terms and is a scalar.
Indeed, since the terms are normal ordered, then for small enough that , we have , i.e., it is the ground state energy at the given .
Moreover, by lemma 1 of Ref. Hastings (2022), each normal ordered term in of degree is equal to some linear combination of plus a sum-of-squares of terms, each term being a polynomial in degree at most . The sum, over all terms in of all these linear combinations can be written as some . So, we express Since is , for small enough we have for all so is a sum of squares.
Now let us show that for any given order of perturbation theory, some finite order of the sum-of-squares can reproduce the results at that order.
We have, as explained above, a sum-of-squares proof Indeed, this means that where each is a polynomial in operators and where we have fixed and so omitted .
Further, we claim that each has either even or odd fermion parity, i.e., it is a polynomial with only terms of even degree in or with only odd degree in , as the Hamiltonian only has terms of even degree (this is a special case of a more general result on symmetries of a Hamiltonian discussed in Section IV).
We claim the coefficient of a term of degree- in in is . Thus, a cubic term is of order , while a quadratic term is of order . Intuitively, this makes sense: the square of the quadratic term is a quartic term, and the quartic term in the Hamiltonian is of order . However, we may prove that this must be the case in general as follows: the term of degree- in is and the term of degree- in is , and so using the series for in terms of expresses the Hamiltonian in terms of where each term of degree is of order . Normal ordering does not change this: we get a normal ordered Hamiltonian in terms of , where again each term of degree is of order , as normal ordering can only reduce the degree. Finally, when using lemma 1 of Hastings (2022) to that show each normal ordered term in of degree is equal to some linear combination of plus a sum-of-squares of terms, each term having degree at most , the resulting sum-of-squares has the desired property that the coefficient of a term of degree- is .
Next, one may re-express each as a series in , using the series for in terms of . Then, again we have a similar result: the coefficient of a term of degree in in is . Suppose we truncate the series for each in at degree for some . For , this truncation of is correct up to error . To clarify what we mean by “correct up to error ”, since the quantity we are talking about is an operator rather than a number, we mean simply that it is a polynomial whose coefficients are of the given order.
For example, for , we can express the leading term up to error , because we include the terms of degree but not the terms of degree .
Call this truncation . Then, where is the “error” in making this truncation. The term is, by construction, . Further, is of degree at most by construction, assuming , as then every term in and in is at most degree . So, we may show that by a degree- sum-of-squares proof222This is a trivial proof. There is a sum-of-squares proof that any monomial in , with coefficient equal to , is and ..
So, this gives a degree- sum-of-squares proof that , i.e., a degree- proof. So, as claimed, for any desired order of perturbation theory, there is some order of the sum-of-squares that reproduces it, i.e., -th order perturbation theory is reproduced by degree sum-of-squares. However, we can see that this result is not optimal. In Hastings (2022), it was shown that degree- sum-of-squares reproduces second order perturbation theory.
We leave it as an open question to determine what the minimal order of sum-of-squares is to reproduce a given order of perturbation theory. In Hastings (2022) it was proven that second order perturbation theory is reproduced by degree- sum-of-squares and not by degree-.
IV Critical Phenomena
In this section, we apply leading order sum-of-squares to various models with a quantum critical point. Interestingly, we see exponents that coincide with the large- vector model (explained below) in a variety of cases. We see this both when the model is a vector model, and when it is a transverse field Ising model. The next-to-leading-ordered sum-of-squares treatment of this critical phenomena may be very complicated.
IV.1 Large Vector Model—Relation To Sum-of-Squares
The vector model is a model studied in quantum field theory (see chapter 8 of Polyakov (1987) or section 4 of Zinn-Justin (1998)). (The notation in the vector model should not be confused with our use of elsewhere for the number of degrees of freedom.) We can give a Hamiltonian formulaton of this model on a lattice as follows. Consider a lattice of sites labelled by integers ; for example, consider a cubic lattice in spatial dimensions. On each site , there are continuous degrees of freedom, for some integer . To describe these degrees of freedom, we introduce operators and , where indexes the different degrees of freedom on the given site . These operators obey the canonical commutation relations , where is the Kronecker -function (fixing ). We use to denote a vector with components and similarly denote a vector with components .
The Hamiltonian is then
[TABLE]
where the notation denotes the sum over nearest neighbor and and where . Taking large forces to be close to , so that the vector is constrained to given length.
At large , it is possible to solve this model using a saddle point method; one decouples the quartic interaction in using a Hubbard-Stratonovich transformation, introducing an auxiliary field (which becomes our quantity below), and then takes a saddle point in the integral over the auxiliary field (the saddle point is accurate for large , and it gives the self-consistent equation below). This solution does not require to be large. The resulting solution gives an interesting solvable model that displays a phase transition with non-mean-field behavior in three dimensions. At small , the different sites are approximately decoupled, showing paramagnetic behavior, but for larger than some critical , long-range ferromagnetic order sets in.
The solution of this large model can be summarized as follows. For simplicity, we consider the model on a cubic lattice, which simplifies the construction due to translational invariance. Then, there is some scalar 333Without translation invariance, it becomes necessary to introduce a different mass for each site.. Then, we consider the Hamiltonian This Hamiltonian describes coupled harmonic oscillators and can be readily solved using creation and annihilation operators. To do this, one applies a discrete Fourier transform to go to normal modes.
The ground state of the Hamiltonian has some given expectation value . Then, is chosen to satisfy a self-consistent equation
[TABLE]
As one approaches , the quantity displays interesting critical behavior. As approaches from below, in the infinite lattice size limit, tends to some quantity such that, at that quantity, the energy of the lowest normal mode of is equal to zero; this lowest normal mode is the one at wavevector equal to [math]. However, for any finite lattice size, never reaches that quantity. For , at finite lattice size, a non-negligible contribution to comes from the lowest normal mode.
Following this very brief review, it is interesting to see that the sum-of-squares method reproduces the same self-consistent solution for even at . For the case , we will drop the vector notation, and simply use operators and .
We use the following fact: for any real scalar , the function obeys ; note, the right-hand side are the zeroth and first order terms of a Taylor expansion of around . We have .
So, for any ,
[TABLE]
So, for any , we have
[TABLE]
where we take
[TABLE]
The ground state energy of can be calculated exactly using degree- sum-of-squares; indeed, this is precisely the usual calculation using creation and annihilation operators. We now vary over to get the tightest lower bound on the ground state energy. The derivative of the ground state energy of with respect to is
[TABLE]
Hence, the condition for a maximum is , so
[TABLE]
Using the given and , we see that this is the same self-consistent equation as Eq. 5 for .
The reader might note that we are working in a slightly non-standard form of the sum-of-squares. Eq. 6 is an inequality in the degree- sum-of-squares, but otherwise we use only the degree- sum-of-squares to solve . That is, we use part of the degree- sum-of-squares (indeed, we must, since the Hamiltonian is degree-), but otherwise we use only the degree- sum-of-squares. We claim, but leave to the reader to show, that we have found the optimal dual solution if we consider degree- sum-of-squares as well as sums of, for each , squares of polynomials of at most degree in . So, it is an interesting question how using the full power of degree- sum-of-squares would change the solution.
To emphasize why it is slightly surprising that sum-of-squares gives the same solution at , consider an alternative approximate method of solving the case . This alternative method gives a variational upper bound on the ground state energy. We use the ground state of Hamiltonian as a variational state, and compute the expectation value of Hamiltonian in this state, minimizing over . If one works out the details, one will find a different self-consistent equation for . Briefly stated, the reason is that sum-of-squares effectively uses the inequality , while in the Gaussian state we have .
IV.2 Transverse Field Ising Model at Leading Order
We now turn to the transverse field Ising model.
IV.2.1 Mean Field Theory
We begin with a treatment of a Hamiltonian appropriate for mean-field theory. Consider
[TABLE]
where there are qubits, with corresponding Pauli operators and . At small , we expect a ferromagnetic phase in the limit of large , while at large we expect a paramagnet. The factor of is to avoid double counting.
We can solve this Hamiltonian in a mean-field approximation. Take a product state for the spins, where each spin has and for some angle . Then the expectation value of the energy is (up to corrections for the case in the sum)
[TABLE]
For , the minimum is at , with energy . For , the minimum is at , with energy
[TABLE]
Now we consider a sum-of-squares treatment of the problem. We pause first for a useful result. Suppose we have some symmetry group of a Hamiltonian , i.e., we have a group homomorphism from some group to the group of unitaries, such that the unitaries in the image commute with . Further, suppose that, acting by conjugation, these unitaries do not increase the degree of a monomial, i.e., given an operator of given degree in some operators (e.g., the Pauli operators) and given a , the operator has the same degree as . Then we claim that given a sum-of-squares representation as , we can find a sum-of-squares representation of the same degree, where each has the property that it maps under conjugation by according to some irreducible representation of . To see this, suppose is a sum of operators which transform by conjugation under inequivalent irreducible representations, i.e., where labels irreducible representations and transforms by conjugation according to representation . Then,
[TABLE]
By assumption that is a symmetry of , for any we may make the replacement for every , and this gives another sum-of-squares representation of . By summing over this replacement for various choices of , we may remove any “cross-terms” in Eq. 8, i.e., remove those terms with .
In this case, the symmetry group that we will use is the symmetry under spin flip, meaning , as well as a symmetry under cyclic permutation of the spins Indeed, we have a full spin permutation symmetry but we will not need that.
We will use degree-2 sum-of-squares, so we search for a representation where each is degree . By the above general result, we may assume each is either even or odd under spin flip (i.e., stays the same or changes sign under spin flip).
We will make a few choices, where we say it “suffices” to consider only certain things; one may verify that these indeed give the optimal decomposition. Further, since as we will see the result agrees with mean-field up to corrections in the energy, it implies that these choices do give the correct energy up to corrections. First, it suffices to consider only odd terms. So, labels different irreps under cyclic permutation. Also, it suffices to take only one term for each irrep.
So, we represent
[TABLE]
where ranges over and
[TABLE]
where it suffices to take as real scalars. Here plays the role of a “momentum”, i.e., labeling different Fourier modes
Due to the symmetry under arbitrary permutation of sites, we may assume that all are the same for and similarly for . So, we set for and for and for and for . Since the Hamiltonian has no terms in it, indeed we must have . Then, to obtain the correct term in we need
[TABLE]
To obtain the correct term in we need
[TABLE]
From this we get
[TABLE]
and we wish to minimize (i.e., maximize ). Let us solve this for large . Then we approximate and we wish to minimize subject to since . For , the minimum is at with ; recall that denotes a term asymptotically smaller than .
For , we have and so and so . So, the sum-of-squares result matches the variational result, up to corrections which are subleading in .
IV.2.2 Three Dimensions
We now turn to the three-dimensional Ising model on a cubic lattice with sites. We label sites by triples of integers, using a vector notation such as to label a site. We let
[TABLE]
where the sum is over nearest neighbor .
The Hamiltonian has a spin flip symmetry as before. It also has a symmetry under translation by site in any of three orthogonal directions. We will label Fourier modes by vectors , e.g., given an -by--by- cube with , we have where are integer multiplies of .
As in the previous subsection, we consider a decomposition of as a sum-of-squares as
[TABLE]
where
[TABLE]
where are real scalars and where and . The reader may verify that this is an optimal decomposition at this order; we omit the proof.
As in the mean-field case, since the Hamiltonian has no terms, must be independent of . So, we write for some .
Given the terms in , we must have
[TABLE]
for some scalar . To get the correct term in , we need
[TABLE]
We have , so we wish to minimize .
We will be concerned only with what the criticial behavior is, so we will make various approximations. In an integral approximation to Eq. 12, we need
[TABLE]
We will work in an approximation: we consider only close to [math], and we expand
[TABLE]
Let us write , or, equivalently, , so .
We introduce a “cutoff” and consider only . So, we approximate Eq. 13 by
[TABLE]
where is defined to be the given integral.
The integral has some dependence on cutoff (it is “ultraviolet divergent”), so it is convenient to remove this dependence by differentiating twice with respect to . We get
[TABLE]
This integral now diverges at small for . This divergent is cutoff for nonzero and the integral is then (for ) approximately equal to for some . Hence, the integral in Eq. 14 behaves for small like for some constants .
So, keeping only the leading terms for small , we have that and we wish to minimize , with . So,
[TABLE]
This gives some function of , which can be expanded for small as , for some constant . The quantity depends on . Indeed, there is some critical value of , , above which the system is in the paramagnetic phase. This is the value of at which vanishes. For , the quantity is negative. Since depends linearly on for small , we are minimizing a function of of the form , for some constant .
Hence, for small , the minimum is at , i.e., . This in fact is the scaling dependence of mass on distance from critical point which occurs for the vector model in the limit of large in dimensions.
We leave it to the reader to verify that the singular behavior of the ground state energy matches that from the large- vector model.
V Beyond the Hamiltonian Formulation
The sum-of-squares method is tied to the Hamiltonian formulation of quantum mechanics. One might wonder: suppose one has a relativistically invariant field theory; is there some covariant version of the sum-of-squares method? One could of course build transfer matrices perpendicular to any spacelike surface and apply the sum-of-squares method to that transfer matrix.
However, one might wonder, is there some variant of the sum-of-squares method which is more closely related to the path integral, or action, formulation of quantum mechanics? Since the action formalism is often applied to systems where there is some nonlocal action in time after integrating out degrees of freedom, it is interesting to consider the possibility of applying a sum-of-squares to some system that is nonlocal in time. That is what we consider in this section.
To describe such a system, we define a function analogous to the partition function in the following way
[TABLE]
This expression will require some explanation. Here are non-negative real scalars. We assume that some finite dimensional Hilbert space is given, and is some Hermitian operator on this Hilbert space, and the is some (possibly non-Hermitian) operator, where is some discrete index ranging over some given finite set. The functions are some non-negative functions which are periodic in so that . The notation means a “time-ordered trace”. Let us define this formally for those unfamiliar with this notation: first, one formally expands the exponential in a power series. Then, any given term in the power series is some time-ordered trace of integrals over some “time parameters” . We bring these integrals outside the “time-ordered trace” and also bring the functions outside the trace, i.e., for any function of some number of time parameters, and any operators we define
[TABLE]
To define the time-ordered trace, we define
[TABLE]
where is a permutation such that
[TABLE]
If some time parameters in the integral coincide (e.g. ), we leave the time-ordered trace ill-defined, but this does not contribute to the integral.
Thus, what we would hope is that if then . Indeed, suppose we take a limit in which for each , the function . Here we are being slightly loose about the use of Dirac -functions but the reader can easily replace them with some sufficiently sharply peaked functions if desired. Then, this is the same as considering the partition function of Hamiltonian at inverse temperature , i.e., in this case . This may be seen to be a non-increasing function of as in this case , where denotes the thermal expectation value.
However, what we will argue is that if we consider more general , then we may have for some small nonzero . Indeed, we will do this in the case that and that the functions are even. We give this and some other examples in Section V.1; these examples are probably well-known but I do not know a reference. Then in Section V.2, we give some sufficient conditions on the functions to have .
V.1 Some Counter-Examples
The first example has a two-dimensional Hilbert space, corresponding to a single qubit. We let where is a scalar. The index takes only a single possible value, so we omit the subscripts on and . We let . Finally, we choose
[TABLE]
for some , where the sum is over integer to make the function periodic in as required.
Then, let us take some fixed , take with , and take . To analyze this, note that if , then it simply describes a Hamiltonian , whose ground state is the spin down state. Suppose we expand in powers of . The first order term in is proportional to as each operator flips the spin from ground state to excited state, and the spin does not flip back until time later. However, at second order, we can obtain contributions which are not exponentially suppressed in , but only suppressed by a power of . Indeed, consider a term
[TABLE]
Then, it may be that and . For example, we might have , for some small . In this case, the suppression is only exponentially small in , and integrating over simply gives a factor so the overall contribution is of order .
We may then choose the parameters so that this particular second order contribution is exponentially larger than the first order contribution, and yet still have . In this case, we expect that the partition function is growing exponentially in , i.e., we may have .
We omit any formal proof that the partition function is growing exponentially in (though it is probably not difficult), but instead give the standard argument. First, of course, there is another second order contribution to which is proportional . Indeed, this contribution is times the square of the first order contribution. However, the standard way to deal with this is to perform a series expansion for , and then the only second order contribution is the positive contribution proportional to and we may choose parameters so that the sum of the first two contributions is positive.
In this example, the sign of the second order contribution is positive and larger than the first order contribution. It is easy to see that the sign of the first order contribution is always negative. It is interesting to note though that we may also have a negative sign for the second order contribution to . To do this, we take a four-dimensional Hilbert space, corresponding to two qubits. We let where is a scalar. We let , let , and let . Finally, we choose , where is as before. Then, the first order contribution is exponentially suppressed as before, but one may verify that the sign of the second order contribution is negative.
V.2 Sufficient Conditions
Having seen that it is not enough to have be a non-negative function to have , we now give some sufficient conditions. Rather than just stating the conditions and then proving that they are sufficient, we instead derive them in some sense.
Consider the following alternative definition of a function . The Hilbert space is a tensor product of a finite dimensional Hilbert space on which act and also some additional harmonic oscillators, one such oscillator for each choice of the index . We let
[TABLE]
where the trace is over both finite dimensional and harmonic oscillator Hilbert space, where
[TABLE]
where where are creation and annihilation operators on the given harmonic oscillator and are real scalars, and where
[TABLE]
where are some real numbers which are integer multiple of , and are some operators.
Note that if all are equal to [math], then we do not need to use time-ordered traces. In this case we would simply have .
For , the term is anti-Hermitian, regardless of . We claim then that . Indeed, this follows because we can (to any desired accuracy) approximate by a Trotter-Suzuki decomposition by
[TABLE]
where each unitary matrix and where the error in the Trotter-Suzuki approximation tends to zero as the integer tends to infinity. Then, by a generalization of von Neumann’s trace inequality due to Fan (1951), this is bounded by ; see also theorem 20B.2 of Marshall et al. (1979) for this generalization. The generalization is that given any trace , where are unitary matrices, and the have singular values , the trace is bounded by .
However, we may then, using standard field theory techniques, integrate out the harmonic oscillators, leaving an expression that involves only the finite dimensional Hilbert space. The result is
[TABLE]
where the notation indicates a time-ordered trace just over the finite dimensional Hilbert space, where is the partition function of the harmonic oscillators (here the notation indicates that the trace is just over the harmonic oscillator Hilbert space), and where
[TABLE]
where the notation denotes a thermal expectation value at inverse temperature as defined by the above equation. We use the symbol to denote this function because it is a Green’s function of the harmonic oscillator.
For finite , the Green’s function is some periodic function of . However, it is interesting to consider the limit of large . In this case, converges to , where is a step function. That is, when is small compared to , it converges to a step function. We remind the reader that we are being slightly careless about -functions and step functions, but it is not difficult to fill in the details.
Thus, identifying gives us a choice of functions for which as in Eq. 15 has the property for .
Of course, we can also use this trick of integrating out harmonic oscillators to obtain functions which are equal to where the sum is over some discrete index , where , and where is some function of and , by indexing the harmonic oscillators with a pair of indices .
By doing this and taking a large number of terms in the sum while taking , we expect that we will have the property for in the limit of large whenever for any choices of functions which have Fourier transforms which are non-negative and sufficiently well-behaved (we leave details of what this would mean to the reader!).
VI On Classical Methods for SYK Ground States
In this section, we consider two classical variational methods for approximating the ground state energy of the SYK model. One method is the Lanczos algorithm, starting with a Gaussian wavefunctions (we explain Gaussian states and wavefunctions in more detail below), and the other method is a sum of Gaussian wavefunctions. We prove limitations on the power of these methods.
VI.1 Background
The SYK modelSachdev and Ye (1993); Kitaev (2015) is a model of fermions with randomly chosen interactions. See Rosenhaus (2019); García-García and Verbaarschot (2016); García-García et al. (2018); Feng et al. (2019, 2018, 2020).
In this paper, we largely consider the degree- SYK model. In this case, the Hamiltonian is
[TABLE]
where are Majorana operators obeying the anti-commutation relations , with , with even, and where the entries of the tensor are independent Gaussians, up to the requirement that be totally anti-symmetric in its indices.
More generally, one can consider a degree- SYK model for even . In this case, we mean a sum of degree- monomials in Majorana variables, with Gaussian random coefficients, with variance chosen so that the expected sum-of-squares of coefficients is equal to . We discuss this briefly later, but if not otherwise specified, we mean the degree- model.
We choose the variance of the Gaussians so that the norm of (i.e., the square-root of sum-of-squares of its entries) is a constant, independent of . This is a different normalization that considered in physics, where instead for the degree- model the norm is of order , but is convenient for us and was used in Ref. Hastings and O’Donnell (2022).
Also, we will (following Hastings and O’Donnell (2022)) consider approximating the state with most positive eigenvalue (i.e., the highest ezcited state), rather than the state with most negative eigenvalue (i.e., the ground state). The distribution of is invariant under change of sign, so this has no effect, but it avoids some signs later.
Mathematical physics results predict that with this normalization, the largest eigenvalue is proportional to with high probability, and even predict the leading coefficient, though it is not proven. In Feng et al. (2019), it is proven that with high probability the largest eigenvalue is with high probability. In Hastings and O’Donnell (2022), it is also proven that with high probability, the largest eigenvalue is , thus proving that the eigenvalue is with high probability.
The eigenstate with largest eigenvalue of the SYK model is predicted to be highly entangledLiu et al. (2018). In this regard, it is interesting to see to what extent one can find variational states which still have a large expectation value for the SYK Hamiltonian. In Hastings and O’Donnell (2022), it was shown that, with high probablity, one could efficiently on a quantum computer construct a quantum variational state which had energy which is , where by “energy” of a state, we simply mean the expectation value of the SYK Hamiltonian.
However, suppose we restrict to variational states whose energy can be efficiently evaluated on a classical computer. In this case, Haldar et al. (2021) proved an important negative result: with high probability, for any Gaussian state, the expectation value of the SYK Hamiltonian is , which has a different scaling with than the largest eigenvalue.
In this section, we prove further results. Our main result is to bound the expectation value of the energy of a sum of Gaussian wavefunctions, i.e., some sum , where are Gaussian wavefunctions, under an assumption explained later on the norm. Note, a sum of polynomially many Gaussian wavefunctions is an important class of states where one can efficiently evaluate the energy on a classical computer is a sum of Gaussian wavefunctionsBravyi and Gosset (2017); Boutin and Bauer (2021). Importantly, these Gaussian wavefunctions do not need to be orthogonal to each other. If they are orthogonal, our norm assumption is fulfilled, so long as the total number of Gaussians is sufficiently small; the number we allow is exponentially large in a power of . Even if the wavefunctions are not orthogonal, the norm assumption may be fulfilled. As a corollary, we prove a limitation on the power of Lanczos methods starting with a Gaussian wavefunction. The Lanczos method is variational method within the subspace, called a “Krylov space”, which is the span of , for some finite . When we say we “start” with a Gaussian wavefunction, we mean that is a Gaussian wavefunction (explained next).
Before doing this, let us define what we mean by Gaussian states and give some mathematical background on Wick’s theorem. Here a “state” refers to a density matrix. Gaussian states are those states in which expectation values of any product of Majorana operators are determined by Wick’s theorem (below). The pure Gaussian states are precisely the states which are ground states of Hamiltonians which have unique ground states and which are quadratic in Majorana operators. See Ref. Bravyi (2004) for more details.
We use the term “wavefunction” to mean a vector in the Hilbert space describing the given quantum system, so that for a normalized wavefunction , the projector is a state. We say that is a Gaussian wavefunction if the corresponding projector is a Gaussian state.
Let us briefly review Wick’s theorem. Let be a matrix with matrix elements , where denotes the expectation value in a given Gaussian state. In general we have , where is the identity matrix and is a real anti-symmetric matrix, with eigenvalues of bounded by in absolute value. If the Gaussian state is pure, then , and the state is a ground state of a quadratic Majorana Hamiltonian.
Any higher order expectation value in a Gausian state can be computed as follows. Consider all possible ways of pairing the different Majorana operators with each other. There are such pairings. We will regard a pairing of these Majorana operators as a pairing of the integers . Each pairing defines some sequence of pairs with and . For each pairing, consider the product
[TABLE]
Then, sum this product over all pairings, with a sign equal to the sign of the permutation from the sequence to the sequence .
Remark: often when Wick’s theorem is given for Majorana fermions, it is assumed that all are distinct from each other. Of course, we can always reduce to this case by using the Majorana anti-commutation relations. In this case, the sum over pairings has a nice representation as a Pfaffian.
VI.2 Main Results
We now prove the main results.
The results are largely corollaries of the following:
Theorem 1**.**
With high probability, for drawn from the SYK distribution, the expectation value of , for integer , in any Gaussian state is bounded by
[TABLE]
Proof.
We compute expectation value of by Wick’s theorem. We bound the product in each pairing, and then sum over pairings using a triangle inequality.
To bound a pairing, as in Hastings and O’Donnell (2022), note that a pairing can be regarded as a tensor network. There are degree vertices corresponding to the four-index tensor . There are such vertices. We join these tensors in the way corresponding to the given pairing, and then in each edge we insert a degree- vertex, corresponding to the matrix . We will write this tensor network as a particular product of vectors and matrices.
Let us define to be an -by- matrix, with rows (and columns) indexed by pairs with , with matrix element . The matrix was called simply in Hastings and O’Donnell (2022). We use this additional notation because we also introduce matrices which are defined to be -by- matrices, where the rows are indexed by integers from and the columns are indexed by such integers, with matrix elements defined in the obvious way:
[TABLE]
Then we assign each of the degree vertices of the network a label, either “left” or “right”. Then, the value of the tensor network can be written as some some expectation value as follows. Let be a vector in given by regarding as a vector. Then, the contraction of the tensor network equals
[TABLE]
Let us explain the meaning of this. We let be the number of left vertices and be the number of right vertices, with . Here we are using the bra-ket notation simply as a way of writing a vector-matrix-vector product, with the bra vector in and the ket vector in . Here we label basis vectors of by indices, each in , and denotes an operator which applies some permutation of these indices, i.e., it maps a given basis vector to some other basis vector by permuting the indices in some given way. We define similarly to permute indices. The number is equal to the number of degree vertices in the tensor network for which edges connect to left vertices and connect to right vertices.
The advantage of this representation is that we can apply norm bounds. Let and let . We have and , where we use the norm.
Standard random matrix theory bounds show that, with high probability, , and and , where denotes the operator norm. In the rest of the proof, we will assume that these bounds on operator norms hold.
So, the value of the tensor network is bounded in absolute value by
[TABLE]
This holds for any labelling. We now choose a labelling. We claim that it is possible to label the degree- vertices so that each each degree- vertex has two left neighbors and two right neighbors, i.e., so that . Then, the value of the tensor network is bounded in absolute value by
[TABLE]
Summing over all pairings, and using , the theorem follows.
To prove the claim on the labelling of vertices, it is convenient to consider the multigraph obtained by connecting the degree- vertices according to the given pairing, without inserting the degree- vertices in each edge. In this case, the question is whether we can color the edges of a regular (i.e., all vertices have the same degree) degree- multigraph so that each vertex has two edges of each color attached to it. This is possible as follows444I thank R. O’Donnell for this proof of the existence of such a coloring.: since the multigraph has even degree, each connected component is Eulerian. Take an Eulerian cycle in each connected component and alternately color the edges. Since the degree of each vertex is zero mod , the total number of edges is even in each connected component, and so Eulerian cycle has even length, making this alternation of coloring possible. ∎
Remark: one may also consider the case of the degree- SYK model for even . There are some modifications needed to the above proof. We may define an analogous . Then, we have, with high probability that . Also, if , then the analogous coloring argument works, and it is possible to color edges of a regular degree- multigraph so that each vertex has edges of each color attached to it. However, if , then the coloring argument need not work since the length of the Eulerian cycle is odd if there are an odd number of vertices in a given connected component. In that case, if the number of vertices in a component is odd, it is possible to color so that all but one vertex in each connected component has edges of each color attached to it, and the remaining vertex may be colored so that it has edges of one color and edges of the other color. Indeed, this may be the best possible; for example, consider the case and consider a multigraph with three vertices of degree , with edges connecting each pair of vertices.
Hence,
Corollary 1**.**
Let be drawn from the SYK distribution. Let be any positive constant. Then, with high probability, for any Gaussian state the projection of onto the eigenspace of with eigenvalue is exponentially small in , i.e., the projection is bounded by for some .
Proof.
Let project onto the eigenspace of with eigenvalue Pick even. Then . By Theorem 1, with high probability we have . So . We pick to be the largest even integer less than for some . Picking small enough, the result follows. ∎
So,
Corollary 2**.**
Let be drawn from the SYK distribution. Given any sum of polynomially many Gaussian wavefunctions, of the form , with being Gaussian wavefunctions, then, with high probability, if is , then . Remark: colloquially one may say that the condition is that is not exponentially large in .
Further, if the Gaussians are orthogonal to each other, and if the number of Gaussian wavefunctions in the sum is some with , then .
Proof.
For any , the norm of the projection of onto the eigenspace with eigenvalue is exponentially small in . Hence, by a triangle inequality, the norm of the projection of onto the given eigenspace is bounded by times something exponentially small in .
To show the second claim, if the Gaussian wavefunctions are orthogonal, and there are wavefunctions in the sum, then ∎
The above corollary needs this assumption on the norm or on orthogonality of the wavefunctions. We conjecture that this assumption is not necessary.
Conjecture 1**.**
Let be drawn from the SYK distribution. Given any sum of polynomially many Gaussian wavefunctions, the expectation value of the in the resulting state is .
Before proving this, we give the immediate corollary:
Corollary 3**.**
With high probablity, using steps of the Lanczos algorithm or the power method, starting from a Gaussian wavefunction, produces a state whose for the SYK Hamiltonian is .
Proof.
A Gaussian wavefunction is the ground state of a quadratic Majorana Hamiltonian which naturally defines an orthonormal basis of states. Given such a quadratic Hamiltonian , one can pick a new basis of Majorana operators that we write as such that in this basis
[TABLE]
These operators also obey the canonical anti-comutation relations:
[TABLE]
Then, this defines a natural orthonormal basis of states, where each such state is an eigenstate of all the operators and hence is a Gaussian wavefunction. Each such operator has eigenvalues and there are such states.
We say a state has excitations if there are such operators with eigenvalue and the others all have eigenvalue . Starting with a Gaussian wavefunction, and applying steps of the Lanczos algorithm, one can describe the resulting state as a sum of states with up to “excitations”. For , there are such states, and so the result follows from Corollary 2. ∎
Note, for only logarithmically many steps of the Lanczos algorithm, the natural basis of states used in the above proof means that one can efficiently classically apply the Lanczos algorithm. However, we do not know any way to efficiently compute a super-logarithmic number of Lanczos steps.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1Hastings and O’Donnell (2022) M. B. Hastings and R. O’Donnell, in Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing (2022), pp. 776–789.
- 2Hastings (2022) M. B. Hastings, ar Xiv preprint ar Xiv:2205.12325 (2022).
- 3Bonner and Fisher (1964) J. C. Bonner and M. E. Fisher, Physical Review 135 , A 640 (1964).
- 4Schollwöck (2011) U. Schollwöck, Annals of physics 326 , 96 (2011).
- 5O’Donnell (2017) R. O’Donnell, in Proceedings of the 8th annual Innovations in Theoretical Computer Science Conference (ITCS) (2017).
- 6Goemans and Williamson (1995) M. Goemans and D. Williamson, Journal of the ACM 42 , 1115 (1995).
- 7Charikar and Wirth (2004) M. Charikar and A. Wirth, in Proceedings of the 45th annual Symposium on Foundations of Computer Science (FOCS) (IEEE, 2004), pp. 54–60.
- 8Coleman (1963) A. J. Coleman, Reviews of Modern Physics 35 , 668 (1963).
