Certificates of quantum many-body properties assisted by machine learning
arXiv:2103.03830 · doi:10.1103/PhysRevResearch.5.013097
Abstract
Computationally intractable tasks are often encountered in physics and optimization. Such tasks often 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 non-convex optimization tasks. A number of standard methods are used to tackle such problems: variational approaches focus on parameterizing 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 by providing ultimate bounds to the global optimal solution. In this work, 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 the context of finding the ground state energy of many-body quantum systems, a paradigmatic problem in quantum physics. 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 generalize the approach to other common applications in the field of quantum information processing.
22 pages (12.5 + appendices), 8 figures
References in corpus (25)
- Entanglement detection
- Matrix Product States, Projected Entangled Pair States, and variational renormalization group methods for quantum spin systems
- Device-independent security of quantum cryptography against collective attacks
- Learning phase transitions by confusion
- A convergent hierarchy of semidefinite programs characterizing the set of quantum correlations
- DMRG and periodic boundary conditions: a quantum information perspective
- Bounding the set of quantum correlations
- A complete family of separability criteria
- Symmetry groups, semidefinite programs, and sums of squares
- Restricted-Boltzmann-Machine Learning for Solving Strongly Correlated Quantum Systems
- Detecting multiparticle entanglement of Dicke states
- Multipartite entanglement in spin chains
- The power of quantum systems on a line
- Almost quantum correlations
- Sum-of-squares decompositions for a family of CHSH-like inequalities and their application to self-testing
- Entanglement in fermionic systems
- Adiabatic Spectroscopy and a Variational Quantum Adiabatic Algorithm
- Graph states as ground states of many-body spin-1/2 Hamiltonians
- Separability of diagonal symmetric states: a quadratic conic optimization problem
- Regional versus Global Entanglement in Resonating-Valence-Bond states
- Detection of multipartite entanglement with two-body correlations
- Entangled symmetric states and copositive matrices
- A variational lower bound on the ground state of a many-body system and the squaring parametrization of density matrices
- Fast semidefinite programming with feedforward neural networks
- Comment on "Regional Versus Global Entanglement in Resonating-Valence-Bond States"