Limitations and Separations in the Quantum Sum-of-squares, and the Quantum Knapsack Problem
M. B. Hastings

TL;DR
This paper investigates limitations of the sum-of-squares method for the SYK model, reveals a graph invariant can be larger than the independence number, and introduces the quantum knapsack problem, highlighting new bounds and problem formulations.
Contribution
It demonstrates a specific limitation of the sum-of-squares approach and establishes a separation between a graph invariant and the independence number, also defining the quantum knapsack problem.
Findings
A fragment of sum-of-squares does not give tight bounds on ground state energy.
The graph invariant Ψ(G) can be strictly larger than the independence number α(G).
Introduction of the quantum knapsack problem.
Abstract
We answer two questions regarding the sum-of-squares for the SYK model left open in Ref. 1, both of which are related to graphs. First (a "limitation"), we show that a fragment of the sum-of-squares, in which one considers commutation relations of degree- Majorana operators but does not impose any other relations on them, does not give the correct order of magnitude bound on the ground state energy. Second (a "separation"), we show that the graph invariant defined in Ref. 1 may be strictly larger than the independence number . The invariant is a bound on the norm of a Hamiltonian whose terms obey commutation relations determined by the graph , and it was shown that , where is the Lovasz theta function. We briefly discuss the case of in the SYK model. Separately, we define a problem…
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
TopicsComputability, Logic, AI Algorithms · Quantum Computing Algorithms and Architecture
