In recent years, Variational Quantum Algorithms (VQAs) have emerged as a promising approach for solving optimization problems on quantum computers in the NISQ era. However, one limitation of VQAs is their reliance on fixed-structure circuits, which may not be taylored for specific problems or hardware configurations. A leading strategy to address this issue are Adaptative VQAs, which dynamically modify the circuit structure by adding and removing gates, and optimize their parameters during the training. Several Adaptative VQAs, based on heuristics such as circuit shallowness, entanglement capability and hardware compatibility, have already been proposed in the literature, but there is still lack of a systematic comparison between the different methods. In this paper, we aim to fill this gap by analyzing three Adaptative VQAs: Evolutionary Variational Quantum Eigensolver (EVQE), Variable Ansatz (VAns), already proposed in the literature, and Random Adapt-VQE (RA-VQE), a random approach we introduce as a baseline. In order to compare these algorithms to traditional VQAs, we also include the Quantum Approximate Optimization Algorithm (QAOA) in our analysis. We apply these algorithms to QUBO problems and study their performance by examining the quality of the solutions found and the computational times required. Additionally, we investigate how the choice of the hyperparameters can impact the overall performance of the algorithms, highlighting the importance of selecting an appropriate methodology for hyperparameter tuning. Our analysis sets benchmarks for Adaptative VQAs designed for near-term quantum devices and provides valuable insights to guide future research in this area.
In recent years, Variational Quantum Algorithms (VQAs) have emerged as a promising approach for solving optimization problems on quantum computers in the NISQ era. However, one limitation of VQAs is their reliance on fixed-structure circuits, which may not be taylored for specific problems or hardware configurations. A leading strategy to address this issue are Adaptative VQAs, which dynamically modify the circuit structure by adding and removing gates, and optimize their parameters during the training. Several Adaptative VQAs, based on heuristics such as circuit shallowness, entanglement capability and hardware compatibility, have already been proposed in the literature, but there is still lack of a systematic comparison between the different methods. In this paper, we aim to fill this gap by analyzing three Adaptative VQAs: Evolutionary Variational Quantum Eigensolver (EVQE), Variable Ansatz (VAns), already proposed in the literature, and Random Adapt-VQE (RA-VQE), a random approach we introduce as a baseline. In order to compare these algorithms to traditional VQAs, we also include the Quantum Approximate Optimization Algorithm (QAOA) in our analysis. We apply these algorithms to QUBO problems and study their performance by examining the quality of the solutions found and the computational times required. Additionally, we investigate how the choice of the hyperparameters can impact the overall performance of the algorithms, highlighting the importance of selecting an appropriate methodology for hyperparameter tuning. Our analysis sets benchmarks for Adaptative VQAs designed for near-term quantum devices and provides valuable insights to guide future research in this area.
Variational Quantum Algorithms are a major method of harnessing Noisy Intermediate-Scale Quantum devices to solve classically intractable problems in physics, chemistry, optimization, and machine learning. The current review offers a critical overview of VQAs, with special emphasis on their theoretical backgrounds, algorithmic structures, and application performance within realistic models of noise. Several key variants, such as the Variational Quantum Eigensolver, Quantum Approximate Optimization Algorithm, and Quantum Neural Networks, are compared in terms of noise robustness, ansatz archi- tecture, and hybrid quantum-classical methods of optimization. Benchmarks in fields such as quantum chemistry, finance modeling, and particles and nuclei physics reveal the poten- tial of VQAs in achieving practical quantum advantage. Fundamentally limiting factors 1such as barren plateaus, optimization overhead, and hardware constraints are considered in addition to mitigation strategies, including adaptive construction of ansatz, informed training in the presence of noise, and quantum error correction using QVECTOR. The paper is concluded with an overview of the scalability and future of VQAs in the direction of transitioning toward fault-tolerant quantum computing.
Variational quantum algorithms (VQAs) are a leading framework for realizing quantum advantages in the Noisy Intermediate-Scale Quantum (NISQ) era, with applications spanning discrete combinatorial problems and continuous optimization. While the topologies of parameterized quantum circuits (ansatzes) fundamentally govern both expressibility and trainability in continuous landscapes, existing reviews predominantly focus on static algorithmic classifications or discrete settings, leaving the structural evolution and practical limitations of ansatz architectures insufficiently explored. To address this gap, this review presents a systematic analysis of variational ansatz architectures, tracing their progression from static, pre-defined topologies to adaptive growth mechanisms. Beyond traditional gradient-driven and architecture-search paradigms, we evaluate supplementary strategies such as layerwise training and noise-adaptive construction, revealing inherent vulnerabilities such as local minima entrapment and the compilation overhead induced by calibration drift. The mathematical foundations of VQAs are outlined, and representative fixed ansatz architectures, including hardware-efficient, physics-inspired, and problem-specific designs, are characterized within continuous-domain mappings. Intrinsic limitations arising from barren plateaus (BPs) and noise-induced barren plateaus (NIBPs) are analyzed, revealing the fundamental coupling between circuit depth, parameter scaling, and trainability degradation. Furthermore, adaptive construction strategies and recent advances in automated variational quantum architecture search (VQAS) are examined. Through the synthesis of intrinsic limitations (BPs, NIBPs, and hardware-algorithm coupling) and the evaluation of standardized benchmarking protocols, this review rigorously assesses the resource trade-offs of current VQA frameworks. Ultimately, next-generation ansatz design will adopt hardware–software co-design principles grounded in physical constraints, enabling scalable and noise-resilient quantum optimization.
Variational Quantum Algorithms (VQAs) provide a promising framework for solving electronic structure problems using the computational capabilities of quantum computers to explore high-dimensional Hilbert spaces efficiently. This research investigates the performance of VQAs in electronic structure calculations of gallium arsenide (GaAs), a semiconductor with a zinc-blende structure. Utilizing a tight-binding Hamiltonian and a Jordan-Wigner-like transformation, we map the problem to a 10-qubit Hamiltonian. We analyze the impact of quantum circuit architectures, algorithm hyperparameters, and optimization methods on two VQAs: Variational Quantum Deflation (VQD) and Subspace Search Variational Quantum Eigensolver (SSVQE). We observed that while both algorithms offer promising results, the choice of ansatz and hyperparameter tuning were especially critical in achieving reliable outcomes, particularly for higher energy states. Adjusting the hyperparameters in VQD significantly enhanced the accuracy of higher energy state calculations, reducing the error by an order of magnitude, whereas tuning the hyperparameters in SSVQE had minimal impact. Our findings provide insights into optimizing VQAs for electronic structure problems, paving the way for their application to more complex systems on near-term quantum devices.
In the noisy near-term quantum computing era variational quantum algorithms are promising to explore the boundaries of quantum advantage. One prevalent instance is the variational quantum eigensolver (VQE) employed in quantum chemistry to approximate ground-state energies of molecules. The performance of VQE depends on the design of the parametrized quantum circuit, as well as the optimization algorithm used to optimize those parameters. Circuit optimization methods have been developed to generate quantum circuits to reach accurate approximations to the ground-states. In this work, we conduct an empirical comparison between two prominent adaptive quantum circuit optimization algorithms, namely qubit-ADAPT-VQE and a reinforcement learning (RL) based method, on the problem of finding the ground state energy of Lithium Hydride (LiH). In our experiment, we focus on the circuit depth generated by each circuit optimization method and the number of two-qubit quantum gates in the best-found circuit.
Variational Quantum Algorithms (VQAs) are promising methods for solving combinatorial optimization problems on noisy intermediate-scale quantum (NISQ) devices. However, benchmarking VQAs is difficult due to their stochastic behavior and the lack of standardized performance criteria. This work introduces a general framework for evaluating VQAs applied to Quadratic Unconstrained Binary Optimization (QUBO) problems. The framework uses three complementary metrics: feasibility, quality, and reproducibility. It also introduces a quality diagram that visualizes trade-offs between success probability and computational resources. Reproducibility is formalized using Shannon entropy, and a decision rule is defined for selecting algorithms under resource constraints. As a demonstration, the framework is applied to several VQAs using Conditional Value at Risk (CVaR) cost functions and different shot counts on a 16-qubit QUBO instance. The results show how the framework supports systematic benchmarking and provides a foundation for adaptive algorithm selection in hybrid quantum-classical workflows.
Variational quantum algorithms (VQAs) offer a promising path toward using near-term quantum hardware for applications in academic and industrial research. These algorithms aim to find approximate solutions to quantum problems by optimizing a parametrized quantum circuit using a classical optimization algorithm. A successful VQA requires fast and reliable classical optimization algorithms. Understanding and optimizing how off-the-shelf optimization methods perform in this context is important for the future of the field. In this work, we study the performance of four commonly used gradient-free optimization methods [sequential least-squares quadratic programming, constrained optimization by linear approximations, the covariance matrix adaptation evolutionary strategy (CMA-ES), and the simultaneous perturbation stochastic approximation (SPSA)] to find ground-state energies of a range of small chemistry and material science problems. We test a telescoping sampling scheme (where the accuracy of the cost-function estimate provided to the optimizer is increased as the optimization converges) for all methods, demonstrating mixed results across our range of optimizers and problems chosen. We further hyperparameter tune two of the four optimizers (CMA-ES and SPSA) across a large range of models and demonstrate that with appropriate hyperparameter tuning, CMA-ES is competitive with and sometimes outperforms SPSA (which is not observed in the absence of hyperparameter tuning). Finally, we investigate the ability of an optimizer to beat the ``sampling-noise floor'' given by the sampling noise of each cost-function estimate provided to the optimizer. Our results demonstrate the necessity for tailoring and hyperparameter tuning known optimization techniques for inherently noisy variational quantum algorithms and that the variational landscape that one finds in a VQA is highly problem and system dependent. This provides guidance for future implementations of these algorithms in experiments.