activity
20232025
most citedAn Inexact Feasible Quantum Interior Point Method for Linearly Constrained Quadratic Optimization

19 citations · 19 across the 6 of their papers we have counts for

collaborators

7 papers

quant-ph2025

Quantum Interior Point Methods: A Review of Developments and An Optimally Scaling Framework

Mohammadhossein Mohammadisiahroudi, Zeguan Wu, Pouya Sampourmahani +2

The growing demand for solving large-scale, data-intensive linear and conic optimization problems, particularly in applications such as artificial intelligence and machine learning…

quant-ph2025

Optimal Scaling Quantum Interior Point Method for Linear Optimization

Mohammadhossein Mohammadisiahroudi, Zeguan Wu, Pouya Sampourmahani +2

The emergence of huge-scale, data-intensive linear optimization (LO) problems in applications such as machine learning has driven the need for more computationally efficient interi…

math.OC2024

A quantum dual logarithmic barrier method for linear optimization

Zeguan Wu, Pouya Sampourmahani, Mohammadhossein Mohammadisiahroudi +1

Quantum computing has the potential to speed up some optimization methods. One can use quantum computers to solve linear systems via Quantum Linear System Algorithms (QLSAs). QLSAs…

math.OC2024

A preconditioned inexact infeasible quantum interior point method for linear optimization

Zeguan Wu, Xiu Yang, Tamás Terlaky

Quantum Interior Point Methods (QIPMs) have been attracting significant interests recently due to their potential of solving optimization problems substantially faster than state-o…

quant-ph2024

An Efficient Quantum Algorithm for Linear System Problem in Tensor Format

Zeguan Wu, Sidhant Misra, Tamás Terlaky +2

Solving linear systems is at the foundation of many algorithms. Recently, quantum linear system algorithms (QLSAs) have attracted great attention since they converge to a solution…

math.OC2023

Improvements to Quantum Interior Point Method for Linear Optimization

Mohammadhossein Mohammadisiahroudi, Zeguan Wu, Brandon Augustino +2

Quantum linear system algorithms (QLSA) have the potential to speed up Interior Point Methods (IPM). However, a major challenge is that QLSAs are inexact and sensitive to the condi…

math.OC2023★ 19 cited

An Inexact Feasible Quantum Interior Point Method for Linearly Constrained Quadratic Optimization

Zeguan Wu, Mohammadhossein Mohammadisiahroudi, Brandon Augustino +2

Quantum linear system algorithms (QLSAs) have the potential to speed up algorithms that rely on solving linear systems. Interior Point Methods (IPMs) yield a fundamental family of…