The variational quantum eigensolver: a review of methods and best practices

DOI10.1016/j.physrep.2022.08.003OpenAlexW3212169067MaRDI QIDQ2092477

Ying Li, George H. Booth, Jonathan Tennyson, Dario Picozzi, Kanav Setia, Jules Tilly, Shuxiang Cao, Hongxiang Chen, Edward Grant, Leonard Wossnig, Ivan Rungger

Publication date: 2 November 2022

Published in: Physics Reports (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2111.05176

zbMATH Keywords

variational methodsquantum chemistryquantum computingelectronic structuremany-body physicsnoisy intermediate scale quantum devices

Mathematics Subject Classification ID

Quantum computation (81P68) White noise theory (60H40) Research exposition (monographs, survey articles) pertaining to quantum theory (81-02) Many-body theory; quantum Hall effect (81V70) Statistical mechanics of solids (82D20) Quantum measurement theory, state operations, state preparations (81P15) Statistical mechanics of liquids (82D15) Extremal problems for conformal and quasiconformal mappings, variational methods (30C70)

Related Items (4)

Noise tailoring for robust amplitude estimation ⋮ Quantum register algebra: the mathematical language for quantum computing ⋮ A practitioner’s guide to quantum algorithms for optimisation problems ⋮ Framework for learning and control in the classical and quantum domains

Uses Software

• LBFGS-B
• Adam
• QISKit
• OpenQEMIST

Cites Work

• CheMPS2: a free open-source spin-adapted implementation of the density matrix renormalization group for ab initio quantum chemistry
• The unconstrained binary quadratic programming problem: a survey
• Fermionic quantum computation
• Performance analysis of the simultaneous perturbation stochastic approximation algorithm on the noisy sphere model
• Quantum superposition. Counterintuitive consequences of coherence, entanglement, and interference
• The worst-case time complexity for generating all maximal cliques and computational experiments
• Random generation of combinatorial structures from a uniform distribution
• The complexity of optimization problems
• A fast algorithm for coloring Meyniel graphs
• Approximating maximum independent sets by excluding subgraphs
• Theory of spin lattices and lattice gauge models. Proceedings of 165th WE-Heraeus-Seminar, Physikzentrum Bad Honnef, Germany, October 14--16, 1996
• Nested quantum search and NP-hard problems
• Simulating quantum mechanics on a quantum computer.
• Eigenvalue computation in the 20th century
• Simulating fermions on a quantum computer
• The computer as a physical system: a microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines
• Cauchy and the gradient method
• A comparison of various classical optimizers for a variational quantum linear solver
• Realization of a scalable Shor algorithm
• Quantum computations on a topologically encoded qubit
• Ab initioquantum chemistry: Methodology and applications
• Entanglement in many-body systems
• Universal Quantum Simulators
• Optimizing qubit resources for quantum chemistry simulations in second quantization on a quantum computer
• Short-range correlations in nuclear wave functions
• Grover vs. McEliece
• Classical and Quantum Information Theory
• A graph coloring algorithm for large scheduling problems
• A new graph colouring algorithm
• New methods to color the vertices of a graph
• Simulating quantum systems on a quantum computer
• Quantum algorithms revisited
• Strengths and Weaknesses of Quantum Computing
• Sample-optimal tomography of quantum states
• Solving the quantum many-body problem with artificial neural networks
• Self-consistent field, with exchange, for beryllium
• Quantum Simulations of Physics Problems
• Graph Colorings
• A Limited Memory Algorithm for Bound Constrained Optimization
• Toward the first quantum simulation with quantum speedup
• Mapping local Hamiltonians of fermions to local Hamiltonians of spins
• Efficient quantum tomography II
• Bounding the costs of quantum simulation of many-body physics in real space
• Reducibility among Combinatorial Problems
• Key Methods and Concepts in Condensed Matter Physics
• Faster quantum chemistry simulation on fault-tolerant quantum computers
• Gentle measurement of quantum states and differential privacy
• Lie Groups, Lie Algebras, and Representations
• An efficient method for finding the minimum of a function of several variables without calculating derivatives
• Efficient quantum tomography
• Quantum Walk Algorithm for Element Distinctness
• A Modern Introduction to Probability and Statistics
• Electronic Structure
• An upper bound for the chromatic number of a graph and its application to timetabling problems
• A Family of Variable-Metric Methods Derived by Variational Means
• A new approach to variable metric algorithms
• The Convergence of a Class of Double-rank Minimization Algorithms 1. General Considerations
• Conditioning of Quasi-Newton Methods for Function Minimization
• A Simplex Method for Function Minimization
• Teoria simmetrica dell’elettrone e del positrone
• On Information and Sufficiency
• Stochastic Estimation of the Maximum of a Regression Function
• The theory of variational hybrid quantum-classical algorithms
• Quantum Fisher information matrix and multiparameter estimation
• On barren plateaus and cost function locality in variational quantum algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The variational quantum eigensolver: a review of methods and best practices