Phillip C. Lotshaw
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Phillip C. Lotshaw has a total of 58 co-authors. Here are the top co-authors by number of shared publications:
- George Siopsis
The University of Tennessee
7 shared publications Travis S. Humble
Quantum Information Science Section Oak Ridge National Laboratory 37381 Oak Ridge TN USA
7 shared publications- Travis S. Humble
Oak Ridge National Laboratory, Oak Ridge, TN, USA
7 shared publications - James Ostrowski
University of Tennessee
5 shared publications - Rebekah Herrman
Department of Industrial and Systems Engineering, University of Tennessee Knoxville, Knoxville, USA
5 shared publications James Ostrowski
Department of Industrial and Systems Engineering University of Tennessee 37996-2315 Knoxville Tennessee USA
4 shared publications
Latest Publications
- Open Access
- 8 September 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Quantum Computing
Convergence guarantee for linearly-constrained combinatorial optimization with a quantum alternating operator ansatz
We present a quantum alternating operator ansatz (QAOA + ) that solves a class of linearly constrained optimization problems by evolving a quantum state within a Hilbert subspace of feasible problem solutions. Our main focus is on a class of problems with a linear constraint containing sequential integer coefficients. For problems in this class, we devise QAOA + circuits that provably converge to the optimal solution as the number of circuit layers increases, generalizing previous guarantees for solving unconstrained problems or problems with symmetric constraints. Our approach includes asymmetric “mixing” Hamiltonians that drive transitions between feasible states, as well as a method to incorporate an arbitrary known feasible solution as the initial state, each of which can be applied beyond the specific linear constraints considered here. This analysis extends QAOA + performance guarantees to a more general set of linearly-constrained problems and provides tools for future generalizations.
- 8 September 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Quantum Computing
Open AccessConvergence guarantee for linearly-constrained combinatorial optimization with a quantum alternating operator ansatz
We present a quantum alternating operator ansatz (QAOA + ) that solves a class of linearly constrained optimization problems by evolving a quantum state within a Hilbert subspace of feasible problem solutions. Our main focus is on a class of problems with a linear constraint containing sequential integer coefficients. For problems in this class, we devise QAOA + circuits that provably converge to the optimal solution as the number of circuit layers increases, generalizing previous guarantees for solving unconstrained problems or problems with symmetric constraints. Our approach includes asymmetric “mixing” Hamiltonians that drive transitions between feasible states, as well as a method to incorporate an arbitrary known feasible solution as the initial state, each of which can be applied beyond the specific linear constraints considered here. This analysis extends QAOA + performance guarantees to a more general set of linearly-constrained problems and provides tools for future generalizations.
- Top Cited Papers
- 19 March 2026
- Published by Elsevier in Future Generation Computer Systems
- Vol. 182
The role of quantum computing in advancing scientific high-performance computing: A perspective from the ADAC institute
- 19 March 2026
- Published by Elsevier in Future Generation Computer Systems
- Vol. 182
Top Cited PapersThe role of quantum computing in advancing scientific high-performance computing: A perspective from the ADAC institute
- Open Access
- 9 June 2025
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 7 (2)
Quantifying the impact of precision errors on quantum approximate optimization algorithms
The quantum approximate optimization algorithm (QAOA) is a hybrid quantum-classical algorithm that seeks to achieve approximate solutions to optimization problems by iteratively alternating between intervals of controlled quantum evolution. Here, we examine the effect of analog precision errors on QAOA performance from the perspective of both algorithmic training and performance guarantees. Leveraging cumulant expansions, we recast the faulty QAOA as a control problem in which precision errors are expressed as multiplicative control noise and derive bounds on the performance of QAOA. We show using both analytical techniques and numerical simulations that fixed precision implementations of QAOA circuits are subject to an exponential degradation in performance dependent upon the number of optimal QAOA layers and magnitude of the precision error. Despite this significant reduction, we show that it is possible to mitigate precision errors in QAOA via digitization of the variational parameters at the cost of increasing circuit depth.
- 9 June 2025
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 7 (2)
Open AccessQuantifying the impact of precision errors on quantum approximate optimization algorithms
The quantum approximate optimization algorithm (QAOA) is a hybrid quantum-classical algorithm that seeks to achieve approximate solutions to optimization problems by iteratively alternating between intervals of controlled quantum evolution. Here, we examine the effect of analog precision errors on QAOA performance from the perspective of both algorithmic training and performance guarantees. Leveraging cumulant expansions, we recast the faulty QAOA as a control problem in which precision errors are expressed as multiplicative control noise and derive bounds on the performance of QAOA. We show using both analytical techniques and numerical simulations that fixed precision implementations of QAOA circuits are subject to an exponential degradation in performance dependent upon the number of optimal QAOA layers and magnitude of the precision error. Despite this significant reduction, we show that it is possible to mitigate precision errors in QAOA via digitization of the variational parameters at the cost of increasing circuit depth.
- 9 September 2024
- Published by American Physical Society (APS) in Physical Review A
- Vol. 110 (3)
Exactly solvable model of light-scattering errors in quantum simulations with metastable trapped-ion qubits
- 9 September 2024
- Published by American Physical Society (APS) in Physical Review A
- Vol. 110 (3)
Exactly solvable model of light-scattering errors in quantum simulations with metastable trapped-ion qubits
- Open Access
Approximate Boltzmann Distributions in Quantum Approximate Optimization
Approaches to compute or estimate the output probability distributions from the quantum approximate optimization algorithm (QAOA) are needed to assess the likelihood it will obtain a quantum computational advantage. We analyze output from QAOA circuits solving 7,200 random MaxCut instances, with $n=14-23$ qubits and depth parameter $p \leq 12$, and find that the average basis state probabilities follow approximate Boltzmann distributions: The average probabilities scale exponentially with their energy (cut value), with a peak at the optimal solution. We describe the rate of exponential scaling or "effective temperature" in terms of a series with a leading order term $T \sim C_\mathrm{min}/n\sqrt{p}$, with $C_\mathrm{min}$ the optimal solution energy. Using this scaling we generate approximate output distributions with up to 38 qubits and find these give accurate accounts of important performance metrics in cases we can simulate exactly.Open AccessApproximate Boltzmann Distributions in Quantum Approximate Optimization
Approaches to compute or estimate the output probability distributions from the quantum approximate optimization algorithm (QAOA) are needed to assess the likelihood it will obtain a quantum computational advantage. We analyze output from QAOA circuits solving 7,200 random MaxCut instances, with $n=14-23$ qubits and depth parameter $p \leq 12$, and find that the average basis state probabilities follow approximate Boltzmann distributions: The average probabilities scale exponentially with their energy (cut value), with a peak at the optimal solution. We describe the rate of exponential scaling or "effective temperature" in terms of a series with a leading order term $T \sim C_\mathrm{min}/n\sqrt{p}$, with $C_\mathrm{min}$ the optimal solution energy. Using this scaling we generate approximate output distributions with up to 38 qubits and find these give accurate accounts of important performance metrics in cases we can simulate exactly. - Open Access
Modelling noise in global Molmer-Sorensen interactions applied to quantum approximate optimization
Many-qubit M{\o}lmer-S{\o}rensen (MS) interactions applied to trapped ions offer unique capabilities for quantum information processing, with applications including quantum simulation and the quantum approximate optimization algorithm (QAOA). Here, we develop a physical model to describe many-qubit MS interactions under four sources of experimental noise: vibrational mode frequency fluctuations, laser power fluctuations, thermal initial vibrational states, and state preparation and measurement errors. The model parameterizes these errors from simple experimental measurements, without free parameters. We validate the model in comparison with experiments that implement sequences of MS interactions on two $^{171}$Yb$^+$ ions. The model shows reasonable agreement after several MS interactions as quantified by the reduced chi-squared statistic $\chi^2_\mathrm{red} \approx 2$. As an application we examine MaxCut QAOA experiments on three and six ions. The experimental performance is quantified by approximation ratios that are $91\%$ and $83\%$ of the optimal theoretical values. Our model predicts $0.93^{+0.03}_{-0.02}$ and $0.95^{+0.04}_{-0.03}$, respectively, with disagreement in the latter value attributable to secondary noise sources beyond those considered in our analysis. With realistic experimental improvements to reduce measurement error and radial trap frequency variations the model achieves approximation ratios that are 99$\%$ of the optimal. Incorporating these improvements into future experiments is expected to reveal new aspects of noise for future modeling and experimental improvements.Open AccessModelling noise in global Molmer-Sorensen interactions applied to quantum approximate optimization
Many-qubit M{\o}lmer-S{\o}rensen (MS) interactions applied to trapped ions offer unique capabilities for quantum information processing, with applications including quantum simulation and the quantum approximate optimization algorithm (QAOA). Here, we develop a physical model to describe many-qubit MS interactions under four sources of experimental noise: vibrational mode frequency fluctuations, laser power fluctuations, thermal initial vibrational states, and state preparation and measurement errors. The model parameterizes these errors from simple experimental measurements, without free parameters. We validate the model in comparison with experiments that implement sequences of MS interactions on two $^{171}$Yb$^+$ ions. The model shows reasonable agreement after several MS interactions as quantified by the reduced chi-squared statistic $\chi^2_\mathrm{red} \approx 2$. As an application we examine MaxCut QAOA experiments on three and six ions. The experimental performance is quantified by approximation ratios that are $91\%$ and $83\%$ of the optimal theoretical values. Our model predicts $0.93^{+0.03}_{-0.02}$ and $0.95^{+0.04}_{-0.03}$, respectively, with disagreement in the latter value attributable to secondary noise sources beyond those considered in our analysis. With realistic experimental improvements to reduce measurement error and radial trap frequency variations the model achieves approximation ratios that are 99$\%$ of the optimal. Incorporating these improvements into future experiments is expected to reveal new aspects of noise for future modeling and experimental improvements. - Open Access
Simulations of Frustrated Ising Hamiltonians with Quantum Approximate Optimization
Novel magnetic materials are important for future technological advances. Theoretical and numerical calculations of ground state properties are essential in understanding these materials, however, computational complexity limits conventional methods for studying these states. Here we investigate an alternative approach to preparing materials ground states using the quantum approximate optimization algorithm (QAOA) on near-term quantum computers. We study classical Ising spin models on unit cells of square, Shastry-Sutherland, and triangular lattices, with varying field amplitudes and couplings in the material Hamiltonian. We find relationships between the theoretical QAOA success probability and the structure of the ground state, indicating that only a modest number of measurements ($\lesssim100$) are needed to find the ground state of our nine-spin Hamiltonians, even for parameters leading to frustrated magnetism. We further demonstrate the approach in calculations on a trapped-ion quantum computer and succeed in recovering each ground state of the Shastry-Sutherland unit cell with probabilities close to ideal theoretical values. The results demonstrate the viability of QAOA for materials ground state preparation in the frustrated Ising limit, giving important first steps towards larger sizes and more complex Hamiltonians where quantum computational advantage may prove essential in developing a systematic understanding of novel materials.
Open AccessSimulations of Frustrated Ising Hamiltonians with Quantum Approximate Optimization
Novel magnetic materials are important for future technological advances. Theoretical and numerical calculations of ground state properties are essential in understanding these materials, however, computational complexity limits conventional methods for studying these states. Here we investigate an alternative approach to preparing materials ground states using the quantum approximate optimization algorithm (QAOA) on near-term quantum computers. We study classical Ising spin models on unit cells of square, Shastry-Sutherland, and triangular lattices, with varying field amplitudes and couplings in the material Hamiltonian. We find relationships between the theoretical QAOA success probability and the structure of the ground state, indicating that only a modest number of measurements ($\lesssim100$) are needed to find the ground state of our nine-spin Hamiltonians, even for parameters leading to frustrated magnetism. We further demonstrate the approach in calculations on a trapped-ion quantum computer and succeed in recovering each ground state of the Shastry-Sutherland unit cell with probabilities close to ideal theoretical values. The results demonstrate the viability of QAOA for materials ground state preparation in the frustrated Ising limit, giving important first steps towards larger sizes and more complex Hamiltonians where quantum computational advantage may prove essential in developing a systematic understanding of novel materials.
- 12 October 2023
- Published by American Physical Society (APS) in Physical Review A
- Vol. 108 (4) , 042411
Approximate Boltzmann distributions in quantum approximate optimization
Approaches to compute or estimate the output probability distributions from the quantum approximate optimization algorithm (QAOA) are needed to assess the likelihood it will obtain a quantum computational advantage. We analyze output from QAOA circuits solving 7200 random MaxCut instances, with qubits and depth parameter , and find that the average basis state probabilities follow approximate Boltzmann distributions: The average probabilities scale exponentially with their energy (cut value), with a peak at the optimal solution. We describe the rate of exponential scaling or effective temperature in terms of a series with a leading-order term , with the optimal solution energy. Using this scaling, we generate approximate output distributions with up to 38 qubits and find these give accurate accounts of important performance metrics in cases we can simulate exactly.- 12 October 2023
- Published by American Physical Society (APS) in Physical Review A
- Vol. 108 (4) , 042411
Approximate Boltzmann distributions in quantum approximate optimization
Approaches to compute or estimate the output probability distributions from the quantum approximate optimization algorithm (QAOA) are needed to assess the likelihood it will obtain a quantum computational advantage. We analyze output from QAOA circuits solving 7200 random MaxCut instances, with qubits and depth parameter , and find that the average basis state probabilities follow approximate Boltzmann distributions: The average probabilities scale exponentially with their energy (cut value), with a peak at the optimal solution. We describe the rate of exponential scaling or effective temperature in terms of a series with a leading-order term , with the optimal solution energy. Using this scaling, we generate approximate output distributions with up to 38 qubits and find these give accurate accounts of important performance metrics in cases we can simulate exactly.- 12 July 2023
- Published by Springer Nature in Quantum Information Processing
- Vol. 22 (7) , 1-18
Solving MaxCut with quantum imaginary time evolution
- 12 July 2023
- Published by Springer Nature in Quantum Information Processing
- Vol. 22 (7) , 1-18
Solving MaxCut with quantum imaginary time evolution
- 5 June 2023
- Published by American Physical Society (APS) in Physical Review A
- Vol. 107 (6) , 062406
Modeling noise in global Mølmer-Sørensen interactions applied to quantum approximate optimization
Many-qubit Mølmer-Sørensen (MS) interactions applied to trapped ions offer unique capabilities for quantum information processing, with applications including quantum simulation and the quantum approximate optimization algorithm (QAOA). Here, we develop a physical model to describe many-qubit MS interactions under four sources of experimental noise: vibrational mode frequency fluctuations, laser power fluctuations, thermal initial vibrational states, and state preparation and measurement errors. The model parametrizes these errors from simple experimental measurements, without free parameters. We validate the model in comparison with experiments that implement sequences of MS interactions on two ions. The model shows reasonable agreement after several MS interactions as quantified by the reduced chi-squared statistic . As an application we examine MaxCut QAOA experiments on three and six ions. The experimental performance is quantified by approximation ratios that are and of the optimal theoretical values. Our model predicts and , respectively, with disagreement in the latter value attributable to secondary noise sources beyond those considered in our analysis. With realistic experimental improvements to reduce measurement error and radial trap frequency variations, the model achieves approximation ratios that are of the optimal. Incorporating these improvements into future experiments is expected to reveal new aspects of noise for future modeling and experimental improvements.- 5 June 2023
- Published by American Physical Society (APS) in Physical Review A
- Vol. 107 (6) , 062406
Modeling noise in global Mølmer-Sørensen interactions applied to quantum approximate optimization
Many-qubit Mølmer-Sørensen (MS) interactions applied to trapped ions offer unique capabilities for quantum information processing, with applications including quantum simulation and the quantum approximate optimization algorithm (QAOA). Here, we develop a physical model to describe many-qubit MS interactions under four sources of experimental noise: vibrational mode frequency fluctuations, laser power fluctuations, thermal initial vibrational states, and state preparation and measurement errors. The model parametrizes these errors from simple experimental measurements, without free parameters. We validate the model in comparison with experiments that implement sequences of MS interactions on two ions. The model shows reasonable agreement after several MS interactions as quantified by the reduced chi-squared statistic . As an application we examine MaxCut QAOA experiments on three and six ions. The experimental performance is quantified by approximation ratios that are and of the optimal theoretical values. Our model predicts and , respectively, with disagreement in the latter value attributable to secondary noise sources beyond those considered in our analysis. With realistic experimental improvements to reduce measurement error and radial trap frequency variations, the model achieves approximation ratios that are of the optimal. Incorporating these improvements into future experiments is expected to reveal new aspects of noise for future modeling and experimental improvements.