John P. T. Stenger
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
John P. T. Stenger has a total of 18 co-authors. Here are the top co-authors by number of shared publications:
- Daniel Gunlycke
U.S. Naval Research Laboratory
5 shared publications Daniel Gunlycke
U.S. Naval Research Laboratory
4 shared publications- C. Stephen Hellberg
U.S. Naval Research Laboratory
3 shared publications - Gloria Bazargan
U.S. Naval Research Laboratory
2 shared publications - Joanna N. Ptasinski
Naval Information Warfare Center Pacific, San Diego, CA 92152, USA
2 shared publications - Joseph A. Diaz
Naval Information Warfare Center Pacific, San Diego, CA 92152, USA
2 shared publications
Latest Publications
- 16 October 2026
- Published by American Physical Society (APS) in Physical Review A
- Vol. 114 (4) , 042436
Probability distribution analysis of the cascaded variational quantum eigensolver
The cascaded variational quantum eigensolver (CVQE) circumvents the need for iterative communication between the quantum and classical processing units that is necessary in the conventional VQE algorithm. While CVQE offers complete freedom to choose the guiding state as input, not all guiding states provide both accurate solutions and efficient resource usage. Our work presents a process based on trapezoidal-state preparation for selecting guiding states that yield accurate many-electron ground-state solutions with minimal resource consumption. By analyzing state probability distributions at different stages of CVQE calculations for the collision complex mediating the ${\mathrm{H}}_{2}+{\mathrm{H}}_{2}{}^{+}\ensuremath{\rightarrow}{\mathrm{H}}_{3}{}^{+}+\mathrm{H}$ bimolecular reaction, we identify stage-specific errors, trace their impact on final classical optimization, and determine the optimal guiding-state parameters for given resource constraints. Our findings uncover a critical trade-off on noisy intermediate-scale quantum devices, demonstrating that shallower diabatic circuits provide the best compromise among optimization efficiency, state quality, sampling cost, and signal-to-noise ratio in our system.- 16 October 2026
- Published by American Physical Society (APS) in Physical Review A
- Vol. 114 (4) , 042436
Probability distribution analysis of the cascaded variational quantum eigensolver
The cascaded variational quantum eigensolver (CVQE) circumvents the need for iterative communication between the quantum and classical processing units that is necessary in the conventional VQE algorithm. While CVQE offers complete freedom to choose the guiding state as input, not all guiding states provide both accurate solutions and efficient resource usage. Our work presents a process based on trapezoidal-state preparation for selecting guiding states that yield accurate many-electron ground-state solutions with minimal resource consumption. By analyzing state probability distributions at different stages of CVQE calculations for the collision complex mediating the ${\mathrm{H}}_{2}+{\mathrm{H}}_{2}{}^{+}\ensuremath{\rightarrow}{\mathrm{H}}_{3}{}^{+}+\mathrm{H}$ bimolecular reaction, we identify stage-specific errors, trace their impact on final classical optimization, and determine the optimal guiding-state parameters for given resource constraints. Our findings uncover a critical trade-off on noisy intermediate-scale quantum devices, demonstrating that shallower diabatic circuits provide the best compromise among optimization efficiency, state quality, sampling cost, and signal-to-noise ratio in our system.- Open Access
- 8 September 2026
- Published by American Physical Society (APS) in APS Open Science
- Vol. 1, 000127
Simulation of unimolecular fluoromethane dissociation on a quantum computer using the cascaded variational quantum eigensolver algorithm
Simulating chemical reactions on quantum computers has the potential to offer insight that cannot be gained practically from conventional quantum-chemical approaches on classical computers. This is because quantum computing provides a platform for efficient, high-level electronic structure calculations that approach the full configuration interaction (FCI) limit. Herein, we apply the cascaded variational quantum eigensolver (CVQE) algorithm to simulate the unimolecular dissociation of fluoromethane ( CH 3 F ) by two pathways: (1) CH 3 F → CH 2 + HF and (2) CH 3 F → CHF + H 2 . We compare the results of CVQE calculations performed on the quantum computer to configuration interaction benchmarks run on a classical computer. Our results demonstrate that CVQE predicts lower energies than classical configuration interaction with singles, doubles, and triples for all geometries considered, and achieves chemical accuracy relative to FCI in nearly all cases. This suggests that quantum computing with CVQE can provide high-level electronic structure information for chemical reactions and other cases that require the simulation of multiple geometries.
- 8 September 2026
- Published by American Physical Society (APS) in APS Open Science
- Vol. 1, 000127
Open AccessSimulation of unimolecular fluoromethane dissociation on a quantum computer using the cascaded variational quantum eigensolver algorithm
Simulating chemical reactions on quantum computers has the potential to offer insight that cannot be gained practically from conventional quantum-chemical approaches on classical computers. This is because quantum computing provides a platform for efficient, high-level electronic structure calculations that approach the full configuration interaction (FCI) limit. Herein, we apply the cascaded variational quantum eigensolver (CVQE) algorithm to simulate the unimolecular dissociation of fluoromethane ( CH 3 F ) by two pathways: (1) CH 3 F → CH 2 + HF and (2) CH 3 F → CHF + H 2 . We compare the results of CVQE calculations performed on the quantum computer to configuration interaction benchmarks run on a classical computer. Our results demonstrate that CVQE predicts lower energies than classical configuration interaction with singles, doubles, and triples for all geometries considered, and achieves chemical accuracy relative to FCI in nearly all cases. This suggests that quantum computing with CVQE can provide high-level electronic structure information for chemical reactions and other cases that require the simulation of multiple geometries.
- Open Access
- 1 September 2026
- Published by IOP Publishing in New Journal of Physics
- Vol. 28 (9) , 094505
Hybrid VQE-CVQE algorithm using diabatic state preparation
We propose a hybrid variational quantum algorithm that has variational parameters used by both the quantum circuit and the subsequent classical optimization. Similar to the variational quantum eigensolver, this algorithm applies a parameterized unitary operator to the qubit register. We generate this operator using diabatic state preparation. The quantum measurement results then inform the classical optimization procedure used by the cascaded variational quantum eigensolver. We demonstrate the algorithm on a system of interacting electrons and show how it can be used on long-term error-corrected as well as short-term intermediate-scale quantum computers. Our simulations performed on IBM Brisbane produced energies well within chemical accuracy.
- 1 September 2026
- Published by IOP Publishing in New Journal of Physics
- Vol. 28 (9) , 094505
Open AccessHybrid VQE-CVQE algorithm using diabatic state preparation
We propose a hybrid variational quantum algorithm that has variational parameters used by both the quantum circuit and the subsequent classical optimization. Similar to the variational quantum eigensolver, this algorithm applies a parameterized unitary operator to the qubit register. We generate this operator using diabatic state preparation. The quantum measurement results then inform the classical optimization procedure used by the cascaded variational quantum eigensolver. We demonstrate the algorithm on a system of interacting electrons and show how it can be used on long-term error-corrected as well as short-term intermediate-scale quantum computers. Our simulations performed on IBM Brisbane produced energies well within chemical accuracy.
- Open Access
- 1 April 2026
- Published by MDPI AG in Quantum Reports
- Vol. 8 (2) , 30
QGeo: A Python Package for Calculating Geodesic Control Functions for Quantum Computing
We present a new Python package that uses the formalism of geometric quantum complexity to numerically compute metric-dependent geometric cost and control functions associated with preparing a given unitary transformation on a quantum computer. The numerical procedure we implement is presented and discussed. Analyzed quantum circuits include: the quantum Fourier transform for up to four qubits, a random circuit with depth 100, and a circuit for analyzing the evolution of a fermionic chain with several lattice sites.
- 1 April 2026
- Published by MDPI AG in Quantum Reports
- Vol. 8 (2) , 30
Open AccessQGeo: A Python Package for Calculating Geodesic Control Functions for Quantum Computing
We present a new Python package that uses the formalism of geometric quantum complexity to numerically compute metric-dependent geometric cost and control functions associated with preparing a given unitary transformation on a quantum computer. The numerical procedure we implement is presented and discussed. Analyzed quantum circuits include: the quantum Fourier transform for up to four qubits, a random circuit with depth 100, and a circuit for analyzing the evolution of a fermionic chain with several lattice sites.
- Open Access
- 17 July 2025
- Published by MDPI AG in Quantum Reports
- Vol. 7 (3) , 32
Efficient Encoding of the Traveling Salesperson Problem on a Quantum Computer
We propose an amplitude encoding of the traveling salesperson problem along with a method for calculating the cost function using a probability distribution obtained on a quantum computer. Our encoding requires a number of qubits that grows logarithmically with the number of cities. We propose to calculate the cost function using a nonlinear function of expectation values of quantum operators. This is in contrast to the typical method of evaluating the cost function by summing expectation values of quantum operators. We demonstrate our method using a variational quantum eigensolver algorithm to find the shortest route for a given graph. We find that there is a broad range in the hyperparameters of the optimization procedure for which the best route is found.
- 17 July 2025
- Published by MDPI AG in Quantum Reports
- Vol. 7 (3) , 32
Open AccessEfficient Encoding of the Traveling Salesperson Problem on a Quantum Computer
We propose an amplitude encoding of the traveling salesperson problem along with a method for calculating the cost function using a probability distribution obtained on a quantum computer. Our encoding requires a number of qubits that grows logarithmically with the number of cities. We propose to calculate the cost function using a nonlinear function of expectation values of quantum operators. This is in contrast to the typical method of evaluating the cost function by summing expectation values of quantum operators. We demonstrate our method using a variational quantum eigensolver algorithm to find the shortest route for a given graph. We find that there is a broad range in the hyperparameters of the optimization procedure for which the best route is found.
- Open Access
- 4 September 2024
- Published by Springer Nature in Research Square
Efficient encoding of the traveling salesperson problem on a quantum computer
We propose an amplitude encoding of the traveling salesperson problem along with a method for calculating the cost function. Our encoding requires a number of qubits which grows logarithmically with the number of cities. We propose to calculate the cost function classically based on the probability distribution extracted from measuring the quantum computer. This is in contrast from the typical method of evaluating the cost function by taking the expectation value of a quantum operator. We demonstrate our method using a variational quantum eigensolver algorithm to find the shortest route for a given graph. We find that there is a broad range in the hyperparameters of the optimization procedure for which the best route is found.
- 4 September 2024
- Published by Springer Nature in Research Square
Open AccessEfficient encoding of the traveling salesperson problem on a quantum computer
We propose an amplitude encoding of the traveling salesperson problem along with a method for calculating the cost function. Our encoding requires a number of qubits which grows logarithmically with the number of cities. We propose to calculate the cost function classically based on the probability distribution extracted from measuring the quantum computer. This is in contrast from the typical method of evaluating the cost function by taking the expectation value of a quantum operator. We demonstrate our method using a variational quantum eigensolver algorithm to find the shortest route for a given graph. We find that there is a broad range in the hyperparameters of the optimization procedure for which the best route is found.
- Open Access
- 31 May 2024
- Published by Springer Nature in Quantum Information Processing
- Vol. 23 (6) , 1-17
Preparing quantum statistical ensembles using mid-circuit measurements
We explore the relationship between entropy and quantum measurements and present a variational algorithm for preparing statistical ensembles on quantum computers using mid-circuit measurements. This algorithm optimizes both the entropy and variational parameters describing the state to obtain the minimum free energy of quantum systems in thermal equilibrium with some external heat bath. We demonstrate our algorithm on IBM-Q Lagos.
- 31 May 2024
- Published by Springer Nature in Quantum Information Processing
- Vol. 23 (6) , 1-17
Open AccessPreparing quantum statistical ensembles using mid-circuit measurements
We explore the relationship between entropy and quantum measurements and present a variational algorithm for preparing statistical ensembles on quantum computers using mid-circuit measurements. This algorithm optimizes both the entropy and variational parameters describing the state to obtain the minimum free energy of quantum systems in thermal equilibrium with some external heat bath. We demonstrate our algorithm on IBM-Q Lagos.
- Open Access
- 2 May 2024
- Published by American Chemical Society (ACS) in ACS Omega
- Vol. 9 (19) , 21353-21364
Demonstration of the Effectiveness of the Cascaded Variational Quantum Eigensolver Using the Jastrow Ansatz for Molecular Calculations
We demonstrate how the cascaded variational quantum eigensolver (CVQE) can be applied to study molecular systems for the family of Jastrow ansatzes. Specifically, we applied CVQE to the water molecule. We find that CVQE has a number of advantages. In particular, our results show that CVQE requires 2 to 3 orders of magnitude fewer quantum computing (QC) executions than VQE for the water molecule. Furthermore, our results indicate that CVQE might provide some robustness against two-qubit gate errors given that the number of CNOT gates used in our calculation was ∼300 and the errors in the QC calculations are still comparable to those obtained by VQE.
- 2 May 2024
- Published by American Chemical Society (ACS) in ACS Omega
- Vol. 9 (19) , 21353-21364
Open AccessDemonstration of the Effectiveness of the Cascaded Variational Quantum Eigensolver Using the Jastrow Ansatz for Molecular Calculations
We demonstrate how the cascaded variational quantum eigensolver (CVQE) can be applied to study molecular systems for the family of Jastrow ansatzes. Specifically, we applied CVQE to the water molecule. We find that CVQE has a number of advantages. In particular, our results show that CVQE requires 2 to 3 orders of magnitude fewer quantum computing (QC) executions than VQE for the water molecule. Furthermore, our results indicate that CVQE might provide some robustness against two-qubit gate errors given that the number of CNOT gates used in our calculation was ∼300 and the errors in the QC calculations are still comparable to those obtained by VQE.
- Open Access
- 6 March 2024
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 6 (1) , 013238
Cascaded variational quantum eigensolver algorithm
We present a cascaded variational quantum eigensolver algorithm that only requires the execution of a set of quantum circuits once rather than at every iteration during the parameter optimization process, thereby increasing the computational throughput. This algorithm uses a quantum processing unit to probe the needed probability mass functions and a classical processing unit perform the remaining calculations, including the energy minimization. The ansatz form does not restrict the Fock space and provides full control over the trial state, including the implementation of symmetry and other physically motivated constraints. Published by the American Physical Society 2024
- 6 March 2024
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 6 (1) , 013238
Open AccessCascaded variational quantum eigensolver algorithm
We present a cascaded variational quantum eigensolver algorithm that only requires the execution of a set of quantum circuits once rather than at every iteration during the parameter optimization process, thereby increasing the computational throughput. This algorithm uses a quantum processing unit to probe the needed probability mass functions and a classical processing unit perform the remaining calculations, including the energy minimization. The ansatz form does not restrict the Fock space and provides full control over the trial state, including the implementation of symmetry and other physically motivated constraints. Published by the American Physical Society 2024