arrow
Return

QUANTUM SPEEDUPS FOR LINEAR PROGRAMMING VIA INTERIOR POINT METHODS

delete2026-01-01
delete0
PRE
AI
S
Simon Apers *
S
Sander Gribling
DOI:10.1137/25M1736098delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
We describe a quantum algorithm based on an interior point method for solving a linear program with n inequality constraints on d variables. The algorithm explicitly returns a feasible solution that is \varepsilon-close to optimal and runs in time root n.poly(d,log(n),log(1/epsilon)), which is sublinear for tall linear programs (i.e., n >> d). Our algorithm speeds up the Newton step in the state-of-the-art interior point method of Lee and Sidford [Solving Linear Programs with Sqrt(rank) Linear System Solves, 2019]. This requires us to efficiently approximate the Hessian and gradient of the barrier function, and these are our main contributions. To approximate the Hessian, we describe a quantum algorithm for the spectral approximation of A(T)A for a tall matrix A subset of R-nxd. The algorithm uses leverage score sampling in combination with Grover search and returns a \delta-approximation by making O(root nd/delta) row queries to A. This generalizes an earlier quantum speedup for graph sparsification by Apers and de Wolf [SIAM J. Comput., 51 (2022), pp. 1703-1742]. To approximate the gradient, we use a recent quantum algorithm for multivariate mean estimation by Cornelissen, Hamoudi, and Jerbi [Near-optimal quantum algorithms for multivariate mean estimation, 2022]. While a naive implementation introduces a dependence on the condition number of the Hessian, we avoid this by preconditioning our random variable using our quantum algorithm for spectral approximation.
Keywords:
Key words. quantum algorithms
interior point methods
linear programming
spectral approximation

Journal

S
SIAM Journal on Computing
IF:
1.6
Papers:
14
Citations:
0

Organization

C
centre national de la recherche scientifique (cnrs)
Scholars:
24.5W
Papers: 18.2W
Citations: 279
U
Universite Paris Cite
Scholars:
8.9W
Papers: 6.3W
Citations: 604
Cited Papers

Cited Papers

Sublinear Time Algorithms
err2011-01-01
err0
errOAAI
errRonitt Rubinfeld; Asaf Shapira
errShare
errSave
Graph Sparsification by Effective Resistances
err2011-01-01
err0
errOAAI
errDaniel A. Spielman; Nikhil Srivastava
errShare
errSave
Quantum Interior Point Methods for Semidefinite Optimization
err2023-09-11
err0
errOAAI
errBrandon Augustino; Giacomo Nannicini; Tamás Terlaky; Luis F. Zuluaga
errShare
errSave
Challenges and opportunities in quantum optimization
err2024-10-28
err0
PREAI
errAmira Abbas; Andris Ambainis; Brandon Augustino; Andreas Bärtschi; Harry Buhrman; Carleton Coffrin; Giorgio Cortiana; Vedran Dunjko; Daniel J. Egger; Bruce G. Elmegreen; Nicola Franco; Filippo Fratini; Bryce Fuller; Julien Gacon; Constantin Gonciulea; Sander Gribling; Swati Gupta; Stuart Hadfield; Raoul Heese; Gerhard Kircher; Thomas Kleinert; Thorsten Koch; Georgios Korpas; Steve Lenk; Jakub Marecek; Vanio Markov; Guglielmo Mazzola; Stefano Mensa; Naeimeh Mohseni; Giacomo Nannicini; Corey O’Meara; Elena Peña Tapia; Sebastian Pokutta; Manuel Proissl; Patrick Rebentrost; Emre Sahin; Benjamin C. B. Symons; Sabine Tornow; Víctor Valls; Stefan Woerner; Mira L. Wolf-Bauwens; Jon Yard; Sheir Yarkoni; Dirk Zechiel; Sergiy Zhuk; Christa Zoufal
errShare
errSave
Quantum algorithms and lower bounds for convex optimization
errQUANTUM
IF5.4
err2020-01-13
err30
errOAAI
errChakrabarti, Shouvanik; Childs, Andrew M.; Li, Tongyang; Wu, Xiaodi
errShare
errSave
Sampling-based Sublinear Low-rank Matrix Arithmetic Framework for Dequantizing Quantum Machine Learning
err2022-10-27
err0
errOAAI
errNai-Hui Chia; András Pal Gilyén; Tongyang Li; Han-Hsuan Lin; Ewin Tang; Chunhao Wang
errShare
errSave
researcher View more