Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2306.05967

Quantum Calculation of Classical Kinetic Equations: A Novel Approach for Numerical Analysis of 6D Boltzmann-Maxwell Equations in Collisionless Plasmas Using Quantum Computing

Hayato Higuchi, Juan W. Pedersen, Akimasa Yoshikawa

Published Jun 23, 2023• 1 citation
arXivHTMLPDF

Abstract

A novel quantum algorithm for solving the Boltzmann-Maxwell equations of the 6D collisionless plasma is proposed. The equation describes the kinetic behavior of plasma particles in electromagnetic fields and is known for the classical first-principles equations in various domains, from space to laboratory plasmas. We have constructed a quantum algorithm for a future fault-tolerant large-scale quantum computer to accelerate its costly computation. This algorithm consists mainly of two routines: the Boltzmann solver and the Maxwell solver. Quantum algorithms undertake these dual procedures, while classical algorithms facilitate their interplay. Each solver has a similar structure consisting of three steps: Encoding, Propagation, and Integration. We conducted a preliminary implementation of the quantum algorithm and performed a parallel validation against a comparable classical approach. IBM Qiskit was used to implement all quantum circuits.

DOI
10.22541/essoar.168748458.80915597/v1

Related papers

Quantum calculation for two-stream instability and advection test of Vlasov–Maxwell equations: numerical evaluation of Hamiltonian simulation

Hayato Higuchi, Juan W. Pedersen, Kiichiro Toyoizumi +3 more

The Vlasov–Maxwell equations provide kinetic simulations of collisionless plasmas, but numerically solving them on classical computers is often impractical. This is due to the computational resource constraints imposed by the time evolution in the six-dimensional phase space, which requires broad spatial and temporal scales. The novelty of this study is to implement a quantum–classical hybrid Vlasov–Maxwell solver and the rigorous numerical scheme evaluation by numerical simulations. Specifically, the Vlasov solver implements the Hamiltonian simulation based on quantum singular value transformation, coupled with a classical Maxwell solver. We perform numerical simulation of a one-dimensional advection test and a one-spatial-dimension, one-velocity-dimension two-stream instability test on the Qiskit-Aer-GPU quantum circuit emulator with an A100 GPU. The computational complexity of our quantum algorithm can potentially be reduced from the classical $\mathcal{O}(N^6T^2/\epsilon )$ to $\mathcal{O}\left (\text{poly}(\log {N})\left (NT+T\log \left (T/\epsilon \right )\right )\right )$ for the $N$ grid system, simulation time $T$ and error tolerance $\epsilon$ in the limit where the number of queries is large enough and the error is small enough. Furthermore, the numerical analysis reveals that our quantum algorithm is robust under larger time steps compared with classical algorithms with the constraint of Courant–Friedrichs–Lewy condition.

arXiv:2408.11550•Journal of Plasma Physics•Aug 1, 2025•2 citations

Quantum numerical computation of the classical kinetic equation by quantum computer: new method for the Boltzmann equation in 6D collisionless plasma

Higuchi Hayato, Juan W. Pedersen, Akimasa Yoshikawa

URSI General Assembly and Scientific Symposium•Jan 1, 2023•0 citations

Quantum computing perspective for electromagnetic wave propagation in cold magnetized plasmas

Efstratios Koukoutsis, Kyriakos Hizanidis, George Vahala +3 more

Electromagnetic waves are an inherent part of all plasmas—laboratory fusion plasmas or astrophysical plasmas. The conventional methods for studying properties of electromagnetic waves rely on discretization of Maxwell equations suitable for implementing on classical, present day, computers. The traditional methodology is not efficient for quantum computing implementation—a future computational source offering a tantalizing possibility of enormous speed up and a significant reduction in computational cost. This paper addresses two topics relevant to implementing Maxwell equations on a quantum computer. The first is on formulating a quantum Schrödinger representation of Maxwell equations for wave propagation in a cold, inhomogeneous, and magnetized plasma. This representation admits unitary, energy preserving, evolution and conveniently lends itself to appropriate discretization for a quantum computer. Riding on the coattails of these results, the second topic is on developing a sequence of unitary operators which form the basis for a qubit lattice algorithm (QLA). The QLA, suitable for quantum computers, can be implemented and tested on existing classical computers for accuracy as well as scaling of computational time with the number of available processors. In order to illustrate the QLA for Maxwell equations, results are presented from a time evolving, full wave simulation of propagation and scattering of an electromagnetic wave packet by non-dispersive dielectric medium localized in space.

arXiv:2309.12492•Physics of Plasmas•Dec 1, 2023•13 citations

Quantum algorithm for collisionless Boltzmann simulation of self-gravitating systems

Soichiro Yamazaki, Fumio Uchida, Kotaro Fujisawa +2 more

The collisionless Boltzmann equation (CBE) is a fundamental equation that governs the dynamics of a broad range of astrophysical systems from space plasma to star clusters and galaxies. It is computationally expensive to integrate the CBE directly in a multi-dimensional phase space, and thus the applications to realistic astrophysical problems have been limited so far. Recently, Todorova & Steijl (2020) proposed an efficient quantum algorithm to solve the CBE with significantly reduced computational complexity. We extend the algorithm to perform quantum simulations of self-gravitating systems, incorporating the method to calculate gravity with the major Fourier modes of the density distribution extracted from the solution-encoding quantum state. Our method improves the dependency of time and space complexities on N v , the number of grid points in each velocity coordinate, compared to the classical simulation methods. We then conduct some numerical demonstrations of our method. We first run a 1+1 dimensional test calculation of free streaming motion on 64 × 64 grids using 13 simulated qubits and validate our method. We then perform simulations of Jeans collapse, and compare the result with analytic and linear theory calculations. It will thus allow us to perform large-scale CBE simulations on future quantum computers. • We propose a quantum algorithm for solving Boltzmann equation. • Reservoir method is improved to be able to simulate variable force field systems. • Quantum Fourier transform and tomography enables efficient information extraction. • Test calculations assuming noiseless 13 qubits have been conducted.

arXiv:2303.16490•Computers & Fluids•Dec 19, 2024•1 citation

Quantum algorithm for the Vlasov equation

Alexander Engel, Graeme Smith, Scott Parker

The Vlasov-Maxwell system of equations, which describes classical plasma physics, is extremely challenging to solve, even by numerical simulation on powerful computers. By linearizing and assuming a Maxwellian background distribution function, we convert the Vlasov-Maxwell system into a Hamiltonian simulation problem. Then for the limiting case of electrostatic Landau damping, we design and verify a quantum algorithm, appropriate for a future error-corrected universal quantum computer. While the classical simulation has costs that scale as $O({N}_{v}t)$ for a velocity grid with ${N}_{v}$ grid points and simulation time $t$, our quantum algorithm scales as $O[\text{polylog}({N}_{v})t/\ensuremath{\delta}]$ where $\ensuremath{\delta}$ is the measurement error, and weaker scalings have been dropped. Extensions, including electromagnetics and higher dimensions, are discussed. A quantum computer could efficiently handle a high-resolution, six-dimensional phase-space grid, but the $1/\ensuremath{\delta}$ cost factor to extract an accurate result remains a difficulty. This paper provides insight into the possibility of someday achieving efficient plasma simulation on a quantum computer.

arXiv:1907.09418•Physical Review A•Dec 11, 2019•66 citations

Quantum algorithm for the linear Vlasov equation with collisions

Abtin Ameri, Erika Ye, Paola Cappellaro +2 more

The Vlasov equation is a nonlinear partial differential equation that provides a first-principles description of the dynamics of plasmas. Its linear limit is routinely used in plasma physics to investigate plasma oscillations and stability. In this paper, we present a quantum algorithm that simulates the linearized Vlasov equation with and without collisions, in the one-dimensional electrostatic limit. Rather than solving this equation in its native spatial and velocity phase space, we adopt an efficient representation in the dual space yielded by a Fourier-Hermite expansion. For a given simulation time, the Fourier-Hermite representation is exponentially more compact, thus yielding a classical algorithm that can match the performance of a previously proposed quantum algorithm for this problem. This representation results in a system of linear ordinary differential equations (ODEs) which can be solved with well-developed quantum algorithms: a Hamiltonian simulation in the collisionless case, and quantum ODE solvers in the collisional case. In particular, we demonstrate that a quadratic speedup in system size is attainable.

arXiv:2303.03450•Physical Review A•Jun 12, 2023•11 citations
A novel quantum algorithm for solving the Boltzmann-Maxwell equations of the 6D collisionless plasma is proposed. The equation describes the kinetic behavior of plasma particles in electromagnetic fields and is known for the classical first-principles equations in various domains, from space to laboratory plasmas. We have constructed a quantum algorithm for a future fault-tolerant large-scale quantum computer to accelerate its costly computation. This algorithm consists mainly of two routines: the Boltzmann solver and the Maxwell solver. Quantum algorithms undertake these dual procedures, while classical algorithms facilitate their interplay. Each solver has a similar structure consisting of three steps: Encoding, Propagation, and Integration. We conducted a preliminary implementation of the quantum algorithm and performed a parallel validation against a comparable classical approach. IBM Qiskit was used to implement all quantum circuits.
The Vlasov–Maxwell equations provide kinetic simulations of collisionless plasmas, but numerically solving them on classical computers is often impractical. This is due to the computational resource constraints imposed by the time evolution in the six-dimensional phase space, which requires broad spatial and temporal scales. The novelty of this study is to implement a quantum–classical hybrid Vlasov–Maxwell solver and the rigorous numerical scheme evaluation by numerical simulations. Specifically, the Vlasov solver implements the Hamiltonian simulation based on quantum singular value transformation, coupled with a classical Maxwell solver. We perform numerical simulation of a one-dimensional advection test and a one-spatial-dimension, one-velocity-dimension two-stream instability test on the Qiskit-Aer-GPU quantum circuit emulator with an A100 GPU. The computational complexity of our quantum algorithm can potentially be reduced from the classical O(N6T2/ϵ)\mathcal{O}(N^6T^2/\epsilon )O(N6T2/ϵ) to O(poly(log⁡N)(NT+Tlog⁡(T/ϵ)))\mathcal{O}\left (\text{poly}(\log {N})\left (NT+T\log \left (T/\epsilon \right )\right )\right )O(poly(logN)(NT+Tlog(T/ϵ))) for the NNN grid system, simulation time TTT and error tolerance ϵ\epsilonϵ in the limit where the number of queries is large enough and the error is small enough. Furthermore, the numerical analysis reveals that our quantum algorithm is robust under larger time steps compared with classical algorithms with the constraint of Courant–Friedrichs–Lewy condition.
Electromagnetic waves are an inherent part of all plasmas—laboratory fusion plasmas or astrophysical plasmas. The conventional methods for studying properties of electromagnetic waves rely on discretization of Maxwell equations suitable for implementing on classical, present day, computers. The traditional methodology is not efficient for quantum computing implementation—a future computational source offering a tantalizing possibility of enormous speed up and a significant reduction in computational cost. This paper addresses two topics relevant to implementing Maxwell equations on a quantum computer. The first is on formulating a quantum Schrödinger representation of Maxwell equations for wave propagation in a cold, inhomogeneous, and magnetized plasma. This representation admits unitary, energy preserving, evolution and conveniently lends itself to appropriate discretization for a quantum computer. Riding on the coattails of these results, the second topic is on developing a sequence of unitary operators which form the basis for a qubit lattice algorithm (QLA). The QLA, suitable for quantum computers, can be implemented and tested on existing classical computers for accuracy as well as scaling of computational time with the number of available processors. In order to illustrate the QLA for Maxwell equations, results are presented from a time evolving, full wave simulation of propagation and scattering of an electromagnetic wave packet by non-dispersive dielectric medium localized in space.
The collisionless Boltzmann equation (CBE) is a fundamental equation that governs the dynamics of a broad range of astrophysical systems from space plasma to star clusters and galaxies. It is computationally expensive to integrate the CBE directly in a multi-dimensional phase space, and thus the applications to realistic astrophysical problems have been limited so far. Recently, Todorova & Steijl (2020) proposed an efficient quantum algorithm to solve the CBE with significantly reduced computational complexity. We extend the algorithm to perform quantum simulations of self-gravitating systems, incorporating the method to calculate gravity with the major Fourier modes of the density distribution extracted from the solution-encoding quantum state. Our method improves the dependency of time and space complexities on N v , the number of grid points in each velocity coordinate, compared to the classical simulation methods. We then conduct some numerical demonstrations of our method. We first run a 1+1 dimensional test calculation of free streaming motion on 64 × 64 grids using 13 simulated qubits and validate our method. We then perform simulations of Jeans collapse, and compare the result with analytic and linear theory calculations. It will thus allow us to perform large-scale CBE simulations on future quantum computers. • We propose a quantum algorithm for solving Boltzmann equation. • Reservoir method is improved to be able to simulate variable force field systems. • Quantum Fourier transform and tomography enables efficient information extraction. • Test calculations assuming noiseless 13 qubits have been conducted.
The Vlasov-Maxwell system of equations, which describes classical plasma physics, is extremely challenging to solve, even by numerical simulation on powerful computers. By linearizing and assuming a Maxwellian background distribution function, we convert the Vlasov-Maxwell system into a Hamiltonian simulation problem. Then for the limiting case of electrostatic Landau damping, we design and verify a quantum algorithm, appropriate for a future error-corrected universal quantum computer. While the classical simulation has costs that scale as O(Nvt)O({N}_{v}t)O(Nv​t) for a velocity grid with Nv{N}_{v}Nv​ grid points and simulation time ttt, our quantum algorithm scales as $O[\text{polylog}({N}_{v})t/\ensuremath{\delta}]$ where $\ensuremath{\delta}$ is the measurement error, and weaker scalings have been dropped. Extensions, including electromagnetics and higher dimensions, are discussed. A quantum computer could efficiently handle a high-resolution, six-dimensional phase-space grid, but the $1/\ensuremath{\delta}$ cost factor to extract an accurate result remains a difficulty. This paper provides insight into the possibility of someday achieving efficient plasma simulation on a quantum computer.
The Vlasov equation is a nonlinear partial differential equation that provides a first-principles description of the dynamics of plasmas. Its linear limit is routinely used in plasma physics to investigate plasma oscillations and stability. In this paper, we present a quantum algorithm that simulates the linearized Vlasov equation with and without collisions, in the one-dimensional electrostatic limit. Rather than solving this equation in its native spatial and velocity phase space, we adopt an efficient representation in the dual space yielded by a Fourier-Hermite expansion. For a given simulation time, the Fourier-Hermite representation is exponentially more compact, thus yielding a classical algorithm that can match the performance of a previously proposed quantum algorithm for this problem. This representation results in a system of linear ordinary differential equations (ODEs) which can be solved with well-developed quantum algorithms: a Hamiltonian simulation in the collisionless case, and quantum ODE solvers in the collisional case. In particular, we demonstrate that a quadratic speedup in system size is attainable.