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:2608.23127

Efficient Quantum Simulation of Linearized Vlasov--Poisson Dynamics Using Trotter and THRIFT Hamiltonian Simulation Methods

Kartick Paul, Rahul V, S. Aravinda, Reetesh K. Gangwar

quant-phphysics.comp-phphysics.plasm-phSubmitted Aug 24, 2026• Announced Aug 25, 2026• 1 citation• Revised Oct 9, 2026 (v2)
v1 · Aug 24, 2026v2 · Oct 9, 2026
arXivHTMLPDF

Abstract

The Vlasov--Poisson system provides the fundamental kinetic description of plasma and plays a central role in understanding collective phenomena such as Landau damping and wave--particle interactions. Efficient numerical simulation of these dynamics remains challenging because of the high dimensionality of phase space. In this work, we studied magnetized and non-magnetized plasma using a quantum simulation framework for the linearized Vlasov-Poisson equation by reformulating the discretized system as a Hermitian Hamiltonian suitable for gate-based quantum computation. The time evolution is implemented using first, second and fourth-order Trotter--Suzuki product formulas and the recently proposed Time-Resolved Interaction Framework (THRIFT). The performance of the different simulation methods is systematically evaluated through electric field evolution, state fidelity, convergence behavior, energy conservation, entanglement entropy and quantum resource requirements, including circuit depth and two-qubit gate complexity, for both magnetized and non-magnetized plasma models. To further reduce finite time step errors without increasing circuit depth, Richardson extrapolation is incorporated as a error-mitigation technique. The results provide a comprehensive comparison of Trotter and THRIFT approaches and establish practical guidelines for accurate and resource-efficient quantum simulation of plasma dynamics on gate-based quantum computers.

Comments
18 pages,11 figures

Related papers

Trotter-based quantum algorithm for solving transport equations with exponentially fewer time-steps

Julien Zylberman, Thibault Fredon, Nuno Loureiro +1 more

Abstract The extent to which quantum computers can simulate physical phenomena and solve the partial differential equations (PDEs) that govern them remains a central open question. In this work, one of the most fundamental PDEs is addressed: the multidimensional transport equation with space- and time-dependent coefficients. We present a quantum numerical scheme based on three steps: quantum state preparation, evolution, and measurement of relevant observables. The evolution step combines a high-order centered finite difference with a time-splitting scheme based on product formula approximations, also known as Trotterization. We introduce a novel vector-norm analysis and prove that the number of time-steps can be reduced by a factor exponential in the number of qubits, compared with previously established operator-norm analysis. This new scaling significantly reduces the projected computational resources, independently of the circuit implementation of the trotterized evolution operator. We also present efficient quantum circuits based on (sparse) Walsh approximations along with numerical simulations that confirm the predicted vector-norm scaling. We report results on real quantum hardware for the one-dimensional convection equation, and solve a non-linear ordinary differential equation via its associated Liouville equation, a particular case of transport equations. This work provides a practical framework for efficiently simulating transport phenomena on quantum computers, with potential applications in plasma physics, molecular gas dynamics and non-linear dynamical systems, including chaotic systems.

arXiv:2508.15691•Quantum Science and Technology•Feb 20, 2026•3 citations

Quantum-inspired method for solving the Vlasov-Poisson equations

Erika Ye, Nuno Loureiro

Kinetic simulations of collisionless (or weakly collisional) plasmas using the Vlasov equation are often infeasible due to high-resolution requirements and the exponential scaling of computational cost with respect to dimension. Recently, it has been proposed that matrix product state (MPS) methods, a quantum-inspired but classical algorithm, can be used to solve partial differential equations with exponential speed-up, provided that the solution can be compressed and efficiently represented as a MPS within some tolerable error threshold. In this work, we explore the practicality of MPS methods for solving the Vlasov-Poisson equations for systems with one coordinate in space and one coordinate in velocity, and find that important features of linear and nonlinear dynamics, such as damping or growth rates and saturation amplitudes, can be captured while compressing the solution significantly. Furthermore, by comparing the performance of different mappings of the distribution functions onto the MPS, we develop an intuition of the MPS representation and its behavior in the context of solving the Vlasov-Poisson equations, which will be useful for extending these methods to higher-dimensional problems.

arXiv:2205.11990•Physical review. E•Sep 29, 2022•46 citations

Second quantization of the nonlinear Vlasov–Poisson system for quantum computation

Michael Q. May, Hong Qin

Abstract Current quantum algorithms for plasma physics require linearized systems, and quantum algorithms for nonlinear systems are highly system-specific. Second quantization, which is system-agnostic, has the exceptional capacity to render many systems suitable for quantum computation, i.e. finite-dimensional, linear, and unitary. We show how the Fourier mode-truncated Schrödinger–Poisson representation of the Vlasov–Poisson system can be second quantized into a finite-dimensional Hamiltonian system. With three- and five-mode examples, the second quantized system is shown to reproduce corresponding nonlinear dynamics in the Schrödinger–Poisson system in the simulated time intervals. Parallel integration of wide distributions of initial conditions of the Vlasov–Poisson system has the potential to be efficiently computable using the proposed second quantized model on a quantum computer.

arXiv:2506.01895•Plasma Physics and Controlled Fusion•Oct 1, 2026•5 citations

Mitigating algorithmic errors in a Hamiltonian simulation

Suguru Endo, Qi Zhao, Ying Li +2 more

Quantum computers can efficiently simulate many-body systems. As a widely used Hamiltonian simulation tool, the Trotter-Suzuki scheme splits the evolution into the number of Trotter steps $N$ and approximates the evolution of each step by a product of exponentials of each individual term of the total Hamiltonian. The algorithmic error due to the approximation can be reduced by increasing $N$, which however requires a longer circuit and hence inevitably introduces more physical errors. In this work, we first study such a trade-off and numerically find the optimal number of Trotter steps ${N}_{\mathrm{opt}}$ given a physical error model in a near-term quantum hardware. Practically, physical errors can be suppressed using recently proposed error mitigation methods. We then extend physical error mitigation methods to suppress the algorithmic error in Hamiltonian simulation. By exploiting the simulation results with different numbers of Trotter steps $N\ensuremath{\le}{N}_{\mathrm{opt}}$, we can infer the exact simulation result within a higher accuracy and hence mitigate algorithmic errors. We numerically test our scheme with a five-qubit system and show significant improvements in the simulation accuracy by applying both physical and algorithmic error mitigations.

arXiv:1808.03623•Physical Review A•Jan 18, 2019•83 citations

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•77 citations

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•6 citations
The Vlasov--Poisson system provides the fundamental kinetic description of plasma and plays a central role in understanding collective phenomena such as Landau damping and wave--particle interactions. Efficient numerical simulation of these dynamics remains challenging because of the high dimensionality of phase space. In this work, we studied magnetized and non-magnetized plasma using a quantum simulation framework for the linearized Vlasov-Poisson equation by reformulating the discretized system as a Hermitian Hamiltonian suitable for gate-based quantum computation. The time evolution is implemented using first, second and fourth-order Trotter--Suzuki product formulas and the recently proposed Time-Resolved Interaction Framework (THRIFT). The performance of the different simulation methods is systematically evaluated through electric field evolution, state fidelity, convergence behavior, energy conservation, entanglement entropy and quantum resource requirements, including circuit depth and two-qubit gate complexity, for both magnetized and non-magnetized plasma models. To further reduce finite time step errors without increasing circuit depth, Richardson extrapolation is incorporated as a error-mitigation technique. The results provide a comprehensive comparison of Trotter and THRIFT approaches and establish practical guidelines for accurate and resource-efficient quantum simulation of plasma dynamics on gate-based quantum computers.
Abstract The extent to which quantum computers can simulate physical phenomena and solve the partial differential equations (PDEs) that govern them remains a central open question. In this work, one of the most fundamental PDEs is addressed: the multidimensional transport equation with space- and time-dependent coefficients. We present a quantum numerical scheme based on three steps: quantum state preparation, evolution, and measurement of relevant observables. The evolution step combines a high-order centered finite difference with a time-splitting scheme based on product formula approximations, also known as Trotterization. We introduce a novel vector-norm analysis and prove that the number of time-steps can be reduced by a factor exponential in the number of qubits, compared with previously established operator-norm analysis. This new scaling significantly reduces the projected computational resources, independently of the circuit implementation of the trotterized evolution operator. We also present efficient quantum circuits based on (sparse) Walsh approximations along with numerical simulations that confirm the predicted vector-norm scaling. We report results on real quantum hardware for the one-dimensional convection equation, and solve a non-linear ordinary differential equation via its associated Liouville equation, a particular case of transport equations. This work provides a practical framework for efficiently simulating transport phenomena on quantum computers, with potential applications in plasma physics, molecular gas dynamics and non-linear dynamical systems, including chaotic systems.
Kinetic simulations of collisionless (or weakly collisional) plasmas using the Vlasov equation are often infeasible due to high-resolution requirements and the exponential scaling of computational cost with respect to dimension. Recently, it has been proposed that matrix product state (MPS) methods, a quantum-inspired but classical algorithm, can be used to solve partial differential equations with exponential speed-up, provided that the solution can be compressed and efficiently represented as a MPS within some tolerable error threshold. In this work, we explore the practicality of MPS methods for solving the Vlasov-Poisson equations for systems with one coordinate in space and one coordinate in velocity, and find that important features of linear and nonlinear dynamics, such as damping or growth rates and saturation amplitudes, can be captured while compressing the solution significantly. Furthermore, by comparing the performance of different mappings of the distribution functions onto the MPS, we develop an intuition of the MPS representation and its behavior in the context of solving the Vlasov-Poisson equations, which will be useful for extending these methods to higher-dimensional problems.
Abstract Current quantum algorithms for plasma physics require linearized systems, and quantum algorithms for nonlinear systems are highly system-specific. Second quantization, which is system-agnostic, has the exceptional capacity to render many systems suitable for quantum computation, i.e. finite-dimensional, linear, and unitary. We show how the Fourier mode-truncated Schrödinger–Poisson representation of the Vlasov–Poisson system can be second quantized into a finite-dimensional Hamiltonian system. With three- and five-mode examples, the second quantized system is shown to reproduce corresponding nonlinear dynamics in the Schrödinger–Poisson system in the simulated time intervals. Parallel integration of wide distributions of initial conditions of the Vlasov–Poisson system has the potential to be efficiently computable using the proposed second quantized model on a quantum computer.
Quantum computers can efficiently simulate many-body systems. As a widely used Hamiltonian simulation tool, the Trotter-Suzuki scheme splits the evolution into the number of Trotter steps NNN and approximates the evolution of each step by a product of exponentials of each individual term of the total Hamiltonian. The algorithmic error due to the approximation can be reduced by increasing NNN, which however requires a longer circuit and hence inevitably introduces more physical errors. In this work, we first study such a trade-off and numerically find the optimal number of Trotter steps Nopt{N}_{\mathrm{opt}}Nopt​ given a physical error model in a near-term quantum hardware. Practically, physical errors can be suppressed using recently proposed error mitigation methods. We then extend physical error mitigation methods to suppress the algorithmic error in Hamiltonian simulation. By exploiting the simulation results with different numbers of Trotter steps $N\ensuremath{\le}{N}_{\mathrm{opt}}$, we can infer the exact simulation result within a higher accuracy and hence mitigate algorithmic errors. We numerically test our scheme with a five-qubit system and show significant improvements in the simulation accuracy by applying both physical and algorithmic error mitigations.
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–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.