Optimization Strategies for Variational Quantum Algorithms in Noisy Landscapes

• URL: http://arxiv.org/abs/2506.01715v2
• Date: Sat, 27 Sep 2025 14:39:45 GMT
• Title: Optimization Strategies for Variational Quantum Algorithms in Noisy Landscapes
• Authors: Vojtěch Novák, Ivan Zelinka, Václav Snášel,
• Abstract summary: Variational Quantum Algorithms (VQAs) are a leading approach for near-term quantum computing.<n>We benchmarked more than fifty metaheuristic algorithms for the Variational Quantumsolver (VQE)<n>Results identify a small set of resilient algorithms for noisy VQE and provide guidance for optimization strategies on near-term quantum devices.
• Score: 0.061173711613792085
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Variational Quantum Algorithms (VQAs) are a leading approach for near-term quantum computing but face major optimization challenges from noise, barren plateaus, and complex energy landscapes. We benchmarked more than fifty metaheuristic algorithms for the Variational Quantum Eigensolver (VQE) using a three-phase procedure: initial screening on the Ising model, scaling tests up to nine qubits, and convergence on a 192-parameter Hubbard model. Landscape visualizations revealed that smooth convex basins in noiseless settings become distorted and rugged under finite-shot sampling, explaining the failure of gradient-based local methods. Across models, CMA-ES and iL-SHADE consistently achieved the best performance, while Simulated Annealing (Cauchy), Harmony Search, and Symbiotic Organisms Search also showed robustness. In contrast, widely used optimizers such as PSO, GA, and standard DE variants degraded sharply with noise. These results identify a small set of resilient algorithms for noisy VQE and provide guidance for optimization strategies on near-term quantum devices.

Related papers

• Reliable Optimization Under Noise in Quantum Variational Algorithms [0.05219568203653522]
  We show that Variational Quantum Eigensolver is severely challenged by finite-shot sampling noise.<n>We identify adaptive metaheuristics as the most effective and resilient strategies.
  arXiv  Detail & Related papers  (2025-11-11T14:21:43Z)
• Statistical Benchmarking of Optimization Methods for Variational Quantum Eigensolver under Quantum Noise [0.0]
  This work investigates the performance of numerical optimization algorithms applied to the State-Averaged Orbital-d Variational Quantum Eigensolver for the H2 molecule.<n>The goal is to assess the stability, accuracy, and computational efficiency of commonly used gradient-based, gradient-free, and global optimization strategies within the Noisy Intermediate-Scale Quantum regime.
  arXiv  Detail & Related papers  (2025-10-09T18:34:11Z)
• A Noise-Aware Scalable Subspace Classical Optimizer for the Quantum Approximate Optimization Algorithm [0.9086201982977716]
  ANASTAARS is a noise-aware scalable classical algorithm for variational quantum algorithms.<n>It exploits adaptive random subspace strategies to efficiently optimize the ansatz parameters of a quantum approximate optimization algorithm.
  arXiv  Detail & Related papers  (2025-07-15T05:15:25Z)
• VQC-MLPNet: An Unconventional Hybrid Quantum-Classical Architecture for Scalable and Robust Quantum Machine Learning [60.996803677584424]
  Variational Quantum Circuits (VQCs) offer a novel pathway for quantum machine learning.<n>Their practical application is hindered by inherent limitations such as constrained linear expressivity, optimization challenges, and acute sensitivity to quantum hardware noise.<n>This work introduces VQC-MLPNet, a scalable and robust hybrid quantum-classical architecture designed to overcome these obstacles.
  arXiv  Detail & Related papers  (2025-06-12T01:38:15Z)
• RhoDARTS: Differentiable Quantum Architecture Search with Density Matrix Simulations [44.13836547616739]
  Variational Quantum Algorithms (VQAs) are a promising approach to leverage Noisy Intermediate-Scale Quantum (NISQ) computers.<n> choosing optimal quantum circuits that efficiently solve a given VQA problem is a non-trivial task.<n>Quantum Architecture Search (QAS) algorithms enable automatic generation of quantum circuits tailored to the provided problem.
  arXiv  Detail & Related papers  (2025-06-04T08:30:35Z)
• Provably Robust Training of Quantum Circuit Classifiers Against Parameter Noise [49.97673761305336]
  Noise remains a major obstacle to achieving reliable quantum algorithms.<n>We present a provably noise-resilient training theory and algorithm to enhance the robustness of parameterized quantum circuit classifiers.
  arXiv  Detail & Related papers  (2025-05-24T02:51:34Z)
• Bayesian Parameterized Quantum Circuit Optimization (BPQCO): A task and hardware-dependent approach [49.89480853499917]
  Variational quantum algorithms (VQA) have emerged as a promising quantum alternative for solving optimization and machine learning problems. In this paper, we experimentally demonstrate the influence of the circuit design on the performance obtained for two classification problems. We also study the degradation of the obtained circuits in the presence of noise when simulating real quantum computers.
  arXiv  Detail & Related papers  (2024-04-17T11:00:12Z)
• Variational Quantum Multi-Objective Optimization [5.381539115778766]
  We present a variational quantum optimization algorithm to solve discrete multi-objective optimization problems on quantum computers. We show the effectiveness of the proposed algorithm on several benchmark problems with up to five objectives.
  arXiv  Detail & Related papers  (2023-12-21T18:59:21Z)
• QAOA Performance in Noisy Devices: The Effect of Classical Optimizers and Ansatz Depth [0.32985979395737786]
  The Quantum Approximate Optimization Algorithm (QAOA) is a variational quantum algorithm for Near-term Intermediate-Scale Quantum computers (NISQ) This paper presents an investigation into the impact realistic noise on the classical vectors. We find that while there is no significant difference in the performance of classicals in a state simulation, the Adam and AMSGrads perform best in the presence of shot noise.
  arXiv  Detail & Related papers  (2023-07-19T17:22:44Z)
• Greedy Gradient-free Adaptive Variational Quantum Algorithms on a Noisy Intermediate Scale Quantum Computer [0.6020414684573572]
  Hybrid quantum-classical adaptive Vari Quantum Eigensolvers (VQE) hold the potential to outperform classical computing for many-body quantum systems.<n>We introduce an adaptive algorithm using analytic, gradient-free optimization, called Greedy Gradient-free Adaptive VQE (GGA-VQE)<n>We execute GGA-VQE on a 25-qubit error-mitigated quantum circuit yielding a favorable ground-state approximation.
  arXiv  Detail & Related papers  (2023-06-29T17:58:02Z)
• A Review on Quantum Approximate Optimization Algorithm and its Variants [47.89542334125886]
  The Quantum Approximate Optimization Algorithm (QAOA) is a highly promising variational quantum algorithm that aims to solve intractable optimization problems. This comprehensive review offers an overview of the current state of QAOA, encompassing its performance analysis in diverse scenarios. We conduct a comparative study of selected QAOA extensions and variants, while exploring future prospects and directions for the algorithm.
  arXiv  Detail & Related papers  (2023-06-15T15:28:12Z)
• Optimizing Variational Quantum Algorithms with qBang: Efficiently Interweaving Metric and Momentum to Navigate Flat Energy Landscapes [0.0]
  Variational quantum algorithms (VQAs) represent a promising approach to utilizing current quantum computing infrastructures. We propose the quantum Broyden adaptive natural gradient (qBang) approach, a novel that aims to distill the best aspects of existing approaches.
  arXiv  Detail & Related papers  (2023-04-27T00:06:48Z)
• 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)
• Performance comparison of optimization methods on variational quantum algorithms [2.690135599539986]
  Variational quantum algorithms (VQAs) offer a promising path towards using near-term quantum hardware for applications in academic and industrial research. We study the performance of four commonly used gradient-free optimization methods: SLSQP, COBYLA, CMA-ES, and SPSA.
  arXiv  Detail & Related papers  (2021-11-26T12:13:20Z)
• The Variational Quantum Eigensolver: a review of methods and best practices [3.628860803653535]
  The variational quantum eigensolver (or VQE) uses the variational principle to compute the ground state energy of a Hamiltonian. This review aims to provide an overview of the progress that has been made on the different parts of the algorithm.
  arXiv  Detail & Related papers  (2021-11-09T14:40:18Z)
• Quantum algorithms for quantum dynamics: A performance study on the spin-boson model [68.8204255655161]
  Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator. variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware. We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
  arXiv  Detail & Related papers  (2021-08-09T18:00:05Z)
• Variational Quantum Optimization with Multi-Basis Encodings [62.72309460291971]
  We introduce a new variational quantum algorithm that benefits from two innovations: multi-basis graph complexity and nonlinear activation functions. Our results in increased optimization performance, two increase in effective landscapes and a reduction in measurement progress.
  arXiv  Detail & Related papers  (2021-06-24T20:16:02Z)
• 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)
• Adaptive pruning-based optimization of parameterized quantum circuits [62.997667081978825]
  Variisy hybrid quantum-classical algorithms are powerful tools to maximize the use of Noisy Intermediate Scale Quantum devices. We propose a strategy for such ansatze used in variational quantum algorithms, which we call "Efficient Circuit Training" (PECT) Instead of optimizing all of the ansatz parameters at once, PECT launches a sequence of variational algorithms.
  arXiv  Detail & Related papers  (2020-10-01T18:14:11Z)
• Classical Optimizers for Noisy Intermediate-Scale Quantum Devices [1.43494686131174]
  We present a collection of tunings tuned for usage on Noisy Intermediate-Scale Quantum (NISQ) devices. We analyze the efficiency and effectiveness of different minimizes in a VQE case study. While most results to date concentrated on tuning the quantum VQE circuit, we show that, in the presence of quantum noise, the classical minimizer step needs to be carefully chosen to obtain correct results.
  arXiv  Detail & Related papers  (2020-04-06T21:31:22Z)
• 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.