Pith. sign in

REVIEW 2 cited by

Quantum Langevin Dynamics for Optimization

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

arxiv 2311.15587 v3 pith:J3RVK4PL submitted 2023-11-27 quant-ph cs.DScs.LGmath.OC

classification quant-phcs.DScs.LGmath.OC
keywords quantumsystemdynamicsoptimizationalgorithmsclassicalenergyfunctions
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

We initiate the study of utilizing Quantum Langevin Dynamics (QLD) to solve optimization problems, particularly those non-convex objective functions that present substantial obstacles for traditional gradient descent algorithms. Specifically, we examine the dynamics of a system coupled with an infinite heat bath. This interaction induces both random quantum noise and a deterministic damping effect to the system, which nudge the system towards a steady state that hovers near the global minimum of objective functions. We theoretically prove the convergence of QLD in convex landscapes, demonstrating that the average energy of the system can approach zero in the low temperature limit with an exponential decay rate correlated with the evolution time. Numerically, we first show the energy dissipation capability of QLD by retracing its origins to spontaneous emission. Furthermore, we conduct detailed discussion of the impact of each parameter. Finally, based on the observations when comparing QLD with classical Fokker-Plank-Smoluchowski equation, we propose a time-dependent QLD by making temperature and $\hbar$ time-dependent parameters, which can be theoretically proven to converge better than the time-independent case and also outperforms a series of state-of-the-art quantum and classical optimization algorithms in many non-convex landscapes.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities

    quant-ph 2025-07 conditional novelty 6.0 of 10

    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.

  2. Quantum Optimization via Gradient-Based Hamiltonian Descent

    quant-ph 2025-05 conditional novelty 6.0 of 10

    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.

Pith tools