Ramin Fakhimi
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Ramin Fakhimi has a total of 3 co-authors. Here are the top co-authors by number of shared publications:
- Hamidreza Validi
Department of Industrial, Manufacturing & Systems Engineering, Texas Tech University, Lubbock, Texas 79409
1 shared publication - 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
1 shared publication - Tamás Terlaky
Department of Industrial and Systems Engineering, Lehigh University, Bethlehem, USA
1 shared publication
Latest Publications
- Open Access
- 3 March 2023
- Published by MDPI AG in Preprints.org
Efficient Use of Quantum Linear System Algorithms in Interior Point Methods for Linear Optimization
Quantum computing has attracted significant interest in the optimization commu nity because it potentially can solve classes of optimization problems faster than conventional supercomputers. Several researchers proposed quantum computing methods, especially Quan tum Interior Point Methods (QIPMs), to solve convex optimization problems, such as Linear Optimization, Semidefinite Optimization, and Second-order Cone Optimization problems. Most of them have applied a Quantum Linear System Algorithm at each iteration to compute a New ton step. However, using quantum linear solvers in QIPMs comes with many challenges, such as having ill-conditioned systems and the considerable error of quantum solvers. This paper in vestigates how one can efficiently use quantum linear solvers in QIPMs. Accordingly, an Inexact Infeasible Quantum Interior Point Method is developed to solve linear optimization problems. We also discuss how we can get an exact solution by Iterative Refinement without excessive time of quantum solvers. Finally, computational results with a QISKIT implementation of our QIPM using quantum simulators are analyzed.
- 3 March 2023
- Published by MDPI AG in Preprints.org
Open AccessEfficient Use of Quantum Linear System Algorithms in Interior Point Methods for Linear Optimization
Quantum computing has attracted significant interest in the optimization commu nity because it potentially can solve classes of optimization problems faster than conventional supercomputers. Several researchers proposed quantum computing methods, especially Quan tum Interior Point Methods (QIPMs), to solve convex optimization problems, such as Linear Optimization, Semidefinite Optimization, and Second-order Cone Optimization problems. Most of them have applied a Quantum Linear System Algorithm at each iteration to compute a New ton step. However, using quantum linear solvers in QIPMs comes with many challenges, such as having ill-conditioned systems and the considerable error of quantum solvers. This paper in vestigates how one can efficiently use quantum linear solvers in QIPMs. Accordingly, an Inexact Infeasible Quantum Interior Point Method is developed to solve linear optimization problems. We also discuss how we can get an exact solution by Iterative Refinement without excessive time of quantum solvers. Finally, computational results with a QISKIT implementation of our QIPM using quantum simulators are analyzed.