We introduce a sum-of-squares SDP hierarchy approximating the ground-state energy from below for quantum many-body problems, with a natural quantum embedding interpretation. We establish the connections between our approach and other variational methods for lower bounds, including the variational embedding, the RDM method in quantum chemistry, and the Anderson bounds. Additionally, inspired by the quantum information theory, we propose efficient strategies for optimizing cluster selection to tighten SDP relaxations while staying within a computational budget. Numerical experiments are presented to demonstrate the effectiveness of our strategy. As a byproduct of our investigation, we find that quantum entanglement has the potential to capture the underlying graph of the many-body Hamiltonian.
We introduce a sum-of-squares SDP hierarchy approximating the ground-state energy from below for quantum many-body problems, with a natural quantum embedding interpretation. We establish the connections between our approach and other variational methods for lower bounds, including the variational embedding, the RDM method in quantum chemistry, and the Anderson bounds. Additionally, inspired by the quantum information theory, we propose efficient strategies for optimizing cluster selection to tighten SDP relaxations while staying within a computational budget. Numerical experiments are presented to demonstrate the effectiveness of our strategy. As a byproduct of our investigation, we find that quantum entanglement has the potential to capture the underlying graph of the many-body Hamiltonian.
Convex relaxation hierarchies provide lower bounds to the ground state energy of quantum many-body systems that can be computed in polynomial time on a classical computer, at any fixed hierarchy level. However, scaling these methods to large systems and accurate approximations remains challenging due to the computational cost of traditional solvers and the scarcity of efficiency guarantees. In this work, we develop local relaxation hierarchies and efficient, highly parallelisable message passing algorithms for estimating the relaxed ground state energies. We show that the first level of the hierarchy---based on local consistency of pairwise reduced density matrices---is exact for commuting Hamiltonians on trees. We further establish that another hierarchy, based on consistent intervals, converges exponentially fast in the interval size to the ground state energy for weak perturbations of separable Hamiltonians on a chain, thereby providing an efficient classical algorithm for these systems. Then, we introduce two variants of message passing algorithms that run in O(n/ε2) and O(n/ε) time for any fixed level of the local hierarchy on bounded-degree graphs, where ε is the precision for the relaxed ground state energy per site. This assumes that the optimal messages have O(1) norm---a condition we observe in practical settings in our experiments. These algorithms are based on the subgradient method and the Nesterov-type accelerated gradient descent method applied to an entropy-smoothed objective. Finally, we benchmark the message passing algorithms across different quantum Hamiltonians, lattice geometries, and relaxation levels, validating the theoretical predictions and their potential to surpass standard convex optimisation solvers for this problem. We release the resulting library at github.com/rick1924/gse-message-passing.
Variational methods play an important role in the study of quantum many-body problems, both in the flavor of classical variational principles based on tensor networks as well as of quantum variational principles in near-term quantum computing. This work stresses that for translationally invariant lattice Hamiltonians with periodic boundary conditions, one can easily derive efficiently computable lower bounds to ground state energies that can and should be compared with variational principles providing upper bounds. As small technical results, it is shown that (i) the Anderson bound and a (ii) common hierarchy of semidefinite relaxations both provide approximations with performance guarantees that scale as a constant in the energy density for cubic lattices. (iii) Also, the Anderson bound is systematically improved as a hierarchy of semidefinite relaxations inspired by the quantum marginal problem.
Given a renormalization scheme, we show how to formulate a tractable convex relaxation of the set of feasible local density matrices of a many-body quantum system. The relaxation is obtained by introducing a hierarchy of constraints between the reduced states of ever-growing sets of lattice sites. The coarse-graining maps of the underlying renormalization procedure serve to eliminate a vast number of those constraints, such that the remaining ones can be enforced with reasonable computational means. This process can be used to obtain rigorous lower bounds on the ground-state energy of arbitrary local Hamiltonians by performing a linear optimization over the resulting convex relaxation of reduced quantum states. The quality of the bounds crucially depends on the particular renormalization scheme, which must be tailored to the target Hamiltonian. We apply our method to 1D translation-invariant spin models, obtaining energy bounds comparable to those attained by optimizing over locally translation-invariant states of n≳100 spins. Beyond this demonstration, the general method can be applied to a wide range of other problems, such as spin systems in higher spatial dimensions, electronic structure problems, and various other many-body optimization problems, such as entanglement and nonlocality detection. Published by the American Physical Society 2024
A variational upper bound on the ground state energy E gs of a quantum system, E gs ⩽ 〈Ψ| H |Ψ〉, is well-known (here H is the Hamiltonian of the system and Ψ is an arbitrary wave function). Much less known are variational lower bounds on the ground state. We consider one such bound which is valid for a many-body translation-invariant lattice system. Such a lattice can be divided into clusters which are identical up to translations. The Hamiltonian of such a system can be written as , where a term H i is supported on the i 'th cluster. The bound reads , where is some wisely chosen set of reduced density matrices of a single cluster. The implementation of this latter variational principle can be hampered by the difficulty of parameterizing the set , which is a necessary prerequisite for a variational procedure. The root cause of this difficulty is the nonlinear positivity constraint ρ > 0 which is to be satisfied by a density matrix. The squaring parametrization of the density matrix, ρ = τ 2 /tr τ 2 , where τ is an arbitrary (not necessarily positive) Hermitian operator, accounts for positivity automatically. We discuss how the squaring parametrization can be utilized to find variational lower bounds on ground states of translation-invariant many-body systems. As an example, we consider a one-dimensional Heisenberg antiferromagnet.
Computationally intractable tasks are often encountered in physics and optimization. They usually comprise a cost function to be optimized over a so-called feasible set, which is specified by a set of constraints. This may yield, in general, to difficult and nonconvex optimization tasks. A number of standard methods are used to tackle such problems: variational approaches focus on parametrizing a subclass of solutions within the feasible set. In contrast, relaxation techniques have been proposed to approximate it from outside, thus complementing the variational approach to provide ultimate bounds to the global optimal solution. In this paper, we propose a novel approach combining the power of relaxation techniques with deep reinforcement learning in order to find the best possible bounds within a limited computational budget. We illustrate the viability of the method in two paradigmatic problems in quantum physics and quantum information processing: finding the ground state energy of many-body quantum systems, and building energy-based entanglement witnesses of quantum local Hamiltonians. We benchmark our approach against other classical optimization algorithms such as breadth-first search or Monte Carlo, and we characterize the effect of transfer learning. We find the latter may be indicative of phase transitions with a completely autonomous approach. Finally, we provide tools to tackle other common applications in the field of quantum information processing with our method.