Quantum linear system algorithms (QLSA) have the potential to speed up Interior Point Methods (IPM). However, a major bottleneck is the inexactness of quantum Tomography to extract classical solutions from quantum states. In addition, QLSAs are sensitive to the condition number, and this sensitivity is exacerbated when the Newton systems arising in IPMs converge to a singular matrix. Recently, an Inexact Feasible Quantum IPM (IF-QIPM) has been developed that addresses the inexactness of QLSAs. However, this method requires a large number of gates and qubits to be implemented. Here, we propose a new IF-QIPM using the normal equation system, which requires less number of gates and qubits. To mitigate the sensitivity to the condition number and other input data-related parameters, we use preconditioning coupled with iterative refinement to obtain better complexity. Finally, we demonstrate the effectiveness of our approach on IBM Qiskit simulators.

Mohammadhossein Mohammadisiahroudi

Zeguan Wu

Brandon Augustino

Improvements to Quantum Interior Point Method for Linear Optimization

ivySCI AI Smartly Parses PDF, Answers Researchers' Questions, and Helps You Understand Papers in Seconds

Journal Info

Category	Quartile
QUANTUM SCIENCE & TECHNOLOGY	2