Stuart M. Harwood
Research Subjects
Stuart M. Harwood has a total of 23 co-authors. Here are the top co-authors by number of shared publications:
Francisco Trespalacios
ExxonMobil Upstream Research Company, Spring, USA
4 shared publicationsDimitri J. Papageorgiou
3 shared publicationsDimitar Trenev
ExxonMobil Corporate Strategic Research, Annandale, NJ, USA
2 shared publications- Dimitar Trenev
ExxonMobil, Corporate Strategic Research
2 shared publications - Dimitri J. Papageorgiou
Corporate Strategic Research ExxonMobil Research and Engineering Company 1545 Route 22 East 08801 Annandale NJ USA
2 shared publications Donny Greenberg
IBM Quantum, IBM T. J. Watson Research Center, Yorktown Heights, NY, USA
2 shared publications
Latest Publications
- 4 July 2025
- Published by Taylor & Francis in Molecular Physics
- Vol. 124 (2)
Adiabatic state preparation from general initial states
- 4 July 2025
- Published by Taylor & Francis in Molecular Physics
- Vol. 124 (2)
Adiabatic state preparation from general initial states
- 25 September 2023
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 87 (2) , 641-676
Equilibrium modeling and solution approaches inspired by nonconvex bilevel programming
- 25 September 2023
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 87 (2) , 641-676
Equilibrium modeling and solution approaches inspired by nonconvex bilevel programming
- Open Access
Pooling problems under perfect and imperfect competition
We investigate pooling problems in which multiple players vie with one another to maximize individual profit in a non-cooperative competitive market. This competitive setting is interesting and worthy of study because the majority of prevailing process systems engineering models largely overlook the non-cooperative strategies that exist in real-world markets. In this work, each player controls a processing network involving intermediate tanks (or pools) where raw materials are blended together before being further combined into final products. Each player then solves a pure or mixed-integer bilinear optimization problem whose profit is influenced by other players. We present several bilevel formulations and numerical results of a novel decomposition algorithm.
Open AccessPooling problems under perfect and imperfect competition
We investigate pooling problems in which multiple players vie with one another to maximize individual profit in a non-cooperative competitive market. This competitive setting is interesting and worthy of study because the majority of prevailing process systems engineering models largely overlook the non-cooperative strategies that exist in real-world markets. In this work, each player controls a processing network involving intermediate tanks (or pools) where raw materials are blended together before being further combined into final products. Each player then solves a pure or mixed-integer bilinear optimization problem whose profit is influenced by other players. We present several bilevel formulations and numerical results of a novel decomposition algorithm.
- 19 November 2022
- Published by Elsevier in Computers & Chemical Engineering
- Vol. 169
Pooling problems under perfect and imperfect competition
- 19 November 2022
- Published by Elsevier in Computers & Chemical Engineering
- Vol. 169
Pooling problems under perfect and imperfect competition
- 7 March 2022
- Published by Wiley in AIChE Journal
- Vol. 68 (6)
Perspectives of quantum computing for chemical engineering
Quantum computing has been attracting public attention recently. This interest is driven by the advancements in hardware, software, and algorithms required for its successful usage and the promise that it entails the potential acceleration of computational tasks compared to classical computing. This perspective article presents a short review on quantum computing, how this computational approach solves problems, and three fields that quantum computing can potentially impact the most while relevant to chemical engineering: computational chemistry, optimization, and machine learning. Here, we present a series of chemical engineering applications, the developments, potential improvements with respect to classical computing, and challenges that quantum computing faces for each of these fields. This article intends to provide a clear picture of the challenges and potential advantages that quantum technology may yield for chemical engineering, together with an invitation for our colleagues to join us in the adoption and development of quantum computing.
- 7 March 2022
- Published by Wiley in AIChE Journal
- Vol. 68 (6)
Perspectives of quantum computing for chemical engineering
Quantum computing has been attracting public attention recently. This interest is driven by the advancements in hardware, software, and algorithms required for its successful usage and the promise that it entails the potential acceleration of computational tasks compared to classical computing. This perspective article presents a short review on quantum computing, how this computational approach solves problems, and three fields that quantum computing can potentially impact the most while relevant to chemical engineering: computational chemistry, optimization, and machine learning. Here, we present a series of chemical engineering applications, the developments, potential improvements with respect to classical computing, and challenges that quantum computing faces for each of these fields. This article intends to provide a clear picture of the challenges and potential advantages that quantum technology may yield for chemical engineering, together with an invitation for our colleagues to join us in the adoption and development of quantum computing.
- Open Access
- 14 January 2022
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Quantum Computing
- Vol. 3 (1) , 1-20
Improving the Variational Quantum Eigensolver Using Variational Adiabatic Quantum Computing
The variational quantum eigensolver (VQE) is a hybrid quantum-classical algorithm for finding the minimum eigenvalue of a Hamiltonian that involves the optimization of a parameterized quantum circuit. Since the resulting optimization problem is in general nonconvex, the method can converge to suboptimal parameter values that do not yield the minimum eigenvalue. In this work, we address this shortcoming by adopting the concept of variational adiabatic quantum computing (VAQC) as a procedure to improve VQE. In VAQC, the ground state of a continuously parameterized Hamiltonian is approximated via a parameterized quantum circuit. We discuss some basic theory of VAQC to motivate the development of a hybrid quantum-classical homotopy continuation method. The proposed method has parallels with a predictor-corrector method for numerical integration of differential equations. While there are theoretical limitations to the procedure, we see in practice that VAQC can successfully find good initial circuit parameters to initialize VQE. We demonstrate this with two examples from quantum chemistry. Through these examples, we provide empirical evidence that VAQC, combined with other techniques (an adaptive termination criteria for the classical optimizer and a variance-based resampling method for the expectation evaluation), can provide more accurate solutions than “plain” VQE, for the same amount of effort.
- 14 January 2022
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Quantum Computing
- Vol. 3 (1) , 1-20
Open AccessImproving the Variational Quantum Eigensolver Using Variational Adiabatic Quantum Computing
The variational quantum eigensolver (VQE) is a hybrid quantum-classical algorithm for finding the minimum eigenvalue of a Hamiltonian that involves the optimization of a parameterized quantum circuit. Since the resulting optimization problem is in general nonconvex, the method can converge to suboptimal parameter values that do not yield the minimum eigenvalue. In this work, we address this shortcoming by adopting the concept of variational adiabatic quantum computing (VAQC) as a procedure to improve VQE. In VAQC, the ground state of a continuously parameterized Hamiltonian is approximated via a parameterized quantum circuit. We discuss some basic theory of VAQC to motivate the development of a hybrid quantum-classical homotopy continuation method. The proposed method has parallels with a predictor-corrector method for numerical integration of differential equations. While there are theoretical limitations to the procedure, we see in practice that VAQC can successfully find good initial circuit parameters to initialize VQE. We demonstrate this with two examples from quantum chemistry. Through these examples, we provide empirical evidence that VAQC, combined with other techniques (an adaptive termination criteria for the classical optimizer and a variance-based resampling method for the expectation evaluation), can provide more accurate solutions than “plain” VQE, for the same amount of effort.
- Open Access
Improving the variational quantum eigensolver using variational adiabatic quantum computing
The variational quantum eigensolver (VQE) is a hybrid quantum-classical algorithm for finding the minimum eigenvalue of a Hamiltonian that involves the optimization of a parameterized quantum circuit. Since the resulting optimization problem is in general nonconvex, the method can converge to suboptimal parameter values which do not yield the minimum eigenvalue. In this work, we address this shortcoming by adopting the concept of variational adiabatic quantum computing (VAQC) as a procedure to improve VQE. In VAQC, the ground state of a continuously parameterized Hamiltonian is approximated via a parameterized quantum circuit. We discuss some basic theory of VAQC to motivate the development of a hybrid quantum-classical homotopy continuation method. The proposed method has parallels with a predictor-corrector method for numerical integration of differential equations. While there are theoretical limitations to the procedure, we see in practice that VAQC can successfully find good initial circuit parameters to initialize VQE. We demonstrate this with two examples from quantum chemistry. Through these examples, we provide empirical evidence that VAQC, combined with other techniques (an adaptive termination criteria for the classical optimizer and a variance-based resampling method for the expectation evaluation), can provide more accurate solutions than "plain" VQE, for the same amount of effort.
Open AccessImproving the variational quantum eigensolver using variational adiabatic quantum computing
The variational quantum eigensolver (VQE) is a hybrid quantum-classical algorithm for finding the minimum eigenvalue of a Hamiltonian that involves the optimization of a parameterized quantum circuit. Since the resulting optimization problem is in general nonconvex, the method can converge to suboptimal parameter values which do not yield the minimum eigenvalue. In this work, we address this shortcoming by adopting the concept of variational adiabatic quantum computing (VAQC) as a procedure to improve VQE. In VAQC, the ground state of a continuously parameterized Hamiltonian is approximated via a parameterized quantum circuit. We discuss some basic theory of VAQC to motivate the development of a hybrid quantum-classical homotopy continuation method. The proposed method has parallels with a predictor-corrector method for numerical integration of differential equations. While there are theoretical limitations to the procedure, we see in practice that VAQC can successfully find good initial circuit parameters to initialize VQE. We demonstrate this with two examples from quantum chemistry. Through these examples, we provide empirical evidence that VAQC, combined with other techniques (an adaptive termination criteria for the classical optimizer and a variance-based resampling method for the expectation evaluation), can provide more accurate solutions than "plain" VQE, for the same amount of effort.
- Open Access
- 28 January 2021
- Published by Springer Nature in Operations Research Forum
- Vol. 2 (1) , 1-29
Analysis of the Alternating Direction Method of Multipliers for Nonconvex Problems
- 28 January 2021
- Published by Springer Nature in Operations Research Forum
- Vol. 2 (1) , 1-29
Open AccessAnalysis of the Alternating Direction Method of Multipliers for Nonconvex Problems
- 11 September 2020
- Published by Springer Nature in Optimization Letters
- Vol. 15 (4) , 1485-1490
A note on semi-infinite program bounding methods
- 11 September 2020
- Published by Springer Nature in Optimization Letters
- Vol. 15 (4) , 1485-1490
A note on semi-infinite program bounding methods