Quantum computers can be used to simulate nonlinear non-Hamiltonian classical dynamics on phase space by using the generalized Koopman–von Neumann formulation of classical mechanics. The Koopman–von Neumann formulation implies that the conservation of the probability distribution function on phase space, as expressed by the Liouville equation, can be recast as an equivalent Schrödinger equation on Hilbert space with a Hermitian Hamiltonian operator and a unitary propagator. This Schrödinger equation is linear in the momenta because it derives from a constrained Hamiltonian system with twice the classical phase-space dimension. A quantum computer with finite resources can be used to simulate a finite-dimensional approximation of this unitary evolution operator. Quantum simulation of classical dynamics is exponentially more efficient than a deterministic Eulerian discretization of the Liouville equation if the Koopman–von Neumann Hamiltonian is sparse. Utilizing quantum walk techniques for state preparation and amplitude estimation for the calculation of observables leads to a quadratic improvement over classical probabilistic Monte Carlo algorithms.
This is a review of recent research exploring and extending present-day quantum computing capabilities for fusion energy science applications. We begin with a brief tutorial on both ideal and open quantum dynamics, universal quantum computation, and quantum algorithms. Then, we explore the topic of using quantum computers to simulate both linear and nonlinear dynamics in greater detail. Because quantum computers can only efficiently perform linear operations on the quantum state, it is challenging to perform nonlinear operations that are generically required to describe the nonlinear differential equations of interest. In this work, we extend previous results on embedding nonlinear systems within linear systems by explicitly deriving the connection between the Koopman evolution operator, the Perron–Frobenius evolution operator, and the Koopman–von Neumann evolution (KvN) operator. We also explicitly derive the connection between the Koopman and Carleman approaches to embedding. Extension of the KvN framework to the complex-analytic setting relevant to Carleman embedding, and the proof that different choices of complex analytic reproducing kernel Hilbert spaces depend on the choice of Hilbert space metric are covered in the appendixes. Finally, we conclude with a review of recent quantum hardware implementations of algorithms on present-day quantum hardware platforms that may one day be accelerated through Hamiltonian simulation. We discuss the simulation of toy models of wave–particle interactions through the simulation of quantum maps and of wave–wave interactions important in nonlinear plasma dynamics.
Quantum phase estimation provides a path to quantum computation of solutions to Hermitian eigenvalue problems , such as those occurring in quantum chemistry. It is natural to ask whether the same technique can be applied to generalized eigenvalue problems , which arise in many areas of science and engineering. We answer this question affirmatively. A restricted class of generalized eigenvalue problems could be solved as efficiently as standard eigenvalue problems. A paradigmatic example is provided by Sturm-Liouville problems. Another example comes from linear ideal magnetohydrodynamics, where phase estimation could be used to determine the stability of magnetically confined plasmas in fusion reactors.
As a milestone for general-purpose computing machines, we demonstrate that quantum processors can be programed to efficiently simulate dynamics that are not native to the hardware. Moreover, on noisy devices without error correction, we show that simulation results are significantly improved when the quantum program is compiled using modular gates instead of a restricted set of standard gates. We demonstrate the general methodology by solving a cubic interaction problem, which appears in nonlinear optics, gauge theories, as well as plasma and fluid dynamics. To encode the non-native Hamiltonian evolution, we decompose the Hilbert space into a direct sum of invariant subspaces in which the nonlinear problem is mapped to a finite-dimensional Hamiltonian simulation problem. In a three-states example, the resultant unitary evolution is realized by a product of approximately 20 standard gates, using which approximately ten simulation steps can be carried out on state-of-the-art quantum hardware before results are corrupted by decoherence. In comparison, the simulation depth is improved by more than an order of magnitude when the unitary evolution is realized as a single cubic gate, which is compiled directly using optimal control. Alternatively, parametric gates may also be compiled by interpolating control pulses. Modular gates thus obtained provide high-fidelity building blocks for quantum Hamiltonian simulations.
A modeling study is reported using new 2D data from DIII-D tokamak divertor plasmas and improved 2D transport model that includes large cross-field drifts for the numerically difficult low anomalous transport regime associated with the H-mode. The data set, which spans a range of plasma densities for both forward and reverse toroidal magnetic field (Bt ), is provided by divertor Thomson scattering (DTS). Measurements utilizing X-point sweeping give corresponding 2D profiles of electron temperature (Te ) and density (ne ) across both divertor legs for individual discharges. The simulations focus on the open magnetic field-line regions, though they also include a small region of closed field lines. The calculations show the same features of in/out divertor plasma asymmetries as measured in the experiment, with the normal Bt direction (ion ∇. B drift toward the X-point) having higher ne and lower Te in the inner divertor leg than outer. Corresponding emission data for total radiated power shows a strong inner-divertor/outer-divertor asymmetry that is reproduced by the simulations. These 2D UEDGE transport simulations are enabled for steep-gradient H-mode conditions by newly implemented algorithms to control isolated grid-scale irregularities.Peer reviewe