Pouya Sampourmahani
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Pouya Sampourmahani has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Mohammadhossein Mohammadisiahroudi
Department of Mathematics and Statistics, University of Maryland, Baltimore County, Baltimore, Maryland 21250; and Quantum Science Institute, University of Maryland, Baltimore County, Baltimore, Maryland 21250
2 shared publications - Tamás Terlaky
Department of Industrial and Systems Engineering, Lehigh University, Bethlehem, USA
2 shared publications - Zeguan Wu
Department of Industrial and Systems Engineering, Lehigh University, Bethlehem, Pennsylvania 18015; and Department of Computer Science, University of Pittsburgh, Pittsburgh, Pennsylvania 15260
2 shared publications - Adrian Harkness
Pacific Northwest National Laboratory
1 shared publication
Latest Publications
- 1 May 2026
- Published by Springer Nature
- p. 123-139
Quantum Interior Point Methods: A Review of Developments and an Optimally Scaling Framework
- 1 May 2026
- Published by Springer Nature
- p. 123-139
Quantum Interior Point Methods: A Review of Developments and an Optimally Scaling Framework
- 5 December 2025
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Optimization
- Vol. 8 (3) , 185-205
A Quantum Dual Logarithmic Barrier Method for Linear Optimization
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 can be used as a subroutine for algorithms that require solving linear systems, such as the dual logarithmic barrier method (DLBM) for solving linear optimization (LO) problems. In this paper, we use a QLSA to solve the linear systems arising in each iteration of the DLBM. To use the QLSA in a hybrid setting, we read out quantum states via a tomography procedure that introduces considerable error and noise. Thus, this paper first proposes an inexact feasible variant of DLBM for LO problems and then extends it to a quantum version. Our quantum approach has quadratic convergence toward the central path with inexact directions, and we show that this method has the best known [ ] iteration complexity, where n is the number of variables, [ ] is the initial duality gap, and [ ] is the accuracy. We further use iterative refinement to improve the complexity dependence on accuracy and condition number. For LO problems with quadratically more constraints than variables, the quantum complexity of our method has a sublinear dependence on dimension. Funding: This research was supported by Defense Advanced Research Projects Agency [Grant W911NF2010022] and the National Science Foundation [Grant 2128527].
- 5 December 2025
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Optimization
- Vol. 8 (3) , 185-205
A Quantum Dual Logarithmic Barrier Method for Linear Optimization
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 can be used as a subroutine for algorithms that require solving linear systems, such as the dual logarithmic barrier method (DLBM) for solving linear optimization (LO) problems. In this paper, we use a QLSA to solve the linear systems arising in each iteration of the DLBM. To use the QLSA in a hybrid setting, we read out quantum states via a tomography procedure that introduces considerable error and noise. Thus, this paper first proposes an inexact feasible variant of DLBM for LO problems and then extends it to a quantum version. Our quantum approach has quadratic convergence toward the central path with inexact directions, and we show that this method has the best known [ ] iteration complexity, where n is the number of variables, [ ] is the initial duality gap, and [ ] is the accuracy. We further use iterative refinement to improve the complexity dependence on accuracy and condition number. For LO problems with quadratically more constraints than variables, the quantum complexity of our method has a sublinear dependence on dimension. Funding: This research was supported by Defense Advanced Research Projects Agency [Grant W911NF2010022] and the National Science Foundation [Grant 2128527].