Optimizing Strongly Interacting Fermionic Hamiltonians
- URL: http://arxiv.org/abs/2110.10701v4
- Date: Thu, 17 Aug 2023 19:59:11 GMT
- Title: Optimizing Strongly Interacting Fermionic Hamiltonians
- Authors: Matthew B. Hastings and Ryan O'Donnell
- Abstract summary: Fundamental problem in much of physics and quantum chemistry is to optimize a low-degree in certain anticommuting variables.
One prominent exception is when the optimum is described by a so-called "Gaussian state", also called a free fermion state.
We give an efficient classical certification algorithm for upper-bounding the largest eigenvalue in the $q=4$ SYK model, and an efficient quantum certification algorithm for lower-bounding this largest eigenvalue.
- Score: 2.1756081703276
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: The fundamental problem in much of physics and quantum chemistry is to
optimize a low-degree polynomial in certain anticommuting variables. Being a
quantum mechanical problem, in many cases we do not know an efficient classical
witness to the optimum, or even to an approximation of the optimum. One
prominent exception is when the optimum is described by a so-called "Gaussian
state", also called a free fermion state. In this work we are interested in the
complexity of this optimization problem when no good Gaussian state exists. Our
primary testbed is the Sachdev--Ye--Kitaev (SYK) model of random degree-$q$
polynomials, a model of great current interest in condensed matter physics and
string theory, and one which has remarkable properties from a computational
complexity standpoint. Among other results, we give an efficient classical
certification algorithm for upper-bounding the largest eigenvalue in the $q=4$
SYK model, and an efficient quantum certification algorithm for lower-bounding
this largest eigenvalue; both algorithms achieve constant-factor approximations
with high probability.
Related papers
- Training variational quantum circuits with CoVaR: covariance root
finding with classical shadows [0.0]
We introduce a method we call CoVaR, an alternative means to exploit the power of variational circuits.
CoVaR is directly analogous to gradient-based optimisations of paramount importance to classical machine learning.
We observe numerical simulations a very significant improvement by many orders of magnitude in convergence speed.
arXiv Detail & Related papers (2022-04-18T18:01:58Z) - Stochastic optimization algorithms for quantum applications [0.0]
We review the use of first-order, second-order, and quantum natural gradient optimization methods, and propose new algorithms defined in the field of complex numbers.
The performance of all methods is evaluated by means of their application to variational quantum eigensolver, quantum control of quantum states, and quantum state estimation.
arXiv Detail & Related papers (2022-03-11T16:17:05Z) - Quantum mean value approximator for hard integer value problems [19.4417702222583]
We show that an optimization can be improved substantially by using an approximation rather than the exact expectation.
Together with efficient classical sampling algorithms, a quantum algorithm with minimal gate count can thus improve the efficiency of general integer-value problems.
arXiv Detail & Related papers (2021-05-27T13:03:52Z) - Fixed Depth Hamiltonian Simulation via Cartan Decomposition [59.20417091220753]
We present a constructive algorithm for generating quantum circuits with time-independent depth.
We highlight our algorithm for special classes of models, including Anderson localization in one dimensional transverse field XY model.
In addition to providing exact circuits for a broad set of spin and fermionic models, our algorithm provides broad analytic and numerical insight into optimal Hamiltonian simulations.
arXiv Detail & Related papers (2021-04-01T19:06:00Z) - Training variational quantum algorithms is NP-hard [0.7614628596146599]
We show that the corresponding classical optimization problems are NP-hard.
Even for classically tractable systems composed of only logarithmically many qubits or free fermions, we show the optimization to be NP-hard.
arXiv Detail & Related papers (2021-01-18T19:00:01Z) - GEO: Enhancing Combinatorial Optimization with Classical and Quantum
Generative Models [62.997667081978825]
We introduce a new framework that leverages machine learning models known as generative models to solve optimization problems.
We focus on a quantum-inspired version of GEO relying on tensor-network Born machines.
We show its superior performance when the goal is to find the best minimum given a fixed budget for the number of function calls.
arXiv Detail & Related papers (2021-01-15T18:18:38Z) - Recent Theoretical Advances in Non-Convex Optimization [56.88981258425256]
Motivated by recent increased interest in analysis of optimization algorithms for non- optimization in deep networks and other problems in data, we give an overview of recent results of theoretical optimization algorithms for non- optimization.
arXiv Detail & Related papers (2020-12-11T08:28:51Z) - Direct Optimal Control Approach to Laser-Driven Quantum Particle
Dynamics [77.34726150561087]
We propose direct optimal control as a robust and flexible alternative to indirect control theory.
The method is illustrated for the case of laser-driven wavepacket dynamics in a bistable potential.
arXiv Detail & Related papers (2020-10-08T07:59:29Z) - Warm-starting quantum optimization [6.832341432995627]
We discuss how to warm-start quantum optimization with an initial state corresponding to the solution of a relaxation of an optimization problem.
This allows the quantum algorithm to inherit the performance guarantees of the classical algorithm.
It is straightforward to apply the same ideas to other randomized-rounding schemes and optimization problems.
arXiv Detail & Related papers (2020-09-21T18:00:09Z) - Variational Monte Carlo calculations of $\mathbf{A\leq 4}$ nuclei with
an artificial neural-network correlator ansatz [62.997667081978825]
We introduce a neural-network quantum state ansatz to model the ground-state wave function of light nuclei.
We compute the binding energies and point-nucleon densities of $Aleq 4$ nuclei as emerging from a leading-order pionless effective field theory Hamiltonian.
arXiv Detail & Related papers (2020-07-28T14:52:28Z) - Cross Entropy Hyperparameter Optimization for Constrained Problem
Hamiltonians Applied to QAOA [68.11912614360878]
Hybrid quantum-classical algorithms such as Quantum Approximate Optimization Algorithm (QAOA) are considered as one of the most encouraging approaches for taking advantage of near-term quantum computers in practical applications.
Such algorithms are usually implemented in a variational form, combining a classical optimization method with a quantum machine to find good solutions to an optimization problem.
In this study we apply a Cross-Entropy method to shape this landscape, which allows the classical parameter to find better parameters more easily and hence results in an improved performance.
arXiv Detail & Related papers (2020-03-11T13:52:41Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.