SearcharxivSearch

arXiv subjects

Ilon Joseph

Publications and source records attributed to Ilon Joseph.

At least 19 recordsLinked to original sources

Globalizing the Carleman linear embedding method for nonlinear dynamics

The Carleman embedding method is a widely used technique for linearizing a system of nonlinear differential equations, but fails to converge in regions where there are multiple fixed points. We propose and test three different versions of a global piecewise Carleman embedding technique, based on partitioning space into multiple regions where the center and size of the embedding region are chosen to control convergence. The first method switches between local linearization regions of fixed size once the trajectory reaches the boundary of the current linearization chart. During the transition, the embedding is reconstructed within the newly created chart, centered at the transition point. The second method also adapts the chart size dynamically, enhancing accuracy in regions where multiple fixed points are located. The third method partitions the state space using a static grid with precomputed linearization charts of fixed size, making it more suitable for applications that require high speed. All techniques are numerically tested on multiple integrable and chaotic nonlinear dynamical systems demonstrating their applicability for problems that are completely intractable for the standard Carleman embedding method. Simulations of chaotic dynamical systems such as various types of strange attractors demonstrate the power of the adaptive methods, if a sufficiently low tolerance is imposed. Still, the non-adaptive version of the method, with fixed centers and sizes of the linearization charts, can be faster in simulating dynamical systems while providing similar accuracy and may be more appropriate as the basis of algorithms for future quantum computers.

quant-ph

Simulating plasma wave propagation on a superconducting quantum chip

Quantum computers may one day enable the efficient simulation of strongly coupled plasmas that lie beyond the reach of classical computation in regimes where quantum effects are important and the scale separation is large. In this article, we take a first step toward efficient simulation of quantum plasmas by demonstrating linear plasma wave propagation on a superconducting quantum chip. Using high-fidelity and highly expressive device-native gates, combined with an error-mitigation technique, we simulate the scattering of laser pulses from inhomogeneous plasmas. Our approach is made feasible by the identification of a suitable local spin model whose excitations mimic plasma waves, and whose circuit implementation requires a lower gate count than other proposed approaches that would require a future fault-tolerant quantum computer. This work opens avenues to study more complicated phenomena that cannot be simulated efficiently on classical computers, such as nonlinear quantum dynamics when strongly coupled plasmas are driven out of equilibrium.

quant-ph

A Tale of Two Polarization Paradoxes I: the Diamagnetic Polarization Paradox

An accurate calculation of the total polarization charge density in a plasma is essential for a self-consistent determination of the electric field. Yet, for a magnetized plasma, there are two different polarization paradoxes that are finally resolved in this work. The "diamagnetic polarization paradox'' refers to the fact that there is a paradoxical factor of 1/2 difference between the pressure-driven "diamagnetic polarization'' density calculated using the real space drift theory versus the action-angle space guiding center and gyrokinetic theory that has not been explained before. In this work, it is shown that the results of both approaches can be made consistent with one another. Half of the diamagnetic polarization is due to the transformation from the guiding center density to the real space density. The other half is due to the fact that, within the drift kinetic ordering assumptions, the guiding center density should be expressed as the gyroaverage of the density in the limit of vanishing Larmor radius. Expressions for the diamagnetic polarization density are given that are accurate to first order in amplitude and all orders in gyroradius within gyrokinetic theory for a constant magnetic field. Applications to anisotropic Maxwell-Boltzmann particle distribution functions are presented. Because the total energy and toroidal momentum are local invariants, they do not generate net polarization effects: the electric and thermodynamic polarizations must precisely cancel. In contrast, anisotropic dependance on the magnetic moment generates a net polarization proportional to the temperature anisotropy.

physics.plasm-ph

Exploring exponential time integration for strongly magnetized charged particle motion

A fundamental task in particle-in-cell (PIC) simulations of plasma physics is solving for charged particle motion in electromagnetic fields. This problem is especially challenging when the plasma is strongly magnetized due to numerical stiffness arising from the wide separation in time scales between highly oscillatory gyromotion and overall macroscopic behavior of the system. In contrast to conventional finite difference schemes, we investigated exponential integration techniques to numerically simulate strongly magnetized charged particle motion. Numerical experiments with a uniform magnetic field show that exponential integrators yield superior performance for linear problems (i.e. configurations with an electric field given by a quadratic electric scalar potential) and are competitive with conventional methods for nonlinear problems with cubic and quartic electric scalar potentials.

physics.comp-ph

Nystr\"om Type Exponential Integrators for Strongly Magnetized Charged Particle Dynamics

Solving for charged particle motion in electromagnetic fields (i.e. the particle pushing problem) is a computationally intensive component of particle-in-cell (PIC) methods for plasma physics simulations. This task is especially challenging when the plasma is strongly magnetized due numerical stiffness arising from the wide range of time scales between highly oscillatory gyromotion and long term macroscopic behavior. A promising approach to solve these problems is by a class of methods known as exponential integrators that can solve linear problems exactly and are A-stable. This work extends the standard exponential integration framework to derive Nystr\"om-type exponential integrators that integrates the Newtonian equations of motion as a second-order differential equation directly. In particular, we derive second-order and third-order Nystr\"om-type exponential integrators for strongly magnetized particle pushing problems. Numerical experiments show that the Nystr\"om-type exponential integators exhibit significant improvement in computation speed over the standard exponential integrators.

physics.comp-ph

An efficient explicit implementation of a near-optimal quantum algorithm for simulating linear dissipative differential equations

We propose an efficient block-encoding technique for the implementation of the Linear Combination of Hamiltonian Simulations (LCHS) for simulating dissipative initial-value problems. This algorithm approximates a target nonunitary operator as a weighted sum of Hamiltonian evolutions, thereby emulating a dissipative problem by mixing various time scales. We introduce an efficient encoding of the LCHS into a quantum circuit based on a simple coordinate transformation that turns the dependence on the summation index into a trigonometric function. Classically, this method is equivalent to the use of a highly accurate Fej\'er-Clenshaw-Curtis quadrature formula. Quantumly, this significantly simplifies block-encoding of a dissipative problem and allows one to perform an exponential number of Hamiltonian simulations by a single Quantum Signal Processing (QSP) circuit. The resulting LCHS circuit has high success probability and the selector scales logarithmically with the number of terms in the LCHS sum and linearly with time. Careful analysis of error convergence proves that this method is more efficient than other LCHS circuits that have recently appeared in the literature. We verify the quantum circuit and its scaling by simulating it on a digital emulator of fault-tolerant quantum computers and, as a test problem, solve the advection-diffusion equation. The proposed algorithm can be used for modeling a wide class of nonunitary initial-value problems including the Liouville equation with added dissipation and linear embeddings of nonlinear systems, such as the Koopman-von Neumann and Carleman embeddings.

quant-ph

Quantum algorithm for the advection-diffusion equation and the Koopman-von Neumann approach to nonlinear dynamical systems

We propose an explicit algorithm based on the Linear Combination of Hamiltonian Simulations technique to simulate both the advection-diffusion equation and a nonunitary discretized version of the Koopman-von Neumann formulation of nonlinear dynamics. By including dissipation into the model, through an upwind discretization of the advection operator, we avoid spurious parasitic oscillations which usually accompany standard finite difference discretizations of the advection equation. In contrast to prior works on quantum simulation of nonlinear problems, we explain in detail how different components of the algorithm can be implemented by using the Quantum Signal Processing (QSP) and Quantum Singular Value Transformation (QSVT) methods. In addition, we discuss the general method for implementing the block-encoding (BE) required for QSP and QSVT circuits and provide explicit implementations of the BE oracles tailored to our specific test cases. We simulate the resulting circuit on a digital emulator of quantum fault-tolerant computers and investigate its complexity and success probability. The proposed algorithm is universal and can be used for modeling a broad class of linear and nonlinear differential equations including the KvN and Carleman embeddings of nonlinear systems, the semiclassical Koopman-van Hove (KvH) equation, as well as the advection and Liouville equations.

physics.comp-ph

Simulating nonlinear optical processes on a superconducting quantum device

Simulating plasma physics on quantum computers is difficult because most problems of interest are nonlinear, but quantum computers are not naturally suitable for nonlinear operations. In weakly nonlinear regimes, plasma problems can be modeled as wave-wave interactions. In this paper, we develop a quantization approach to convert nonlinear wave-wave interaction problems to Hamiltonian simulation problems. We demonstrate our approach using two qubits on a superconducting device. Unlike a photonic device, a superconducting device does not naturally have the desired interactions in its native Hamiltonian. Nevertheless, Hamiltonian simulations can still be performed by decomposing required unitary operations into native gates. To improve experimental results, we employ a range of error mitigation techniques. Apart from readout error mitigation, we use randomized compilation to transform undiagnosed coherent errors into well-behaved stochastic Pauli channels. Moreover, to compensate for stochastic noise, we rescale exponentially decaying probability amplitudes using rates measured from cycle benchmarking. We carefully consider how different choices of product-formula algorithms affect the overall error and show how a trade-off can be made to best utilize limited quantum resources. This study provides an example of how plasma problems may be solved on near-term quantum computing platforms.

physics.plasm-ph

Mesh Refinement for Anisotropic Diffusion in Magnetized Plasmas

Highly accurate simulation of plasma transport is needed for the successful design and operation of magnetically confined fusion reactors. Unfortunately, the extreme anisotropy present in magnetized plasmas results in thin boundary layers that are expensive to resolve. This work investigates how mesh refinement strategies might reduce that expense to allow for more efficient simulation. It is first verified that higher order discretization only realizes the proper rate of convergence once the mesh resolves the thin boundary layer, motivating the focusing of refinement on the boundary layer. Three mesh refinement strategies are investigated: one that focuses the refinement across the layer by using rectangular elements with a ratio equal to the boundary layer width, one that allows for exponential growth in mesh spacing away from the layer, and one adaptive strategy utilizing the established Zienkiewicz and Zhu error estimator. Across 4 two-dimensional test cases with high anisotropy, the adaptive mesh refinement strategy consistently achieves the same accuracy as uniform refinement using orders of magnitude less degrees of freedom. In the test case where the magnetic field is aligned with the mesh, the other refinement strategies also show substantial improvement in efficiency. This work also includes a discussion generalizing the results to larger magnetic anisotropy ratios and to three-dimensional problems. It is shown that isotropic mesh refinement requires degrees of freedom on the order of either the layer width (2D) or the square of the layer width (3D), whereas anisotropic refinement requires a number on the order of the log of layer width for all dimensions. It is also shown that the number of conjugate gradient iterations scales as a power of layer width when preconditioned with algebraic multigrid, whereas the number is independent of layer width when preconditioned with ILU.

math.NA

Semiclassical Theory and the Koopman-van Hove Equation

The phase space Koopman-van Hove (KvH) equation can be derived from the asymptotic semiclassical analysis of partial differential equations. Semiclassical theory yields the Hamilton-Jacobi equation for the complex phase factor and the transport equation for the amplitude. These two equations can be combined to form a nonlinear semiclassical version of the KvH equation in configuration space. There is a natural injection of configuration space solutions into phase space and a natural projection of phase space solutions onto configuration space. Hence, every solution of the configuration space KvH equation satisfies both the semiclassical phase space KvH equation and the Hamilton-Jacobi constraint. For configuration space solutions, this constraint resolves the paradox that there are two different conserved densities in phase space. For integrable systems, the KvH spectrum is the Cartesian product of a classical and a semiclassical spectrum. If the classical spectrum is eliminated, then, with the correct choice of Jeffreys-Wentzel-Kramers-Brillouin (JWKB) matching conditions, the semiclassical spectrum satisfies the Einstein-Brillouin-Keller quantization conditions which include the correction due to the Maslov index. However, semiclassical analysis uses different choices for boundary conditions, continuity requirements, and the domain of definition. For example, use of the complex JWKB method allows for the treatment of tunneling through the complexification of phase space. Finally, although KvH wavefunctions include the possibility of interference effects, interference is not observable when all observables are approximated as local operators on phase space. Observing interference effects requires consideration of nonlocal operations, e.g. through higher orders in the asymptotic theory.

quant-ph

Observability of fidelity decay at the Lyapunov rate in few-qubit quantum simulations

In certain regimes, the fidelity of quantum states will decay at a rate set by the classical Lyapunov exponent. This serves both as one of the most important examples of the quantum-classical correspondence principle and as an accurate test for the presence of chaos. While detecting this phenomenon is one of the first useful calculations that noisy quantum computers without error correction can perform [G. Benenti et al., Phys. Rev. E 65, 066205 (2001)], a thorough study of the quantum sawtooth map reveals that observing the Lyapunov regime is just beyond the reach of present-day devices. We prove that there are three bounds on the ability of any device to observe the Lyapunov regime and give the first quantitatively accurate description of these bounds: (1) the Fermi golden rule decay rate must be larger than the Lyapunov rate, (2) the quantum dynamics must be diffusive rather than localized, and (3) the initial decay rate must be slow enough for Lyapunov decay to be observable. This last bound, which has not been recognized previously, places a limit on the maximum amount of noise that can be tolerated. The theory implies that an absolute minimum of 6 qubits is required. Recent experiments on IBM-Q and IonQ imply that some combination of a noise reduction by up to 100$\times$ per gate and large increases in connectivity and gate parallelization are also necessary. Finally, scaling arguments are given that quantify the ability of future devices to observe the Lyapunov regime based on trade-offs between hardware architecture and performance.

quant-ph

Exponential integrators for non-linear diffusion

The goal of this project is to compare the performance of exponential time integrators with traditional methods such as diagonally implicit Runge-Kutta methods in the context of solving the system of reduced magnetohydrodynamics (RMHD). In this report, we present initial results of a proof of concept study that shows that exponential integrators can be an efficient alternative to traditional integration schemes.

math.NA

Impact of dynamics, entanglement, and Markovian noise on the fidelity of few-qubit digital quantum simulation

Quantum algorithms have been proposed to accelerate the simulation of the chaotic dynamical systems that are ubiquitous in the physics of plasmas. Quantum computers without error correction might even use noise to their advantage to calculate the Lyapunov exponent by measuring the Loschmidt echo fidelity decay rate. For the first time, digital Hamiltonian simulations of the quantum sawtooth map, performed on the {IBM-Q} quantum hardware platform, show that the fidelity decay rate of a digital quantum simulation increases during the transition from dynamical localization to chaotic diffusion in the map. The observed error per \code{CNOT} gate increases by $1.5\times$ as the dynamics varies from localized to diffusive, while only changing the phases of virtual \code{RZ} gates and keeping the over-all gate count constant. A gate-based Lindblad noise model that captures the effective change in relaxation and dephasing errors during gate operation qualitatively explains the effect of dynamics on fidelity as being due to the localization and entanglement of the states created. Specifically, highly delocalized states that are entangled with random phases show an increased sensitivity to dephasing and, on average, a similar sensitivity to relaxation as localized states. In contrast, delocalized unentangled states show an increased sensitivity to dephasing but a lower sensitivity to relaxation. This gate-based Lindblad model is shown to be a useful benchmarking tool by estimating the effective Lindblad coherence times during \code{CNOT} gates and finding a consistent $2\text{--}3\times$ shorter $T_2$ time than reported for idle qubits. Thus, the interplay of the dynamics of a simulation with the noise processes that are active can strongly influence the overall fidelity decay rate.

quant-ph

Arbitrary Order Energy and Enstrophy Conserving Finite Element Methods for 2D Incompressible Fluid Dynamics and Drift-Reduced Magnetohydrodynamics

Maintaining conservation laws in the fully discrete setting is critical for accurate long-time behavior of numerical simulations and requires accounting for discrete conservation properties in both space and time. This paper derives arbitrary order finite element exterior calculus spatial discretizations for the two-dimensional (2D) Navier-Stokes and drift-reduced magnetohydrodynamic equations that conserve both energy and enstrophy to machine precision when coupled with generally symplectic time-integration methods. Both continuous and discontinuous-Galerkin (DG) weak formulations can ensure conservation, but only generally symplectic time integration methods, such as the implicit midpoint method, permit exact conservation in time. Moreover, the symplectic implicit midpoint method yields an order of magnitude speedup over explicit schemes. The methods are implemented using the MFEM library and the solutions are verified for an extensive suite of 2D neutral fluid turbulence test problems. Numerical solutions are verified via comparison to a semi-analytic linear eigensolver as well as to the finite difference Global Drift Ballooning (GDB) code. However, it is found that turbulent simulations that conserve both energy and enstrophy tend to have too much power at high wavenumber and that this part of the spectrum should be controlled by reintroducing artificial dissipation. The DG formulation allows upwinding of the advection operator which dissipates enstrophy while still maintaining conservation of energy. Coupling upwinded DG with implicit symplectic integration appears to offer the best compromise of allowing mid-range wavenumbers to reach the appropriate amplitude while still controlling the high-wavenumber part of the spectrum.

physics.flu-dyn

Koopman wavefunctions and Clebsch variables in Vlasov-Maxwell kinetic theory

Motivated by recent discussions on the possible role of quantum computation in plasma simulations, here we present different approaches to Koopman's Hilbert-space formulation of classical mechanics in the context of Vlasov-Maxwell kinetic theory. The celebrated Koopman-von Neumann construction is provided with two different Hamiltonian structures: one is canonical and recovers the usual Clebsch representation of the Vlasov density, the other is noncanonical and appears to overcome certain issues emerging in the canonical formalism. Furthermore, the canonical structure is restored for a variant of the Koopman-von Neumann construction that carries a different phase dynamics. Going back to van Hove's prequantum theory, the corresponding Koopman-van Hove equation provides an alternative Clebsch representation which is then coupled to the electromagnetic fields. Finally, the role of gauge transformations in the new context is discussed in detail.

physics.plasm-ph

A mass, momentum, and energy conservative dynamical low-rank scheme for the Vlasov equation

The primary challenge in solving kinetic equations, such as the Vlasov equation, is the high-dimensional phase space. In this context, dynamical low-rank approximations have emerged as a promising way to reduce the high computational cost imposed by such problems. However, a major disadvantage of this approach is that the physical structure of the underlying problem is not preserved. In this paper, we propose a dynamical low-rank algorithm that conserves mass, momentum, and energy as well as the corresponding continuity equations. We also show how this approach can be combined with a conservative time and space discretization.

math.NA

Guiding Center and Gyrokinetic Theory for Large Electric Field Gradients and Strong Shear Flows

The guiding center and gyrokinetic theory of magnetized particle motion is extended to the regime of large electric field gradients perpendicular to the magnetic field. A gradient in the electric field directly modifies the oscillation frequency and causes the Larmor orbits to deform from circular to elliptical trajectories. In order to retain a good adiabatic invariant, there can only be strong dependence on a single coordinate at lowest order, so that resonances do not generate chaotic motion that destroys the invariant. When the gradient across magnetic flux surfaces is dominant, the guiding center drift velocity becomes anisotropic in response to external forces and additional curvature drifts must be included. The electric polarization density remains gyrotropic, but both the polarization and magnetization are modified by the change in gyrofrequency. The theory can be applied to shear flows that are even stronger than those observed in the edge transport barrier of a high-performance tokamak (H-mode) pedestal, even if the toroidal field is as small as or even smaller than the poloidal field. Yet, the theory retains a mathematical form that is similar to the standard case and can readily be implemented within existing simulation tools.

physics.plasm-ph

Simulating nonnative cubic interactions on noisy quantum machines

As a milestone for general-purpose computing machines, we demonstrate that quantum processors can be programmed 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 nonnative 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 ~20 standard gates, using which ~10 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.

quant-ph