A Quantum IP Predictor-Corrector Algorithm for Linear Programming

02/18/2019
by   P. A. M. Casares, et al.
0

We introduce a new quantum optimization algorithm for Linear Programming (LP) problems based on Interior Point (IP) Predictor-Corrector (PC) methods whose (worst case) time complexity is O(√(n)Ls^3 k ϵ^-1ϵ_s^-1) . This represents a quantum speed-up in the number n of variables in the cost function with respect to the comparable classical Interior Point (IP) algorithms that behave as O((n+m)√(nk)L s^3(ϵ^-1)ϵ_s^-1) or O(√(n)(n+m)L) depending on the technique employed, where m is the number of constraints and the rest of the variables are defined in the introduction. The average time complexity of our algorithm is O(√(n)s^3 k ϵ^-1ϵ_s^-1), which equals the behaviour on n of quantum Semidefinite Programming (SDP) algorithms based on multiplicative weight methods when restricted to LP problems and heavily improves on the precision ϵ^-1 of the algorithm. Unlike the quantum SDP algorithm, the quantum PC algorithm does not depend on size parameters of the primal and dual LP problems (R,r), and outputs a feasible and optimal solution whenever it exists.

READ FULL TEXT
research
08/28/2018

A Quantum Interior Point Method for LPs and SDPs

We present a quantum interior point method with worst case running time ...
research
11/10/2021

Linear Convergence of Stochastic Primal Dual Methods for Linear Programming Using Variance Reduction and Restarts

There is a recent interest on first-order methods for linear programming...
research
01/15/2019

A linear programming approach to the tracking of partials

A new approach to the tracking of sinusoidal chirps using linear program...
research
01/26/2018

Improved Finite Blocklength Converses for Slepian-Wolf Coding via Linear Programming

A new finite blocklength converse for the Slepian- Wolf coding problem i...
research
12/12/2019

A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix

Following the breakthrough work of Tardos in the bit-complexity model, V...
research
09/12/2019

Online Linear Programming: Dual Convergence, New Algorithms, and Regret Bounds

We study an online linear programming (OLP) problem under a random input...
research
09/12/2019

Quantum linear system solver based on time-optimal adiabatic quantum computing and quantum approximate optimization algorithm

We demonstrate that with an optimally tuned scheduling function, adiabat...

Please sign up or login with your details

Forgot password? Click here to reset