Quantum Langevin Dynamics for Optimization
Fuente:
arXiv
Saved in:
| Main Authors: | Chen, Zherui, Lu, Yuchen, Wang, Hao, Liu, Yizhou, Li, Tongyang |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Quantum Algorithms and Lower Bounds for Finite-Sum Optimization
by: Zhang, Yexin, et al.
Published: (2024)
by: Zhang, Yexin, et al.
Published: (2024)
Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities
by: Su, Yuexin, et al.
Published: (2025)
by: Su, Yuexin, et al.
Published: (2025)
Near-Optimal Quantum Algorithm for Minimizing the Maximal Loss
by: Wang, Hao, et al.
Published: (2024)
by: Wang, Hao, et al.
Published: (2024)
Quantum Approximate Optimization Algorithms for Maximum Cut on Low-Girth Graphs
by: Li, Tongyang, et al.
Published: (2024)
by: Li, Tongyang, et al.
Published: (2024)
Gradient Testing and Estimation by Comparisons
by: Tao, Xiwen, et al.
Published: (2024)
by: Tao, Xiwen, et al.
Published: (2024)
Quantum EigenGame for excited state calculation
by: Quiroga, David, et al.
Published: (2025)
by: Quiroga, David, et al.
Published: (2025)
On Speedups for Convex Optimization via Quantum Dynamics
by: Chakrabarti, Shouvanik, et al.
Published: (2025)
by: Chakrabarti, Shouvanik, et al.
Published: (2025)
A Catalyst Framework for the Quantum Linear System Problem via the Proximal Point Algorithm
by: Kim, Junhyung Lyle, et al.
Published: (2024)
by: Kim, Junhyung Lyle, et al.
Published: (2024)
Exploiting Low-Rank Structure in Max-K-Cut Problems
by: Stevens, Ria, et al.
Published: (2026)
by: Stevens, Ria, et al.
Published: (2026)
Quantum thermodynamics and semi-definite optimization
by: Liu, Nana, et al.
Published: (2025)
by: Liu, Nana, et al.
Published: (2025)
Quantum Optimization Algorithms in Operations Research: Methods, Applications, and Implications
by: Klug, Florian
Published: (2023)
by: Klug, Florian
Published: (2023)
Scalable First-Order Interior Point Trust Region Algorithms for Linearly Constrained Optimization
by: Su, Yuexin, et al.
Published: (2026)
by: Su, Yuexin, et al.
Published: (2026)
Generalized Short Path Algorithms: Towards Super-Quadratic Speedup over Markov Chain Search for Combinatorial Optimization
by: Chakrabarti, Shouvanik, et al.
Published: (2024)
by: Chakrabarti, Shouvanik, et al.
Published: (2024)
Quantum speedups for stochastic optimization
by: Sidford, Aaron, et al.
Published: (2023)
by: Sidford, Aaron, et al.
Published: (2023)
Multi-LLM Query Optimization
by: Dean, Arlen, et al.
Published: (2026)
by: Dean, Arlen, et al.
Published: (2026)
Negative Momentum for Convex-Concave Optimization
by: Shugart, Henry, et al.
Published: (2026)
by: Shugart, Henry, et al.
Published: (2026)
Distributionally Robust Optimization with Adversarial Data Contamination
by: Li, Shuyao, et al.
Published: (2025)
by: Li, Shuyao, et al.
Published: (2025)
Gibbs Sampling of Continuous Potentials on a Quantum Computer
by: Motamedi, Arsalan, et al.
Published: (2022)
by: Motamedi, Arsalan, et al.
Published: (2022)
Quantum Speedups for Group Relaxations of Integer Linear Programs
by: Augustino, Brandon, et al.
Published: (2026)
by: Augustino, Brandon, et al.
Published: (2026)
Quantum speedups for linear programming via interior point methods
by: Apers, Simon, et al.
Published: (2023)
by: Apers, Simon, et al.
Published: (2023)
QCircuitBench: A Large-Scale Dataset for Benchmarking Quantum Algorithm Design
by: Yang, Rui, et al.
Published: (2024)
by: Yang, Rui, et al.
Published: (2024)
Mechanisms for Quantum Advantage in Global Optimization of Nonconvex Functions
by: Herman, Dylan, et al.
Published: (2025)
by: Herman, Dylan, et al.
Published: (2025)
Noise Stability Optimization for Finding Flat Minima: A Hessian-based Regularization Approach
by: Zhang, Hongyang R., et al.
Published: (2023)
by: Zhang, Hongyang R., et al.
Published: (2023)
Online Bilevel Optimization: Regret Analysis of Online Alternating Gradient Methods
by: Tarzanagh, Davoud Ataee, et al.
Published: (2022)
by: Tarzanagh, Davoud Ataee, et al.
Published: (2022)
Optimal Decentralized Smoothed Online Convex Optimization
by: Bhuyan, Neelkamal, et al.
Published: (2024)
by: Bhuyan, Neelkamal, et al.
Published: (2024)
Convex Optimization with Nested Evolving Feasible Sets
by: M., Karthick Krishna, et al.
Published: (2026)
by: M., Karthick Krishna, et al.
Published: (2026)
Optimal Bounds for Adversarial Constrained Online Convex Optimization
by: Ferreira, Ricardo N., et al.
Published: (2025)
by: Ferreira, Ricardo N., et al.
Published: (2025)
Non-Euclidean High-Order Smooth Convex Optimization
by: Contreras, Juan Pablo, et al.
Published: (2024)
by: Contreras, Juan Pablo, et al.
Published: (2024)
Gradient-Free Method for Heavily Constrained Nonconvex Optimization
by: Shi, Wanli, et al.
Published: (2024)
by: Shi, Wanli, et al.
Published: (2024)
Min-Max Optimization Is Strictly Easier Than Variational Inequalities
by: Shugart, Henry, et al.
Published: (2025)
by: Shugart, Henry, et al.
Published: (2025)
Closing the Computational-Query Depth Gap in Parallel Stochastic Convex Optimization
by: Jambulapati, Arun, et al.
Published: (2024)
by: Jambulapati, Arun, et al.
Published: (2024)
Optimization on a Finer Scale: Bounded Local Subgradient Variation Perspective
by: Diakonikolas, Jelena, et al.
Published: (2024)
by: Diakonikolas, Jelena, et al.
Published: (2024)
Accelerated Algorithms for Constrained Nonconvex-Nonconcave Min-Max Optimization and Comonotone Inclusion
by: Cai, Yang, et al.
Published: (2022)
by: Cai, Yang, et al.
Published: (2022)
Online Convex Optimization with Switching Cost with Only One Single Gradient Evaluation
by: Shah, Harsh, et al.
Published: (2025)
by: Shah, Harsh, et al.
Published: (2025)
Infrequent Resolving Algorithm for Online Linear Programming
by: Li, Guokai, et al.
Published: (2024)
by: Li, Guokai, et al.
Published: (2024)
Extended convexity and smoothness and their applications in deep learning
by: Qi, Binchuan, et al.
Published: (2024)
by: Qi, Binchuan, et al.
Published: (2024)
Importance Sparsification for Sinkhorn Algorithm
by: Li, Mengyu, et al.
Published: (2023)
by: Li, Mengyu, et al.
Published: (2023)
Expanding the reach of quantum optimization with fermionic embeddings
by: Zhao, Andrew, et al.
Published: (2023)
by: Zhao, Andrew, et al.
Published: (2023)
A quantum central path algorithm for linear optimization
by: Augustino, Brandon, et al.
Published: (2023)
by: Augustino, Brandon, et al.
Published: (2023)
No quantum advantage implies improved bounds and classical algorithms for the binary paint shop problem
by: Goh, Mark, et al.
Published: (2026)
by: Goh, Mark, et al.
Published: (2026)
Similar Items
-
Quantum Algorithms and Lower Bounds for Finite-Sum Optimization
by: Zhang, Yexin, et al.
Published: (2024) -
Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities
by: Su, Yuexin, et al.
Published: (2025) -
Near-Optimal Quantum Algorithm for Minimizing the Maximal Loss
by: Wang, Hao, et al.
Published: (2024) -
Quantum Approximate Optimization Algorithms for Maximum Cut on Low-Girth Graphs
by: Li, Tongyang, et al.
Published: (2024) -
Gradient Testing and Estimation by Comparisons
by: Tao, Xiwen, et al.
Published: (2024)