Frank Gaitan
Frank Gaitan has a total of 23 co-authors. Here are the top co-authors by number of shared publications:
Yuchen Peng
Department of Physics University of Maryland 20742 College Park MD
3 shared publicationsHunter Rouillard
Laboratory for Physical Sciences
2 shared publicationsLane Clark
Department of Mathematics, Southern Illinois University, Carbondale, USA
2 shared publicationsMani Ranjbar
D-Wave Systems, Inc., Burnaby, Canada
2 shared publicationsWilliam G. Macready
D-Wave Systems, Inc., Burnaby, Canada
2 shared publications- Biswajit Basu
Department of Pharmaceutical Technology, School of Health & Medical Sciences, Adamas University, Barasat, Kolkata, India
1 shared publication
Latest Publications
- Open Access
- 17 November 2025
- Published by American Physical Society (APS) in Physical Review A
- Vol. 112 (5)
Incorporating high-accuracy, finite-volume shock stabilization methods into a quantum algorithm for nonlinear partial differential equations
Conservation laws are of fundamental importance in science and engineering, and so are ubiquitous in applications. For continuum systems such as classical fluids and plasmas, they give rise to coupled systems of nonlinear partial differential equations (PDEs) whose solutions can develop discontinuities such as shocks. Finite-volume (FV) methods are an important tool for finding approximate solutions to such PDEs as they are based on an integral formulation of the conservation laws that can handle the presence of discontinuities. Weighted essentially nonoscillatory (WENO) methods are a class of high-resolution methods that can (i) produce solutions of arbitrarily high-order accuracy in regions where the solution is smooth, while (ii) simultaneously quashing the development of nonphysical oscillations in the vicinity of discontinuities that often cause numerical simulations to fail. In this paper we show how FV and WENO methods can be incorporated into a quantum algorithm for solving systems of nonlinear PDEs (QPDE) introduced by one of the authors. We numerically simulate application of the modified QPDE algorithm to three verification problems. The first has a smooth solution, while the other two are well-known one-dimensional Riemann problems whose exact solutions contain moving shocks, contact discontinuities, and rarefaction waves. For all three problems excellent agreement is found between the results of the QPDE simulations and the exact solutions.
- 17 November 2025
- Published by American Physical Society (APS) in Physical Review A
- Vol. 112 (5)
Open AccessIncorporating high-accuracy, finite-volume shock stabilization methods into a quantum algorithm for nonlinear partial differential equations
Conservation laws are of fundamental importance in science and engineering, and so are ubiquitous in applications. For continuum systems such as classical fluids and plasmas, they give rise to coupled systems of nonlinear partial differential equations (PDEs) whose solutions can develop discontinuities such as shocks. Finite-volume (FV) methods are an important tool for finding approximate solutions to such PDEs as they are based on an integral formulation of the conservation laws that can handle the presence of discontinuities. Weighted essentially nonoscillatory (WENO) methods are a class of high-resolution methods that can (i) produce solutions of arbitrarily high-order accuracy in regions where the solution is smooth, while (ii) simultaneously quashing the development of nonphysical oscillations in the vicinity of discontinuities that often cause numerical simulations to fail. In this paper we show how FV and WENO methods can be incorporated into a quantum algorithm for solving systems of nonlinear PDEs (QPDE) introduced by one of the authors. We numerically simulate application of the modified QPDE algorithm to three verification problems. The first has a smooth solution, while the other two are well-known one-dimensional Riemann problems whose exact solutions contain moving shocks, contact discontinuities, and rarefaction waves. For all three problems excellent agreement is found between the results of the QPDE simulations and the exact solutions.
- Open Access
- 12 November 2024
- Published by Cambridge University Press (CUP) in Journal of Plasma Physics
- Vol. 90 (6) , 805900601
Classical-quantum simulation of non-equilibrium Marshak waves
In the radiation hydrodynamic simulations used to design inertial confinement fusion (ICF) and pulsed power experiments, nonlinear radiation diffusion tends to dominate CPU time. This raises the interesting question of whether a quantum algorithm can be found for nonlinear radiation diffusion which provides a quantum speedup. Recently, such a quantum algorithm was introduced based on a quantum algorithm for solving systems of nonlinear partial differential equations (PDEs) which provides a quadratic quantum speedup. Here, we apply this quantum PDE (QPDE) algorithm to the problem of a non-equilibrium Marshak wave propagating through a cold, semi-infinite, optically thick target, where the radiation and matter fields are not assumed to be in local thermodynamic equilibrium. The dynamics is governed by a coupled pair of nonlinear PDEs which are solved using the QPDE algorithm, as well as two standard PDE solvers: (i) Python's py-pde solver; and (ii) the KULL ICF simulation code developed at Lawrence-Livermore National Laboratory. We compare the simulation results obtained using the QPDE algorithm and the standard PDE solvers and find excellent agreement.
- 12 November 2024
- Published by Cambridge University Press (CUP) in Journal of Plasma Physics
- Vol. 90 (6) , 805900601
Open AccessClassical-quantum simulation of non-equilibrium Marshak waves
In the radiation hydrodynamic simulations used to design inertial confinement fusion (ICF) and pulsed power experiments, nonlinear radiation diffusion tends to dominate CPU time. This raises the interesting question of whether a quantum algorithm can be found for nonlinear radiation diffusion which provides a quantum speedup. Recently, such a quantum algorithm was introduced based on a quantum algorithm for solving systems of nonlinear partial differential equations (PDEs) which provides a quadratic quantum speedup. Here, we apply this quantum PDE (QPDE) algorithm to the problem of a non-equilibrium Marshak wave propagating through a cold, semi-infinite, optically thick target, where the radiation and matter fields are not assumed to be in local thermodynamic equilibrium. The dynamics is governed by a coupled pair of nonlinear PDEs which are solved using the QPDE algorithm, as well as two standard PDE solvers: (i) Python's py-pde solver; and (ii) the KULL ICF simulation code developed at Lawrence-Livermore National Laboratory. We compare the simulation results obtained using the QPDE algorithm and the standard PDE solvers and find excellent agreement.
- Open Access
- 11 October 2024
- Published by Springer Nature in International Journal of Theoretical Physics
- Vol. 63 (10) , 1-9
Simulating Nonlinear Radiation Diffusion Through Quantum Computing
- 11 October 2024
- Published by Springer Nature in International Journal of Theoretical Physics
- Vol. 63 (10) , 1-9
Open AccessSimulating Nonlinear Radiation Diffusion Through Quantum Computing
- 6 March 2024
- Published by American Physical Society (APS) in Physical Review A
- Vol. 109 (3) , 032604
Circuit implementation of oracles used in a quantum algorithm for solving nonlinear partial differential equations
In 2020 and 2021, the author introduced quantum algorithms for solving the Navier-Stokes equations and systems of nonlinear partial differential equations (PDEs), respectively. These algorithms make use of three quantum oracles. In this paper, we show how all three oracles can be implemented as quantum circuits. We cost the circuit implementations, determining their depth, width, and number of non-Clifford gates used as a function of user-specified (i) error tolerances, and (ii) algorithm success probability. With these quantum oracle circuits in hand, the quantum Navier-Stokes and PDE algorithms are now completely specified as quantum circuits.
- 6 March 2024
- Published by American Physical Society (APS) in Physical Review A
- Vol. 109 (3) , 032604
Circuit implementation of oracles used in a quantum algorithm for solving nonlinear partial differential equations
In 2020 and 2021, the author introduced quantum algorithms for solving the Navier-Stokes equations and systems of nonlinear partial differential equations (PDEs), respectively. These algorithms make use of three quantum oracles. In this paper, we show how all three oracles can be implemented as quantum circuits. We cost the circuit implementations, determining their depth, width, and number of non-Clifford gates used as a function of user-specified (i) error tolerances, and (ii) algorithm success probability. With these quantum oracle circuits in hand, the quantum Navier-Stokes and PDE algorithms are now completely specified as quantum circuits.
- Open Access
- 1 March 2024
- Published by AIP Publishing in Physics of Fluids
- Vol. 36 (3)
A quantum algorithm for computing dispersal of submarine volcanic tephra
In this paper, we develop a quantum computing algorithm for solving the partial differential equation (PDE) for tephra dispersal through advection in the semi-infinite horizontal buoyant region of a submarine volcanic eruption. The concentration of pyroclastic particles in the fluid domain of a hydrothermal megaplume provides important information about the rate of volcanic energy release, mechanism of formation of the megaplume, and submarine depositional patterns. This work leveraging on previous works [F. Gaitan, NPJ Quantum Inf. 6, 61 (2020); F. Gaitan, Adv. Quantum Tech. 4, 2100055 (2021)] further opens up opportunities to solve wider classes of PDEs with different applications of interest. Some additional specific contributions of this work are transforming the semi-infinite spatial domain problem into a problem on a finite spatial domain for applying the quantum algorithm, and the investigation into the effect of spatial and temporal resolution on the solution of PDEs for the quantum algorithm. Furthermore, possible modification of the algorithm with different spatial discretization schemes has been presented and their influence and implications on the solution of the PDE have been discussed. Also, studies are conducted to examine the effect of regularity conditions in time and the presence of statistical noise in the spatial domain, on the solutions obtained using quantum algorithms. The study in this paper paves an important pathway to venture into other types of advection-diffusion problems.
- 1 March 2024
- Published by AIP Publishing in Physics of Fluids
- Vol. 36 (3)
Open AccessA quantum algorithm for computing dispersal of submarine volcanic tephra
In this paper, we develop a quantum computing algorithm for solving the partial differential equation (PDE) for tephra dispersal through advection in the semi-infinite horizontal buoyant region of a submarine volcanic eruption. The concentration of pyroclastic particles in the fluid domain of a hydrothermal megaplume provides important information about the rate of volcanic energy release, mechanism of formation of the megaplume, and submarine depositional patterns. This work leveraging on previous works [F. Gaitan, NPJ Quantum Inf. 6, 61 (2020); F. Gaitan, Adv. Quantum Tech. 4, 2100055 (2021)] further opens up opportunities to solve wider classes of PDEs with different applications of interest. Some additional specific contributions of this work are transforming the semi-infinite spatial domain problem into a problem on a finite spatial domain for applying the quantum algorithm, and the investigation into the effect of spatial and temporal resolution on the solution of PDEs for the quantum algorithm. Furthermore, possible modification of the algorithm with different spatial discretization schemes has been presented and their influence and implications on the solution of the PDE have been discussed. Also, studies are conducted to examine the effect of regularity conditions in time and the presence of statistical noise in the spatial domain, on the solutions obtained using quantum algorithms. The study in this paper paves an important pathway to venture into other types of advection-diffusion problems.
- Open Access
- 7 September 2021
- Published by Wiley in Advanced Quantum Technologies
- Vol. 4 (10) , 2100055
Finding Solutions of the Navier‐Stokes Equations through Quantum Computing—Recent Progress, a Generalization, and Next Steps Forward
Efficient simulation of a quantum system's dynamics is expected to be an important application area for quantum computers as existing classical computers cannot do this. However, quantum systems are not unique in being hard to simulate. For example, classical nonlinear continuum systems and fields are governed by nonlinear partial differential equations whose solution is also hard for classical computers. Solving such equations is essential for many economically important industries/applications such as the aerospace industry, weather‐forecasting, fiber‐optics communication, and plasma magneto‐hydrodynamics. This raises the question: can a quantum computer speed‐up solving these equations? In this Review, a new quantum algorithm is described for solving nonlinear partial differential equations for which the answer is yes. First, a new quantum algorithm is discussed for solving the Navier‐Stokes nonlinear partial differential equations which govern the flow of a viscous fluid. Its construction, verification, and computational cost are described, and it is shown that a significant quantum speed‐up is possible. Its generalization to a quantum algorithm for solving nonlinear partial differential equations is described. The Review closes with a discussion of next steps forward. These new quantum algorithms open up a large new application area for quantum computing with substantial economic impact, including the trillion‐dollar aerospace industry.
- 7 September 2021
- Published by Wiley in Advanced Quantum Technologies
- Vol. 4 (10) , 2100055
Open AccessFinding Solutions of the Navier‐Stokes Equations through Quantum Computing—Recent Progress, a Generalization, and Next Steps Forward
Efficient simulation of a quantum system's dynamics is expected to be an important application area for quantum computers as existing classical computers cannot do this. However, quantum systems are not unique in being hard to simulate. For example, classical nonlinear continuum systems and fields are governed by nonlinear partial differential equations whose solution is also hard for classical computers. Solving such equations is essential for many economically important industries/applications such as the aerospace industry, weather‐forecasting, fiber‐optics communication, and plasma magneto‐hydrodynamics. This raises the question: can a quantum computer speed‐up solving these equations? In this Review, a new quantum algorithm is described for solving nonlinear partial differential equations for which the answer is yes. First, a new quantum algorithm is discussed for solving the Navier‐Stokes nonlinear partial differential equations which govern the flow of a viscous fluid. Its construction, verification, and computational cost are described, and it is shown that a significant quantum speed‐up is possible. Its generalization to a quantum algorithm for solving nonlinear partial differential equations is described. The Review closes with a discussion of next steps forward. These new quantum algorithms open up a large new application area for quantum computing with substantial economic impact, including the trillion‐dollar aerospace industry.
- Open Access
- 16 July 2020
- Published by Springer Nature in npj Quantum Information
- Vol. 6 (1) , 1-6
Finding flows of a Navier–Stokes fluid through quantum computing
There is great interest in using quantum computers to efficiently simulate a quantum system’s dynamics as existing classical computers cannot do this. Little attention, however, has been given to quantum simulation of a classical nonlinear continuum system such as a viscous fluid even though this too is hard for classical computers. Such fluids obey the Navier–Stokes nonlinear partial differential equations, whose solution is essential to the aerospace industry, weather forecasting, plasma magneto-hydrodynamics, and astrophysics. Here we present a quantum algorithm for solving the Navier–Stokes equations. We test the algorithm by using it to find the steady-state inviscid, compressible flow through a convergent-divergent nozzle when a shockwave is (is not) present. We find excellent agreement between numerical simulation results and the exact solution, including shockwave capture when present. Finally, we compare the algorithm’s computational cost to deterministic and random classical algorithms and show that a significant speed-up is possible. Our work points to a large new application area for quantum computing with substantial economic impact, including the trillion-dollar aerospace industry, weather-forecasting, and engineered-plasma technologies.
- 16 July 2020
- Published by Springer Nature in npj Quantum Information
- Vol. 6 (1) , 1-6
Open AccessFinding flows of a Navier–Stokes fluid through quantum computing
There is great interest in using quantum computers to efficiently simulate a quantum system’s dynamics as existing classical computers cannot do this. Little attention, however, has been given to quantum simulation of a classical nonlinear continuum system such as a viscous fluid even though this too is hard for classical computers. Such fluids obey the Navier–Stokes nonlinear partial differential equations, whose solution is essential to the aerospace industry, weather forecasting, plasma magneto-hydrodynamics, and astrophysics. Here we present a quantum algorithm for solving the Navier–Stokes equations. We test the algorithm by using it to find the steady-state inviscid, compressible flow through a convergent-divergent nozzle when a shockwave is (is not) present. We find excellent agreement between numerical simulation results and the exact solution, including shockwave capture when present. Finally, we compare the algorithm’s computational cost to deterministic and random classical algorithms and show that a significant speed-up is possible. Our work points to a large new application area for quantum computing with substantial economic impact, including the trillion-dollar aerospace industry, weather-forecasting, and engineered-plasma technologies.
- Open Access
High-fidelity quantum state preparation using neighboring optimal control
We present an approach to single-shot high-fidelity preparation of an $n$-qubit state based on neighboring optimal control theory. This represents a new application of the neighboring optimal control formalism which was originally developed to produce single-shot high-fidelity quantum gates. To illustrate the approach, and to provide a proof-of-principle, we use it to prepare the two qubit Bell state $|\beta_{01}\rangle = (1/\sqrt{2})\left[\, |01\rangle + |10\rangle\,\right]$ with an error probability $\epsilon\sim 10^{-6}$ ($10^{-5}$) for ideal (non-ideal) control. Using standard methods in the literature, these high-fidelity Bell states can be leveraged to fault-tolerantly prepare the logical state $|\overline{\beta}_{01}\rangle$.Open AccessHigh-fidelity quantum state preparation using neighboring optimal control
We present an approach to single-shot high-fidelity preparation of an $n$-qubit state based on neighboring optimal control theory. This represents a new application of the neighboring optimal control formalism which was originally developed to produce single-shot high-fidelity quantum gates. To illustrate the approach, and to provide a proof-of-principle, we use it to prepare the two qubit Bell state $|\beta_{01}\rangle = (1/\sqrt{2})\left[\, |01\rangle + |10\rangle\,\right]$ with an error probability $\epsilon\sim 10^{-6}$ ($10^{-5}$) for ideal (non-ideal) control. Using standard methods in the literature, these high-fidelity Bell states can be leveraged to fault-tolerantly prepare the logical state $|\overline{\beta}_{01}\rangle$. - 12 September 2017
- Published by Springer Nature in Quantum Information Processing
- Vol. 16 (10) , 261
High-fidelity quantum state preparation using neighboring optimal control
- 12 September 2017
- Published by Springer Nature in Quantum Information Processing
- Vol. 16 (10) , 261
High-fidelity quantum state preparation using neighboring optimal control
- Open Access
- 13 June 2016
- Published by Springer Nature in Quantum Information Processing
- Vol. 15 (9) , 3519-3542
Generalized Ramsey numbers through adiabatic quantum optimization
- 13 June 2016
- Published by Springer Nature in Quantum Information Processing
- Vol. 15 (9) , 3519-3542
Open AccessGeneralized Ramsey numbers through adiabatic quantum optimization