Fast quantum subroutines for the simplex method

DOI10.1007/978-3-030-73879-2_22zbMath1482.90244arXiv1910.10649OpenAlexW3162340737MaRDI QIDQ2061891

Giacomo Nannicini

Publication date: 21 December 2021

Full work available at URL: https://arxiv.org/abs/1910.10649

zbMATH Keywords

quantum subroutines, asymptotic speedup

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Extreme-point and pivoting methods (90C49)

Related Items (2)

An introduction to variational quantum algorithms for combinatorial optimization problems ⋮ A quantum interior-point predictor–corrector algorithm for linear programming

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A practical anti-cycling procedure for linearly constrained optimization
• Steepest-edge simplex algorithms for linear programming
• A sublinear-time randomized approximation algorithm for matrix games
• Fast sparse matrix multiplication
• Smoothed analysis of algorithms
• The Average number of pivot steps required by the Simplex-Method is polynomial
• Estimating the Largest Eigenvalue by the Power and Lanczos Algorithms with a Random Start
• Quantum Algorithm for Systems of Linear Equations with Exponentially Improved Dependence on Precision
• An Introduction to Quantum Computing, without the Physics
• A friendly smoothed analysis of the simplex method
• Selected Topics in Column Generation
• A quantum interior-point predictor–corrector algorithm for linear programming

This page was built for publication: Fast quantum subroutines for the simplex method