Imagen de Portada

(Sub)Exponential Quantum Speedup for Optimization

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Leng, Jiaqi, Wu, Kewen, Wu, Xiaodi, Zheng, Yufan
Formato:	Preprint
Publicado:	2025
Materias:	Quantum Physics Computational Complexity Optimization and Control
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Towards Exponential Quantum Improvements in Solving Cardinality-Constrained Binary Optimization
por: Yuan, Haomu, et al.
Publicado: (2026)

Quantum Hamiltonian Descent for Non-smooth Optimization
por: Leng, Jiaqi, et al.
Publicado: (2025)

On the Computational Complexity of Schrödinger Operators
por: Zheng, Yufan, et al.
Publicado: (2024)

QHDOPT: A Software for Nonlinear Optimization with Quantum Hamiltonian Descent
por: Kushnir, Samuel, et al.
Publicado: (2024)

Quantum Feasibility Labeling for NP-complete Vertex Coloring Problem
por: Zhan, Junpeng
Publicado: (2023)

Solving The Travelling Salesman Problem Using A Single Qubit
por: Goswami, Kapil, et al.
Publicado: (2024)

Strassen's support functionals coincide with the quantum functionals
por: Sakabe, Keiya, et al.
Publicado: (2026)

Integer Programming Using A Single Atom
por: Goswami, Kapil, et al.
Publicado: (2024)

Quantum Optimization via Gradient-Based Hamiltonian Descent
por: Leng, Jiaqi, et al.
Publicado: (2025)

A quantum central path algorithm for linear optimization
por: Augustino, Brandon, et al.
Publicado: (2023)

Benchmarking of Quantum and Classical Computing in Large-Scale Dynamic Portfolio Optimization Under Market Frictions
por: Chen, Ying, et al.
Publicado: (2025)

On Speedups for Convex Optimization via Quantum Dynamics
por: Chakrabarti, Shouvanik, et al.
Publicado: (2025)

Counterfactual Explanations for Integer Optimization Problems
por: Engelhardt, Felix, et al.
Publicado: (2025)

Quantum Speedups for Markov Chain Monte Carlo Methods with Application to Optimization
por: Ozgul, Guneykan, et al.
Publicado: (2025)

$\mathsf{QAC}^0$ Contains $\mathsf{TC}^0$ (with Many Copies of the Input)
por: Grier, Daniel, et al.
Publicado: (2026)

Iterative Optimization of Multidimensional Functions on Turing Machines under Performance Guarantees
por: Boche, Holger, et al.
Publicado: (2025)

A System-Dynamic Based Simulation and Bayesian Optimization for Inventory Management
por: Maitra, Sarit
Publicado: (2024)

Tight Time Complexities in Parallel Stochastic Optimization with Arbitrary Computation Dynamics
por: Tyurin, Alexander
Publicado: (2024)

Classical and Quantum Speedups for Non-Convex Optimization via Energy Conserving Descent
por: Sun, Yihang, et al.
Publicado: (2026)

Quantum Advantage from Sampling Shallow Circuits: Beyond Hardness of Marginals
por: Grier, Daniel, et al.
Publicado: (2025)

Differentiable Quantum Computing for Large-scale Linear Control
por: Clayton, Connor, et al.
Publicado: (2024)

Query-Efficient Zeroth-Order Algorithms for Nonconvex Constrained Optimization
por: Jin, Ruiyang, et al.
Publicado: (2025)

Quantum Speedups for Group Relaxations of Integer Linear Programs
por: Augustino, Brandon, et al.
Publicado: (2026)

Operator-Level Quantum Acceleration of Non-Logconcave Sampling
por: Leng, Jiaqi, et al.
Publicado: (2025)

Decentralized Projection-free Online Upper-Linearizable Optimization with Applications to DR-Submodular Optimization
por: Lu, Yiyang, et al.
Publicado: (2025)

On the Complexity of p-Order Cone Programs
por: Blanco, Víctor, et al.
Publicado: (2025)

Efficient LP warmstarting for linear modifications of the constraint matrix
por: Derval, Guillaume, et al.
Publicado: (2025)

On the Degree Automatability of Sum-of-Squares Proofs
por: Bortolotti, Alex, et al.
Publicado: (2025)

Parameterized complexity of scheduling unit-time jobs with generalized precedence constraints
por: Büsing, Christina, et al.
Publicado: (2025)

A parameterized linear formulation of the integer hull
por: Eisenbrand, Friedrich, et al.
Publicado: (2025)

On a class of interdiction problems with partition matroids: complexity and polynomial-time algorithms
por: Ketkov, Sergey S., et al.
Publicado: (2024)

Hardness of some optimization problems over correlation polyhedra
por: Caprara, Alberto, et al.
Publicado: (2026)

On the Induced Norms of Matrices and Grothendieck problems
por: Truong, Lan V., et al.
Publicado: (2026)

Constrained Nonnegative Gram Feasibility is $\exists\mathbb{R}$-Complete
por: Majumdar, Angshul
Publicado: (2026)

Avoiding Deadlocks via Weak Deadlock Sets
por: Oriolo, Gianpaolo, et al.
Publicado: (2024)

Learning complexity of gradient descent and conjugate gradient algorithms
por: Jiao, Xianqi, et al.
Publicado: (2024)

Geometric and computational hardness of bilevel programming
por: Bolte, Jérôme, et al.
Publicado: (2024)

Policy Gradient Algorithms in Average-Reward Multichain MDPs
por: Lee, Jongmin, et al.
Publicado: (2026)

The Complexity of Computing KKT Solutions of Quadratic Programs
por: Fearnley, John, et al.
Publicado: (2023)

Reduction from the partition problem: Dynamic lot sizing problem with polynomial complexity
por: Sim, Chee-Khian
Publicado: (2024)