Recent Developments in VQE: Survey and Benchmarking

• URL: http://arxiv.org/abs/2602.11384v1
• Date: Wed, 11 Feb 2026 21:24:32 GMT
• Title: Recent Developments in VQE: Survey and Benchmarking
• Authors: Taylor Harville, Rishu Khurana, Vitor F. Grizzi, Cong Liu,
• Abstract summary: The Variational Quantum Eigensolver (VQE) algorithm has been developed to target near term Noisy Intermediate Scale Quantum computers.<n>Unlike fully quantum algorithms such as Quantum Phase Estimation (QPE), VQE based methods are hybrid algorithms that utilize both quantum and classical hardware.
• Score: 4.160386640883404
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The Variational Quantum Eigensolver (VQE) algorithm has been developed to target near term Noisy Intermediate Scale Quantum (NISQ) computers as a method to find the eigenvalues of Hamiltonians. Unlike fully quantum algorithms such as Quantum Phase Estimation (QPE), VQE based methods are hybrid algorithms that utilize both quantum and classical hardware to combat issues with the near term quantum hardware such as small numbers of available qubits and the decoherence of qubits. Different adaptations (flavors) of VQE have been implemented to combat these scalability issues on NISQ devices compared to standard VQE. These different flavors are modifications of the underlying VQE ansatz to reduce the computational workload on the quantum hardware. In this review we focus on 3 main areas related to VQE. The first focus is on flavors of VQE that fall under the categories of circuit complexity reduction, chemistry inspired ansatz, and extensions of VQE to excited states. The remaining portion of the review focuses on benchmarking the accuracy of VQE methods and an overview of the current state of quantum simulators.

Related papers

• Hybrid Quantum Algorithms for Computational Chemistry: Application to the Pyridine-Li ion Complex [0.0]
  Three quantum algorithms are investigated for capturing electron correlation in large-scale molecular systems.<n>Results show how new generations of hybrid quantum-classical frameworks overcome the scalability and noise sensitivity that constrain conventional VQE approaches.<n>Both SQD and HI-VQE exhibit robustness against hardware noise, a critical improvement over earlier approaches.
  arXiv  Detail & Related papers  (2026-01-15T02:23:09Z)
• Adiabatic-Inspired Hybrid Quantum-Classical Methods for Molecular Ground State Preparation [0.03499870393443268]
  Quantum computing promises to efficiently and accurately solve important problems in quantum chemistry.<n>Two leading methods in solving the ground-state problem of quantum computing struggle with convergence.<n>We introduce a novel hybrid approach which generalizes the AQC-PQC method and combines abaticatic BFGS, reducing the quantum computational cost.
  arXiv  Detail & Related papers  (2025-12-16T14:35:58Z)
• Excited-CAFQA: A classical simulation bootstrap for the variational estimation of molecular excited states [0.0]
  Variational Quantum Algorithms (VQAs) are iterative algorithms suited to implementation on current-era quantum devices.<n>CAFQA protocol runs a discrete search through a classically simulatable subset of the entire state space.<n> Excited-CAFQA achieves 90 to 99+% accuracy across a variety of bond lengths and excited states for H2 and HeH+ molecular systems.
  arXiv  Detail & Related papers  (2025-09-24T22:01:23Z)
• Warm-Starting the VQE with Approximate Complex Amplitude Encoding [0.26217304977339473]
  The Variational Quantum Eigensolver (VQE) is a quantum algorithm to determine the ground state of quantum-mechanical systems. We propose a warm-starting technique, that utilizes an approximation to generate beneficial initial parameter values for the VQE. Such warm-starts open the path to fruitful combinations of classical approximation algorithms and quantum algorithms.
  arXiv  Detail & Related papers  (2024-02-27T10:15:25Z)
• Quantum Subroutine for Variance Estimation: Algorithmic Design and Applications [80.04533958880862]
  Quantum computing sets the foundation for new ways of designing algorithms. New challenges arise concerning which field quantum speedup can be achieved. Looking for the design of quantum subroutines that are more efficient than their classical counterpart poses solid pillars to new powerful quantum algorithms.
  arXiv  Detail & Related papers  (2024-02-26T09:32:07Z)
• QNEAT: Natural Evolution of Variational Quantum Circuit Architecture [95.29334926638462]
  We focus on variational quantum circuits (VQC), which emerged as the most promising candidates for the quantum counterpart of neural networks. Although showing promising results, VQCs can be hard to train because of different issues, e.g., barren plateau, periodicity of the weights, or choice of architecture. We propose a gradient-free algorithm inspired by natural evolution to optimize both the weights and the architecture of the VQC.
  arXiv  Detail & Related papers  (2023-04-14T08:03:20Z)
• Quantum Imitation Learning [74.15588381240795]
  We propose quantum imitation learning (QIL) with a hope to utilize quantum advantage to speed up IL. We develop two QIL algorithms, quantum behavioural cloning (Q-BC) and quantum generative adversarial imitation learning (Q-GAIL) Experiment results demonstrate that both Q-BC and Q-GAIL can achieve comparable performance compared to classical counterparts.
  arXiv  Detail & Related papers  (2023-04-04T12:47:35Z)
• Quantum circuit architecture search on a superconducting processor [56.04169357427682]
  Variational quantum algorithms (VQAs) have shown strong evidences to gain provable computational advantages for diverse fields such as finance, machine learning, and chemistry. However, the ansatz exploited in modern VQAs is incapable of balancing the tradeoff between expressivity and trainability. We demonstrate the first proof-of-principle experiment of applying an efficient automatic ansatz design technique to enhance VQAs on an 8-qubit superconducting quantum processor.
  arXiv  Detail & Related papers  (2022-01-04T01:53:42Z)
• Variational Quantum Eigensolver with Reduced Circuit Complexity [3.1158760235626946]
  We present a novel approach to reduce quantum circuit complexity in VQE for electronic structure calculations. Our algorithm, called ClusterVQE, splits the initial qubit space into subspaces (qubit clusters) which are further distributed on individual quantum circuits. The new algorithm simultaneously reduces the number of qubits and circuit depth, making it a potential leader for quantum chemistry simulations on NISQ devices.
  arXiv  Detail & Related papers  (2021-06-14T17:23:46Z)
• Efficient measure for the expressivity of variational quantum algorithms [72.59790225766777]
  We exploit an advanced tool in statistical learning theory, i.e., covering number, to study the expressivity of variational quantum algorithms. We first exhibit how the expressivity of VQAs with an arbitrary ansatze is upper bounded by the number of quantum gates and the measurement observable. We then explore the expressivity of VQAs on near-term quantum chips, where the system noise is considered.
  arXiv  Detail & Related papers  (2021-04-20T13:51:08Z)
• Quantum circuit architecture search for variational quantum algorithms [88.71725630554758]
  We propose a resource and runtime efficient scheme termed quantum architecture search (QAS) QAS automatically seeks a near-optimal ansatz to balance benefits and side-effects brought by adding more noisy quantum gates. We implement QAS on both the numerical simulator and real quantum hardware, via the IBM cloud, to accomplish data classification and quantum chemistry tasks.
  arXiv  Detail & Related papers  (2020-10-20T12:06:27Z)

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.