Semidefinite programming hierarchy yields rigorous two-sided bounds on ground state properties of translation-invariant classical spin models.
High-Precision Bootstrap of Multimatrix Quantum Mechanics
4 Pith papers cite this work. Polarity classification is still indexing.
4
Pith papers citing it
abstract
We consider matrix quantum mechanics with multiple bosonic matrices, including those obtained from dimensional reduction of Yang-Mills theories. Using the matrix bootstrap, we study simple observables like $\langle \mathop{tr} X^2 \rangle$ in the confining phase of the theory in the infinite $N$ limit. Exploiting the symmetries of these models and applying nonlinear relaxation, we impose constraints that include traces of words of length up to 14. Our results yield rigorous bounds on the large-$N$ ground-state dynamics, along with estimates of selected low-order observables to eight significant digits.
verdicts
UNVERDICTED 4representative citing papers
Finite-N bootstrap yields N-independent bounds for matrix models but N-dependent novel bounds on the two-point function versus quartic coupling for tensor models.
A semidefinite programming bootstrap is formulated for Euclidean two-point correlators in quantum mechanics, yielding rigorous bounds and low-lying spectrum extraction in the ungauged one-matrix model.
Bootstrap method in quantum mechanics has an ambiguity problem for mixed potential and operator types, with three proposed resolutions.
citing papers explorer
-
Bootstrapping Euclidean Two-point Correlators
A semidefinite programming bootstrap is formulated for Euclidean two-point correlators in quantum mechanics, yielding rigorous bounds and low-lying spectrum extraction in the ungauged one-matrix model.