HOPSO: A Robust Classical Optimizer for VQE

• URL: http://arxiv.org/abs/2508.13651v1
• Date: Tue, 19 Aug 2025 09:01:30 GMT
• Title: HOPSO: A Robust Classical Optimizer for VQE
• Authors: Ijaz Ahamed Mohammad, Yury Chernyak, Martin Plesch,
• Abstract summary: Variational Quantum Eigensolver (VQE) is one of few approaches where the hope for near-term quantum advantage concentrates.<n>We show that a properly tailored classical part of VQE algorithms can tackle with current problems and gives hope for its scalability for larger systems.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Variational Quantum Eigensolver (VQE) algorithm is one of few approaches where the hope for near-term quantum advantage concentrates. However, they face challenges connected with measurement stochastic noise, barren plateaus, and optimization difficulties in periodic parameter spaces. While most of the efforts concentrates on optimizing the quantum part of the procedure, here we aim to enhance the classical optimization by utilizing a modified version of Harmonic Oscillator-based Particle Swarm Optimization (HOPSO). By adapting its dynamics to respect the periodicity of quantum parameters and enhance noise resilience, we show its strengths on hydrogen (H2) and lithium hydride (LiH) molecules modeled as 4- and 8-qubit Hamiltonians. HOPSO achieves competitive ground-state energy approximations and demonstrates improved robustness compared to COBYLA, Differential Evolution (DE), and standard Particle Swarm Optimization (PSO) methods in all situations and outperforms other methods under realistic noise conditions. These results suggest that a properly tailored classical part of VQE algorithms can tackle with current problems and gives hope for its scalability for larger systems.

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)
• TensoMeta-VQC: A Tensor-Train-Guided Meta-Learning Framework for Robust and Scalable Variational Quantum Computing [60.996803677584424]
  TensoMeta-VQC is a novel tensor-train (TT)-guided meta-learning framework designed to improve the robustness and scalability of VQC significantly.<n>Our framework fully delegates the generation of quantum circuit parameters to a classical TT network, effectively decoupling optimization from quantum hardware.
  arXiv  Detail & Related papers  (2025-08-01T23:37:55Z)
• Optimization Strategies for Variational Quantum Algorithms in Noisy Landscapes [0.196629787330046]
  Variational Quantum Eigensolver (VQE) approximates molecular ground-state energies by minimizing a Hamiltonian.<n>VQE contributes to condensed matter physics by exploring quantum phase transitions and exotic states.<n>This study systematically evaluates over 50 meta-heuristic optimization algorithms including evolution-based, swarm-based, and music-inspired methods.
  arXiv  Detail & Related papers  (2025-06-02T14:22:30Z)
• Optimizing Unitary Coupled Cluster Wave Functions on Quantum Hardware: Error Bound and Resource-Efficient Optimizer [0.0]
  We study the projective quantum eigensolver (PQE) approach to optimizing unitary coupled cluster wave functions on quantum hardware.<n>We derive a bound relating off-diagonal coefficients (residues) of the Hamiltonian to the energy error of the algorithm and the overlap achieved by the obtained wavefunction.
  arXiv  Detail & Related papers  (2024-10-19T15:03:59Z)
• 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)
• Challenges of variational quantum optimization with measurement shot noise [0.0]
  We study the scaling of the quantum resources to reach a fixed success probability as the problem size increases. Our results suggest that hybrid quantum-classical algorithms should possibly avoid a brute force classical outer loop.
  arXiv  Detail & Related papers  (2023-07-31T18:01:15Z)
• A self-consistent field approach for the variational quantum eigensolver: orbital optimization goes adaptive [52.77024349608834]
  We present a self consistent field approach (SCF) within the Adaptive Derivative-Assembled Problem-Assembled Ansatz Variational Eigensolver (ADAPTVQE) This framework is used for efficient quantum simulations of chemical systems on nearterm quantum computers.
  arXiv  Detail & Related papers  (2022-12-21T23:15:17Z)
• 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)
• 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)
• Benchmarking adaptive variational quantum eigensolvers [63.277656713454284]
  We benchmark the accuracy of VQE and ADAPT-VQE to calculate the electronic ground states and potential energy curves. We find both methods provide good estimates of the energy and ground state. gradient-based optimization is more economical and delivers superior performance than analogous simulations carried out with gradient-frees.
  arXiv  Detail & Related papers  (2020-11-02T19:52:04Z)
• 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)
• 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.