Stationarity is not enough: tightness of the quantum mechanical bootstrap and the copositive cone
An exactly certified counterexample shows that the stationary quantum bootstrap is not tight in two dimensions: a candidate satisfying every stationary constraint, with a strictly positive moment matrix, assigns a negative value to a polynomial that is non-negative everywhere. Adding the eigenstate constraints removes the violation in every setting tested, apparently by bounding the momentum directions the stationary relaxation leaves free. A related gap in the underlying matrix cones first opens at five variables.
Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). This is an AI-generated explanation of the paper below. It is not written by the authors. For technical accuracy, refer to the original paper. Read full disclaimer
Quantum systems are described by states, and one way to study them is the bootstrap: instead of solving the equations of motion, you propose a candidate description and test whether it obeys a short list of consistency rules. The most important rule is a positivity requirement. If a physical quantity can never be negative, then its average in any genuine state cannot be negative either. The practical version of this test asks whether the candidate assigns a non-negative value to every quantity that can be written as a sum of squares, because that is a condition a computer can check efficiently. For a single particle moving on a line, this is enough: every non-negative polynomial in one variable is a sum of squares, so the two notions coincide. In two or more dimensions they come apart. There exist polynomials that are non-negative everywhere but cannot be written as a sum of squares, and a candidate state that passes the computable test might still assign one of them a negative value. Whether that abstract gap is ever reached by an actual quantum problem had not been settled. This paper settles it, and the answer depends on which version of the bootstrap is being used. The weaker version, called stationary here, imposes only that the state does not change in time. It applies to thermal states and to mixtures, and it is the version used when the object of study is an equilibrium state rather than a single energy level. The stricter version adds a condition that holds only for states of definite energy. For a particle in two dimensions moving in a quartic potential with four symmetric wells, the author constructs a candidate that satisfies every stationary requirement exactly, in rational arithmetic with no rounding, and whose associated moment matrix is strictly positive. Applied to a particular polynomial that is non-negative across the whole plane but is not a sum of squares, that candidate returns a negative value. No quantum state can behave this way, so the candidate is spurious and the stationary bootstrap is not tight. Because the moment matrix records momentum as well as position, the certificate rules out a sum-of-squares representation in the full operator algebra, not merely in the commuting variables. The stricter eigenstate version behaves differently. Repeating the same search with the energy conditions imposed produced no spurious candidate, across two, three and five degrees of freedom, at two truncation levels, and for several potentials chosen specifically to align with known non-sum-of-squares obstructions. The one exception was a case where the truncation was so coarse that the energy conditions had nothing left to say, which reduces it to the weaker version. The reason is identifiable rather than merely observed. Under the stationary conditions alone, the high-order momentum averages of a candidate can be made arbitrarily large while the position averages stay ordinary. The spurious candidate exploits exactly this: its momentum averages are inflated by orders of magnitude. The energy conditions couple momentum to position and bound those averages, and the paper proves such a bound explicitly in one case. How far the bound reaches depends on the truncation level and the degree of the potential, and when the potential is too rich for the truncation the mechanism has no room to act. Dimension matters for a concrete reason. Under sign-flip symmetry, the question of which candidates can be excluded turns into a question about matrices that are non-negative on the positive orthant. For up to four variables these coincide with the well-behaved matrices the bootstrap can certify; from five variables onward they do not. The paper's five-dimensional example is a ring of coupled sites with cyclic symmetry, and the cyclic structure is essential rather than decorative: averaging over all permutations of the sites instead would collapse the relevant obstruction to something the bootstrap certifies without difficulty. The negative result is a proof. The positive one is not. The searches supporting tightness of the eigenstate bootstrap use a local method, so they establish that no separating polynomial was found in the families examined, not that none exists. The practical recommendation for practitioners is small and cheap: when a bootstrap calculation in two or more dimensions reports something surprising, test the candidate against a known non-negative polynomial that is not a sum of squares. The test costs one linear program.
Drowning in papers in your field?
Get daily digests of the most novel papers matching your research keywords — with technical summaries, in your language.