REVIEW 2 cited by
A Semidefinite Programming algorithm for the Quantum Mechanical Bootstrap
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
We present a semidefinite program (SDP) algorithm to find eigenvalues of Schr\"{o}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 feasability 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 1-D.
Forward citations
Cited by 2 Pith papers
-
Stationarity is not enough: tightness of the quantum mechanical bootstrap and the copositive cone
The stationary quantum bootstrap is provably not tight in two dimensions, while the eigenstate bootstrap appears to remain tight in the tested settings.
-
Bootstrapping periodic quantum systems
A bootstrap method that includes the translation operator and uses reality conditions computes accurate Bloch-band dispersion relations for the cosine potential without positivity constraints.
Discussion (0). Continue with ORCID to comment.