REVIEW 9 cited by
Quantum Hamiltonian Descent
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Gradient descent is a fundamental algorithm in both theory and practice for continuous optimization. Identifying its quantum counterpart would be appealing to both theoretical and practical quantum applications. A conventional approach to quantum speedups in optimization relies on the quantum acceleration of intermediate steps of classical algorithms, while keeping the overall algorithmic trajectory and solution quality unchanged. We propose Quantum Hamiltonian Descent (QHD), which is derived from the path integral of dynamical systems referring to the continuous-time limit of classical gradient descent algorithms, as a truly quantum counterpart of classical gradient methods where the contribution from classically-prohibited trajectories can significantly boost QHD's performance for non-convex optimization. Moreover, QHD is described as a Hamiltonian evolution efficiently simulatable on both digital and analog quantum computers. By embedding the dynamics of QHD into the evolution of the so-called Quantum Ising Machine (including D-Wave and others), we empirically observe that the D-Wave-implemented QHD outperforms a selection of state-of-the-art gradient-based classical solvers and the standard quantum adiabatic algorithm, based on the time-to-solution metric, on non-convex constrained quadratic programming instances up to 75 dimensions. Finally, we propose a "three-phase picture" to explain the behavior of QHD, especially its difference from the quantum adiabatic algorithm.
Forward citations
Cited by 9 Pith papers
-
Universal energy-space localization and stable quantum phases against time-dependent perturbations
For q-local Hamiltonians with bounded change, an initial eigenstate remains exponentially concentrated in a macroscopic energy window under arbitrary time-dependent perturbations.
-
Uniform semiclassical observable error bound of Trotter-Suzuki splitting: a simple algebraic proof
For any even order p, the p-th order Trotter-Suzuki splitting approximates semiclassical Schrödinger observables with error O(Δt^p) uniformly in the semiclassical parameter h, proven by algebraic commutator estimates.
-
Encoding Choices and Fault-Tolerant Resource Estimates for Digital Quantum Hamiltonian Descent
For digital quantum Hamiltonian descent, binary amplitude encoding uses O(d log N) qubits and fewer R_z rotations than one-hot encoding in all tested benchmarks, making it the preferred starting point for fault-tolera...
-
Quantum-Informed Portfolio Selection: An End-to-End Pipeline Validated on Trapped-Ion Hardware with Real Market Data
qReduMIS, using QAOA frozen-node signals plus classical reductions, solves real market MIS portfolio instances up to 225 assets on Helios with far better success and TTS scaling than standalone QAOA.
-
Stochastic Quantum Hamiltonian Descent
SQHD is a gate-based quantum algorithm that approximates a Lindblad dynamics blending Hamiltonian descent with stochastic component noise, giving an order-2 weak approximation and an O(1/t + eta sigma*) convergence bo...
-
Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities
Quantum algorithms for bandits with knapsacks achieve improved regret and time complexity by replacing classical sampling with quantum Monte Carlo and approximate quantum LP solving.
-
Quantum Optimization via Gradient-Based Hamiltonian Descent
Gradient-based QHD, a quantum Hamiltonian descent variant that inserts the gradient into the kinetic term, is claimed to converge at O(t^-2) in theory and to outperform QHD and classical methods in 2D tests.
-
Quantum Hamiltonian Descent based Augmented Lagrangian Method for Constrained Nonconvex Nonlinear Optimization
The paper introduces QHD-ALM, an augmented Lagrangian wrapper around the QHDOPT quantum Hamiltonian descent solver, using simulated bifurcation as a classical engine, and demonstrates it on a power-to-hydrogen schedul...
-
Quantum computing and artificial intelligence: status and perspectives
A broad expert white paper sets a European research agenda for combining quantum computing and AI, spanning quantum machine learning, AI-driven quantum control, and foundational questions.
Discussion (0). Continue with ORCID to comment.