mohammadhossein mohammadisiahroudi

Mr. mohammadhossein mohammadisiahroudi

orcid

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
20 August 2022 in Environmental Science and Pollution Research
Verified
Journal Article
Closed access
PDF file
MAMahyar Abbasian
Mahyar Abbasian
ZSZeinab Sazvar
Zeinab Sazvar
mohammadhossein mohammadisiahroudimohammadhossein mohammadisiahroudi
mohammadhossein mohammadisiahroudi

10 February 2023 in Entropy
Verified
Journal Article
Open access
PDF file
ZWZeguan Wu
Zeguan Wu
mohammadhossein mohammadisiahroudimohammadhossein mohammadisiahroudi
mohammadhossein mohammadisiahroudi
BABrandon Augustino
Brandon Augustino
XYXiu Yang
Xiu Yang
Tamás Sándor TerlakyTamás Sándor Terlaky
Tamás Sándor Terlaky
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 polynomial-time algorithms for solving optimization problems. IPMs solve a Newton linear system at each iteration to compute the search direction; thus, QLSAs can potentially speed up IPMs. Due to the noise in contemporary quantum computers, quantum-assisted IPMs (QIPMs) only admit an inexact solution to the Newton linear system. Typically, an inexact search direction leads to an infeasible solution, so, to overcome this, we propose an inexact-feasible QIPM (IF-QIPM) for solving linearly constrained quadratic optimization problems. We also apply the algorithm to ℓ1-norm soft margin support vector machine (SVM) problems, and demonstrate that our algorithm enjoys a speedup in the dimension over existing approaches. This complexity bound is better than any existing classical or quantum algorithm that produces a classical solution.

7 October 2025 in SIAM Journal on Optimization
Verified
Journal Article
Closed access
mohammadhossein mohammadisiahroudimohammadhossein mohammadisiahroudi
mohammadhossein mohammadisiahroudi
RFRamin Fakhimi
Ramin Fakhimi
ZWZeguan Wu
Zeguan Wu
Tamás Sándor TerlakyTamás Sándor Terlaky
Tamás Sándor Terlaky
The use of quantum computing to accelerate complex optimization problems is a burgeoning research field. This paper applies Quantum Linear System Algorithms (QLSAs) to Newton systems within Interior Point Methods (IPMs) to take advantage of quantum speedup in solving Linear Optimization (LO) problems. Due to their inexact nature, QLSAs can be applied only to inexact variants of IPMs. Existing IPMs with inexact Newton directions are infeasible methods due to the inexact nature of their computations. This paper proposes an Inexact-Feasible IPM (IF-IPM) for LO problems, using a novel linear system to generate inexact but feasible steps. We show that this method has [Formula: see text] iteration complexity, analogous to the best exact IPMs, where [Formula: see text] is the number of variables and [Formula: see text] is the binary length of the input data. Moreover, we examine how QLSAs can efficiently solve the proposed system in an iterative refinement (IR) scheme to find the exact solution without excessive calls to QLSAs. We show that the proposed IR-IF-IPM can also be helpful to mitigate the impact of the condition number when a classical iterative method, such as a Conjugate Gradient method or a quantum solver is used at iterations of IPMs. After applying the proposed IF-IPM to the self-dual embedding formulation, we implement it and present illustrative numerical results.

23 June 2024 in Journal of Optimization Theory and Applications
Verified
Journal Article
Closed access
PDF file
mohammadhossein mohammadisiahroudimohammadhossein mohammadisiahroudi
mohammadhossein mohammadisiahroudi
RFRamin Fakhimi
Ramin Fakhimi
Tamás Sándor TerlakyTamás Sándor Terlaky
Tamás Sándor Terlaky

14 January 2025 in ACM Transactions on Quantum Computing
Verified
Journal Article
Open access
mohammadhossein mohammadisiahroudimohammadhossein mohammadisiahroudi
mohammadhossein mohammadisiahroudi
ZWZeguan Wu
Zeguan Wu
BABrandon Augustino
Brandon Augustino
ACArielle Carr
Arielle Carr
Tamás Sándor TerlakyTamás Sándor Terlaky
Tamás Sándor Terlaky
Quantum linear system algorithms (QLSAs) have the potential to speed up Interior Point Methods (IPMs). 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 fewer 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.

11 January 2025 in Mathematical Programming
Verified
Journal Article
Open access
PDF file
mohammadhossein mohammadisiahroudimohammadhossein mohammadisiahroudi
mohammadhossein mohammadisiahroudi
BABrandon Augustino
Brandon Augustino
PSPouya Sampourmahani
Pouya Sampourmahani
Tamás Sándor TerlakyTamás Sándor Terlaky
Tamás Sándor Terlaky
Iterative Refinement (IR) is a classical computing technique for obtaining highly precise solutions to linear systems of equations, as well as linear optimization problems. In this paper, motivated by the limited precision of quantum solvers, we develop the first IR scheme for solving semidefinite optimization (SDO) problems and explore two major impacts of the proposed IR scheme. First, we prove that the proposed IR scheme exhibits quadratic convergence of the optimality gap without any assumption on problem characteristics. As an application of our results, we show that using IR with Quantum Interior Point Methods (QIPMs) leads to exponential improvements in the worst-case overall running time of QIPMs, compared to previous best-performing QIPMs. We also discuss how the proposed IR scheme can be used with classical inexact SDO solvers, such as classical inexact IPMs with conjugate gradient methods.