© 2026 Aqora Quantum S.A.S.

Terms Privacy Legal Notice

arXiv:2511.08560 · Journal of High Energy Physics

Bootstrapping Euclidean Two-point Correlators

Minjae Cho, Barak Gabai, Henry W. Lin, Jessica Yeh, Zechuan Zheng

hep-thcond-mat.str-elmath.OCquant-phSubmitted Nov 11, 2025• Announced Nov 12, 2025• 2 citations• Revised Jun 30, 2026 (v3)

v1 · Nov 11, 2025 v2 · Apr 7, 2026 v3 · Jun 30, 2026

Abstract

We develop a bootstrap approach to Euclidean two-point correlators, in the thermal or ground state of quantum mechanical systems. We formulate the problem of bounding the two-point correlator as a semidefinite programming problem, subject to the constraints of reflection positivity, the Heisenberg equations of motion, and the Kubo-Martin-Schwinger condition or ground-state positivity. In the dual formulation, the Heisenberg equations of motion become "inequalities of motion" on the Lagrange multipliers that enforce the constraints. This enables us to derive rigorous bounds on continuous-time two-point correlators using a finite-dimensional semidefinite or polynomial matrix program. We illustrate this method by bootstrapping the two-point correlators of the ungauged one-matrix quantum mechanics, from which we extract the spectrum and matrix elements of the low-lying adjoint states. Along the way, we provide a new derivation of the energy-entropy balance inequality and establish a connection between the high-temperature two-point correlator bootstrap and the matrix integral bootstrap.

Comments: 54 pages, 17 figures; v2: improved numerics and added refs; v3: minor improvements

Related papers

Thermal bootstrap of matrix quantum mechanics

Minjae Cho, Barak Gabai, Joshua Sandor +1 more

A bstract We implement a bootstrap method that combines stationary state conditions, thermal inequalities, and semidefinite relaxations of matrix logarithm in the ungauged one-matrix quantum mechanics, at finite rank N as well as in the large N limit, and determine finite temperature observables that interpolate between available analytic results in the low and high temperature limits respectively. We also obtain bootstrap bounds on thermal phase transition as well as preliminary results in the ungauged two-matrix quantum mechanics.

arXiv:2410.04262•Journal of High Energy Physics•Apr 23, 2025•13 citations

The Discrete Bootstrap for Quantum Thermodynamics

Sandor, Joshua

A novel bootstrap method is exemplified by lattice theories and quantum mechanics. Positivity of expectation values combined with sets of non-trivial constraint equations and semidefinite optimization rigorously and precisely bound correlation functions. Starting with the example of a one-dimensional integral, the technique is built upon to extract limit cycles in a two-dimensional classical dynamical system and spin correlation functions in the Statistical Ising Model. Further positivity constraints and simplifications arising in a large rank limit are implemented to bound the energy expectation value as a function of temperature in Matrix Quantum Mechanics. Along the way, the S-matrix of Chern-Simons-matter theory is computed as an example of computational simplification at large gauge group rank.

•Jan 1, 2025•0 citations

Semidefinite programming algorithm for the quantum mechanical bootstrap

David E Berenstein, George Hulsey

We present a semidefinite programming algorithm to find eigenvalues of Schrödinger operators within the bootstrap approach to quantum mechanics. The bootstrap approach involves two ingredients: a nonlinear set of constraints on the variables (expectation values of operators in an energy eigenstate), plus positivity constraints (unitarity) that need to be satisfied. By fixing the energy we linearize all the constraints and show that the feasibility problem can be presented as an optimization problem for the variables that are not fixed by the constraints and one additional slack variable that measures the failure of positivity. To illustrate the method we are able to obtain high-precision, sharp bounds on eigenenergies for arbitrary confining polynomial potentials in one dimension.

arXiv:2209.14332•Physical review. E•May 23, 2023•24 citations

Thermal Polyakov bootstrap

Yongwei Guo, Zhijin Li, Tinghong Shen

We derive thermal Polyakov bootstrap equations for CFT two-point functions on $S^1_β\times\mathbb R^{d-1}$. Combining the thermal OPE with a dispersion relation and the method of images gives a representation in blocks that satisfy Kubo-Martin-Schwinger (KMS) covariance. Their local expansions contain additional thermal blocks at classical double-twist dimensions. Matching the prescribed physical OPE requires cancellation of these generated contributions, yielding explicit linear equations for thermal OPE coefficients, including any compensating terms required by the reconstruction. We formulate the equations for bosonic scalar correlators and antiperiodic scalar structures extracted from fermion correlators, and find consistent solutions in analytically tractable thermal CFTs. The coefficient matrix, which we call the Polyakov matrix, connects the large-spin expansion to KMS consistency and reduces to minus the identity on the classical double-twist spectrum. This structure suggests a numerical approach to the three-dimensional Ising CFT that combines known low-lying vacuum data with a self-consistent large-spin tail.

arXiv:2609.28627•Sep 23, 2026•0 citations

Sparsity in the numerical six-point bootstrap

Sebastian Harris

The paper contributes to an ongoing effort to extend the conformal bootstrap beyond its traditional focus on systems of four-point correlation functions. Recently, it was demonstrated that semidefinite programming can be used to formulate a six-point generalisation of the numerical bootstrap, yielding qualitatively new, rigorous bounds on CFT data. However, the numerical six-point bootstrap requires solving SDPs involving infinite-dimensional matrices, which has so far limited its applicability and hindered scalability in early implementations. This work overcomes the challenges by using sparse matrix decompositions to exploit the banded structure of the underlying SDP. The result is a rewriting of one-dimensional six-point bootstrap problems as effectively two-dimensional standard mixed correlator four-point bootstrap computations. As application, novel bounds whose extremal correlators interpolate between the six-point functions of the generalised free fermion and boson are derived. The extremal interpolations are matched with perturbative deformations of the massive free boson in AdS _2 2 .

SciPost Physics•Dec 10, 2025•3 citations

Bootstrap certification of string order in quantum spin chains

Sagnik Banerjee, Haoyu Guo, Debanjan Chowdhury

The many-body bootstrap certifies ground-state properties by minimizing energy over correlators constrained only by positivity, without any variational wavefunction. Its cost, however, grows exponentially with the size of the operators involved, placing the long-range string correlators that diagnose topological phases out of reach. We overcome this by treating string operators as primary objects: bare and endpoint-dressed strings satisfy a closed operator algebra with one another and with local words, yielding a semidefinite program whose cost grows only polynomially with string length. A single computation then yields estimates of string correlators of all lengths. Rigorous two-sided bounds are obtained for each target string once the ground-state energy is pinned within a window. When benchmarked against density-matrix renormalization group computations on the cluster Ising and spin$-1$ Heisenberg chains, the method certifies the nonlocal string order of the cluster and Haldane phases directly from the Hamiltonian. Our rigorous certification of string order parameters reveal that the sharpness of the bounds is set by which operators enter the calculation, not by their length alone. By exploiting algebraic closure of strings and local words, our framework lifts spatially extended observables into polynomially tractable bootstrap variables, opening up a route to wavefunction-free certification of nonlocal order in quantum many-body systems.

cond-mat.str-elCross-listedarXiv:2609.22420•Sep 22, 2026•0 citations

We develop a bootstrap approach to Euclidean two-point correlators, in the thermal or ground state of quantum mechanical systems. We formulate the problem of bounding the two-point correlator as a semidefinite programming problem, subject to the constraints of reflection positivity, the Heisenberg equations of motion, and the Kubo-Martin-Schwinger condition or ground-state positivity. In the dual formulation, the Heisenberg equations of motion become "inequalities of motion" on the Lagrange multipliers that enforce the constraints. This enables us to derive rigorous bounds on continuous-time two-point correlators using a finite-dimensional semidefinite or polynomial matrix program. We illustrate this method by bootstrapping the two-point correlators of the ungauged one-matrix quantum mechanics, from which we extract the spectrum and matrix elements of the low-lying adjoint states. Along the way, we provide a new derivation of the energy-entropy balance inequality and establish a connection between the high-temperature two-point correlator bootstrap and the matrix integral bootstrap.

A bstract We implement a bootstrap method that combines stationary state conditions, thermal inequalities, and semidefinite relaxations of matrix logarithm in the ungauged one-matrix quantum mechanics, at finite rank N as well as in the large N limit, and determine finite temperature observables that interpolate between available analytic results in the low and high temperature limits respectively. We also obtain bootstrap bounds on thermal phase transition as well as preliminary results in the ungauged two-matrix quantum mechanics.

A novel bootstrap method is exemplified by lattice theories and quantum mechanics. Positivity of expectation values combined with sets of non-trivial constraint equations and semidefinite optimization rigorously and precisely bound correlation functions. Starting with the example of a one-dimensional integral, the technique is built upon to extract limit cycles in a two-dimensional classical dynamical system and spin correlation functions in the Statistical Ising Model. Further positivity constraints and simplifications arising in a large rank limit are implemented to bound the energy expectation value as a function of temperature in Matrix Quantum Mechanics. Along the way, the S-matrix of Chern-Simons-matter theory is computed as an example of computational simplification at large gauge group rank.

We present a semidefinite programming algorithm to find eigenvalues of Schrödinger operators within the bootstrap approach to quantum mechanics. The bootstrap approach involves two ingredients: a nonlinear set of constraints on the variables (expectation values of operators in an energy eigenstate), plus positivity constraints (unitarity) that need to be satisfied. By fixing the energy we linearize all the constraints and show that the feasibility problem can be presented as an optimization problem for the variables that are not fixed by the constraints and one additional slack variable that measures the failure of positivity. To illustrate the method we are able to obtain high-precision, sharp bounds on eigenenergies for arbitrary confining polynomial potentials in one dimension.

We derive thermal Polyakov bootstrap equations for CFT two-point functions on

S^1_β\times\mathbb R^{d-1}

. Combining the thermal OPE with a dispersion relation and the method of images gives a representation in blocks that satisfy Kubo-Martin-Schwinger (KMS) covariance. Their local expansions contain additional thermal blocks at classical double-twist dimensions. Matching the prescribed physical OPE requires cancellation of these generated contributions, yielding explicit linear equations for thermal OPE coefficients, including any compensating terms required by the reconstruction. We formulate the equations for bosonic scalar correlators and antiperiodic scalar structures extracted from fermion correlators, and find consistent solutions in analytically tractable thermal CFTs. The coefficient matrix, which we call the Polyakov matrix, connects the large-spin expansion to KMS consistency and reduces to minus the identity on the classical double-twist spectrum. This structure suggests a numerical approach to the three-dimensional Ising CFT that combines known low-lying vacuum data with a self-consistent large-spin tail.

The paper contributes to an ongoing effort to extend the conformal bootstrap beyond its traditional focus on systems of four-point correlation functions. Recently, it was demonstrated that semidefinite programming can be used to formulate a six-point generalisation of the numerical bootstrap, yielding qualitatively new, rigorous bounds on CFT data. However, the numerical six-point bootstrap requires solving SDPs involving infinite-dimensional matrices, which has so far limited its applicability and hindered scalability in early implementations. This work overcomes the challenges by using sparse matrix decompositions to exploit the banded structure of the underlying SDP. The result is a rewriting of one-dimensional six-point bootstrap problems as effectively two-dimensional standard mixed correlator four-point bootstrap computations. As application, novel bounds whose extremal correlators interpolate between the six-point functions of the generalised free fermion and boson are derived. The extremal interpolations are matched with perturbative deformations of the massive free boson in AdS _2 2 .

The many-body bootstrap certifies ground-state properties by minimizing energy over correlators constrained only by positivity, without any variational wavefunction. Its cost, however, grows exponentially with the size of the operators involved, placing the long-range string correlators that diagnose topological phases out of reach. We overcome this by treating string operators as primary objects: bare and endpoint-dressed strings satisfy a closed operator algebra with one another and with local words, yielding a semidefinite program whose cost grows only polynomially with string length. A single computation then yields estimates of string correlators of all lengths. Rigorous two-sided bounds are obtained for each target string once the ground-state energy is pinned within a window. When benchmarked against density-matrix renormalization group computations on the cluster Ising and spin

-1

Heisenberg chains, the method certifies the nonlocal string order of the cluster and Haldane phases directly from the Hamiltonian. Our rigorous certification of string order parameters reveal that the sharpness of the bounds is set by which operators enter the calculation, not by their length alone. By exploiting algebraic closure of strings and local words, our framework lifts spatially extended observables into polynomially tractable bootstrap variables, opening up a route to wavefunction-free certification of nonlocal order in quantum many-body systems.