Quantum Optimization via Gradient-Based Hamiltonian Descent

• URL: http://arxiv.org/abs/2505.14670v1
• Date: Tue, 20 May 2025 17:55:52 GMT
• Title: Quantum Optimization via Gradient-Based Hamiltonian Descent
• Authors: Jiaqi Leng, Bin Shi,
• Abstract summary: One such algorithm, Quantum Hamiltonian Descent (QHD), achieves quantum tunneling to escape saddle-based minima.<n>We propose an enhancement to QHD by incorporating gradient-based QHD.<n> gradient-based QHD faster convergence and significantly increases the likelihood of identifying global solutions.
• Score: 5.325297567945828
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: With rapid advancements in machine learning, first-order algorithms have emerged as the backbone of modern optimization techniques, owing to their computational efficiency and low memory requirements. Recently, the connection between accelerated gradient methods and damped heavy-ball motion, particularly within the framework of Hamiltonian dynamics, has inspired the development of innovative quantum algorithms for continuous optimization. One such algorithm, Quantum Hamiltonian Descent (QHD), leverages quantum tunneling to escape saddle points and local minima, facilitating the discovery of global solutions in complex optimization landscapes. However, QHD faces several challenges, including slower convergence rates compared to classical gradient methods and limited robustness in highly non-convex problems due to the non-local nature of quantum states. Furthermore, the original QHD formulation primarily relies on function value information, which limits its effectiveness. Inspired by insights from high-resolution differential equations that have elucidated the acceleration mechanisms in classical methods, we propose an enhancement to QHD by incorporating gradient information, leading to what we call gradient-based QHD. Gradient-based QHD achieves faster convergence and significantly increases the likelihood of identifying global solutions. Numerical simulations on challenging problem instances demonstrate that gradient-based QHD outperforms existing quantum and classical methods by at least an order of magnitude.

Related papers

• Stochastic Quantum Hamiltonian Descent [5.8172845753874896]
  We introduce Quantum Hamiltonian Descent (SQHD), a quantum optimization algorithm that integrates computational efficiency of methods with global exploration power of quantum dynamics.<n>We also propose a discrete-time gate gate that approximates dynamics while direct Lindbladian simulation, enabling these objectives on near-term quantum devices.
  arXiv  Detail & Related papers  (2025-07-21T09:24:49Z)
• RhoDARTS: Differentiable Quantum Architecture Search with Density Matrix Simulations [48.670876200492415]
  Variational Quantum Algorithms (VQAs) are a promising approach for leveraging powerful Noisy Intermediate-Scale Quantum (NISQ) computers.<n>We propose $rho$DARTS, a differentiable Quantum Architecture Search (QAS) algorithm that models the search process as the evolution of a quantum mixed state.
  arXiv  Detail & Related papers  (2025-06-04T08:30:35Z)
• Quantum Hamiltonian Descent for Non-smooth Optimization [7.773836776652785]
  We investigate how quantum mechanics can be leveraged to overcome limitations of classical algorithms.<n>We propose a global convergence rate for non-smoothtime global convergence problems through a novel design.<n>In addition, we propose discrete-time QHD fully digitized via a novel Lynov function.
  arXiv  Detail & Related papers  (2025-03-20T06:02:33Z)
• Application of Langevin Dynamics to Advance the Quantum Natural Gradient Optimization Algorithm [47.47843839099175]
  A Quantum Natural Gradient (QNG) algorithm for optimization of variational quantum circuits has been proposed recently.<n>Momentum-QNG is more effective to escape local minima and plateaus in the variational parameter space.
  arXiv  Detail & Related papers  (2024-09-03T15:21:16Z)
• Quantum Maximum Entropy Inference and Hamiltonian Learning [4.9614587340495]
  This work extends algorithms for maximum entropy inference and learning of graphical models to the quantum realm. The generalization, known as quantum iterative scaling (QIS), is straightforward, but the key challenge lies in the non-commutative nature of quantum problem instances. We explore quasi-Newton methods to enhance the performance of QIS and GD.
  arXiv  Detail & Related papers  (2024-07-16T08:11:34Z)
• Qudit-inspired optimization for graph coloring [0.0]
  We introduce a quantum-inspired algorithm for graph coloring problems (GCPs)<n>We use qudits in a product state, with each qudit representing a node in the graph and parameterized by d-dimensional spherical coordinates.<n>We benchmark two optimization strategies: qudit gradient descent, initiating qudits in random states and employing gradient descent to minimize a cost function.
  arXiv  Detail & Related papers  (2024-06-02T16:19:55Z)
• 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 Hamiltonian Descent [8.580250279996985]
  Quantum Hamiltonian Descent (QHD) is a truly quantum counterpart of gradient descent algorithms. QHD is described as a Hamiltonian evolution simulatable on both digital and analog quantum computers.
  arXiv  Detail & Related papers  (2023-03-02T18:34:38Z)
• Synergy Between Quantum Circuits and Tensor Networks: Short-cutting the Race to Practical Quantum Advantage [43.3054117987806]
  We introduce a scalable procedure for harnessing classical computing resources to provide pre-optimized initializations for quantum circuits. We show this method significantly improves the trainability and performance of PQCs on a variety of problems. By demonstrating a means of boosting limited quantum resources using classical computers, our approach illustrates the promise of this synergy between quantum and quantum-inspired models in quantum computing.
  arXiv  Detail & Related papers  (2022-08-29T15:24:03Z)
• Quadratic Unconstrained Binary Optimisation via Quantum-Inspired Annealing [58.720142291102135]
  We present a classical algorithm to find approximate solutions to instances of quadratic unconstrained binary optimisation. We benchmark our approach for large scale problem instances with tuneable hardness and planted solutions.
  arXiv  Detail & Related papers  (2021-08-18T09:26:17Z)
• 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)
• 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)

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.