A quantum central path algorithm for linear optimization
Fuente:
arXiv
Saved in:
| Main Authors: | Augustino, Brandon, Leng, Jiaqi, Nannicini, Giacomo, Terlaky, Tamás, Wu, Xiaodi |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Solving the semidefinite relaxation of QUBOs in matrix multiplication time, and faster with a quantum computer
by: Augustino, Brandon, et al.
Published: (2023)
by: Augustino, Brandon, et al.
Published: (2023)
On Speedups for Convex Optimization via Quantum Dynamics
by: Chakrabarti, Shouvanik, et al.
Published: (2025)
by: Chakrabarti, Shouvanik, et al.
Published: (2025)
Quantum Speedups for Group Relaxations of Integer Linear Programs
by: Augustino, Brandon, et al.
Published: (2026)
by: Augustino, Brandon, 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)
Expanding the reach of quantum optimization with fermionic embeddings
by: Zhao, Andrew, et al.
Published: (2023)
by: Zhao, Andrew, 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)
Quantum speedups for stochastic optimization
by: Sidford, Aaron, et al.
Published: (2023)
by: Sidford, Aaron, et al.
Published: (2023)
Quantum speedups for linear programming via interior point methods
by: Apers, Simon, et al.
Published: (2023)
by: Apers, Simon, et al.
Published: (2023)
Classical optimization with imaginary time block encoding on quantum computers: The MaxCut problem
by: Zhong, Dawei, et al.
Published: (2024)
by: Zhong, Dawei, et al.
Published: (2024)
A nearly optimal randomized algorithm for explorable heap selection
by: Borst, Sander, et al.
Published: (2022)
by: Borst, Sander, et al.
Published: (2022)
A hierarchy of eigencomputations for polynomial optimization on the sphere
by: Lovitz, Benjamin, et al.
Published: (2023)
by: Lovitz, Benjamin, et al.
Published: (2023)
Quantum Optimization Algorithms in Operations Research: Methods, Applications, and Implications
by: Klug, Florian
Published: (2023)
by: Klug, Florian
Published: (2023)
Near-Optimal Quantum Algorithm for Minimizing the Maximal Loss
by: Wang, Hao, et al.
Published: (2024)
by: Wang, Hao, et al.
Published: (2024)
Gibbs Sampling of Continuous Potentials on a Quantum Computer
by: Motamedi, Arsalan, et al.
Published: (2022)
by: Motamedi, Arsalan, et al.
Published: (2022)
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)
A simple lower bound for the complexity of estimating partition functions on a quantum computer
by: Chen, Zherui, et al.
Published: (2024)
by: Chen, Zherui, et al.
Published: (2024)
Quantum algorithms for optimizers
by: Nannicini, Giacomo
Published: (2024)
by: Nannicini, Giacomo
Published: (2024)
Computational complexity of the recoverable robust shortest path problem in acyclic digraphs
by: Kasperski, Adam, et al.
Published: (2024)
by: Kasperski, Adam, 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)
A rounding and clustering-based exact algorithm for the p-center problem
by: Ales, Zacharie, et al.
Published: (2024)
by: Ales, Zacharie, et al.
Published: (2024)
Handicap reduction for linear complementarity problems
by: -Nagy, Marianna E., et al.
Published: (2026)
by: -Nagy, Marianna E., et al.
Published: (2026)
Parameterized algorithms for block-structured integer programs with large entries
by: Cslovjecsek, Jana, et al.
Published: (2023)
by: Cslovjecsek, Jana, et al.
Published: (2023)
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)
Convex optimization with $p$-norm oracles
by: Adil, Deeksha, et al.
Published: (2024)
by: Adil, Deeksha, et al.
Published: (2024)
Quantum thermodynamics and semi-definite optimization
by: Liu, Nana, et al.
Published: (2025)
by: Liu, Nana, et al.
Published: (2025)
Optimized methods for composite optimization: a reduction perspective
by: Bok, Jinho, et al.
Published: (2025)
by: Bok, Jinho, et al.
Published: (2025)
Quantum Langevin Dynamics for Optimization
by: Chen, Zherui, et al.
Published: (2023)
by: Chen, Zherui, et al.
Published: (2023)
Approximate Message Passing for Quantum State Tomography
by: Siekierski, Noah, et al.
Published: (2025)
by: Siekierski, Noah, et al.
Published: (2025)
Near-Optimal Parameter Tuning of Level-1 QAOA for Ising Models
by: Vijendran, V, et al.
Published: (2025)
by: Vijendran, V, et al.
Published: (2025)
Parallel Token Swapping for Qubit Routing
by: Bansal, Ishan, et al.
Published: (2024)
by: Bansal, Ishan, et al.
Published: (2024)
Quantum Algorithms and Lower Bounds for Finite-Sum Optimization
by: Zhang, Yexin, et al.
Published: (2024)
by: Zhang, Yexin, 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 EigenGame for excited state calculation
by: Quiroga, David, et al.
Published: (2025)
by: Quiroga, David, et al.
Published: (2025)
Classical and Quantum Heuristics for the Binary Paint Shop Problem
by: Vijendran, V, et al.
Published: (2025)
by: Vijendran, V, et al.
Published: (2025)
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)
Assortment optimization given basket shopping behavior using the Ising model
by: Vasilyev, Andrey, et al.
Published: (2025)
by: Vasilyev, Andrey, et al.
Published: (2025)
Randomized adiabatic quantum linear solver algorithm with optimal complexity scaling and detailed running costs
by: Jennings, David, et al.
Published: (2023)
by: Jennings, David, et al.
Published: (2023)
Asymptotics of solutions to the linear search problem
by: Heinonen, Robin A.
Published: (2026)
by: Heinonen, Robin A.
Published: (2026)
Theoretical Approximation Ratios for Warm-Started QAOA on 3-Regular Max-Cut Instances at Depth $p=1$
by: Tate, Reuben, et al.
Published: (2024)
by: Tate, Reuben, et al.
Published: (2024)
Promise of Graph Sparsification and Decomposition for Noise Reduction in QAOA: Analysis for Trapped-Ion Compilations
by: Moondra, Jai, et al.
Published: (2024)
by: Moondra, Jai, et al.
Published: (2024)
Similar Items
-
Solving the semidefinite relaxation of QUBOs in matrix multiplication time, and faster with a quantum computer
by: Augustino, Brandon, et al.
Published: (2023) -
On Speedups for Convex Optimization via Quantum Dynamics
by: Chakrabarti, Shouvanik, et al.
Published: (2025) -
Quantum Speedups for Group Relaxations of Integer Linear Programs
by: Augustino, Brandon, 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) -
Expanding the reach of quantum optimization with fermionic embeddings
by: Zhao, Andrew, et al.
Published: (2023)