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

Quantum approaches for particle-in-cell codes

Ryan J. J. Connor, Andrew J. Daley, Callum W. Duncan, Preetma Soin

physics.plasm-phquant-phSubmitted Oct 2, 2026• Announced Oct 5, 2026• 0 citations
arXivHTMLPDF

Abstract

Solving the high-dimensional, nonlinear partial differential equations that govern the rich physics of plasmas remains a major computational challenge. In fluid dynamics, quantum-inspired methods based on tensor-network techniques have recently emerged as a promising new paradigm, offering large degrees of data compression on conventional hardware and a natural pathway towards solving exponentially large problems on quantum computers. Early studies suggest that tensor-network methods may also help overcome key bottlenecks in computational plasma dynamics, particularly for industry-relevant scenarios where conventional simulations remain costly. In this work, we present recent progress in developing tensor-network methods compared to standard particle-in-cell codes and discuss their capability to overcome the bottlenecks of conventional approaches. We further extend the tensor-network formulation to support the insertion of electromagnetic fields at arbitrary spatial locations. This capability is demonstrated through the injection of a laser field to accelerate a plasma, providing a key step towards tensor-network-based simulation of externally driven plasma systems.

AI Summary

The paper addresses how to inject electromagnetic fields at interior locations in tensor-network simulations of plasma dynamics, extending earlier implementations restricted to boundary injection. It uses a classical matrix-product-state (MPS) representation of discretized Vlasov–Maxwell fields and distribution functions, with binary grid encoding and finite-difference derivatives represented as matrix-product operators. The new component is a total-field/scattered-field (TFSF) construction. The domain is partitioned into regions containing either the total field or only scattered fields. At their interface, analytical incident-field contributions correct the finite-difference derivatives. These corrections are implemented using MPS tensors supported at the two adjacent grid points. The construction also accommodates two opposing injected beams. A Maxwell-field propagation example places injection interfaces 32 grid points from the boundaries and shows field snapshots at $t=L_x/(6c)$ and $t=L_x/c$. A beat-wave calculation measures average runtime per step over the first 50 steps at fixed bond dimension $\chi=512$; the reported scaling indicates that adding TFSF preserves logarithmic runtime dependence on grid resolution in this test. Earlier bump-on-tail and beat-wave results are reviewed as background, including the need for $\chi=512$ to reproduce beat-wave current density without noticeable truncation errors. The stated efficiency depends on restricting correlations without losing relevant physics. Further development is needed to match mature particle-in-cell capabilities. The paper does not present a quantum-computer implementation; its quantum connection is through tensor-network representations and possible future algorithms.

Little sign of AI-generated textIncrementalOverclaimsMissing comparisonStrong assumptions

Central claim may not hold: The abstract's claimed demonstration of laser-driven plasma acceleration is unsupported by the reported new results, which show electromagnetic-field propagation and runtime measurements rather than plasma acceleration. The fixed-bond-dimension benchmark over the first 50 time steps does not establish logarithmic simulation cost at a specified accuracy as grid resolution or simulation duration increases. The Outlook reverses the grid-size relationship: the number of MPS tensors is logarithmic in the represented grid size, not vice versa.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
4 pages, 7 figures. Accepted Workshop Paper (QC4PDE) at IEEE Quantum Week 2026

Related papers

Tensor network approaches for plasma dynamics

Ryan J. J. Connor, Preetma Soin, Callum W. Duncan +1 more

The dynamics of plasmas are governed by a set of non-linear differential equations which remain challenging to solve directly for large 2D and 3D problems. Here we investigate how tensor networks could be applied to plasmas described by the Vlasov-Maxwell system of equations and investigate parameter regimes which show promise for efficient simulations. We show for low-dimensional problems that the simplest form of tensor networks known as a Matrix Product State performs sufficiently well, however in regimes with a strong permanent magnetic field or high-dimensional problems one may need to consider alternative tensor network geometries. We conclude the study of the Vlasov-Maxwell system with the application of tensor networks to an industrially relevant test case and validate our results against state of the art plasma solvers based on Particle-In-Cell codes. We also extend the application of tensor networks to the alternative plasma description of Magnetohydrodynamics and outline how this can be encoded using Matrix Product States.

physics.plasm-phCross-listedarXiv:2512.15924•Dec 19, 2025•2 citations

Quantum-Inspired Simulation of Complex Systems using Tensor Networks

Jincheng Zhang

The accurate simulation of complex systems, encompassing fields like materials science, quantum chemistry, and finance, often presents a formidable computational challenge. Traditional methods frequently struggle to scale effectively, particularly when dealing with high-dimensionality or intricate correlations. This paper introduces a novel simulation approach leveraging tensor networks (TN) in conjunction with quantum-inspired sampling techniques. The core idea is to approximate the dynamics of these complex systems by exploiting the inherent structure of tensor networks and employing sampling strategies inspired by quantum measurement processes. We demonstrate that this hybrid approach offers a pathway towards scalable simulations, achieving high accuracy while mitigating the computational bottlenecks associated with conventional methods. The key innovations lie in the adaptive construction of TNs based on the system's correlation structure and the utilization of quantum-inspired sampling methods to efficiently capture the relevant dynamics. This work presents a theoretical framework and outlines a methodology for implementing such simulations, paving the way for advancements in the modeling and understanding of complex systems.

•Sep 6, 2026•0 citations

Efficient Treatment of Non-Linearity in Quantum Computational Fluid Dynamics Using Hybrid Tensor Networks

Pia Siegl, Nis-Luca van Hülst, Maximilian Mandelt Buxadé +2 more

Nonlinear terms present a fundamental challenge for quantum computational fluid dynamics, as their implementation on inherently linear quantum hardware typically requires resource-intensive workarounds that limit scalability to large-scale simulations. We present a hybrid quantum-classical tensor network algorithm that addresses this bottleneck by combining variational time-stepping with quantum tensor programming to efficiently compile operators and time-dependent fields into quantum circuits. Within a probabilistic framework, we replace prior state-based nonlinear implementations with tensor-based block encodings, stabilizing success probabilities that otherwise decay exponentially with system size. Benchmarking on turbulent flow fields demonstrates that the algorithm maintains high success probabilities and moderate measurement overhead across increasing Reynolds numbers and grid resolutions. Compared to fully classical tensor network solvers, our hybrid approach yields substantial reductions in both memory footprint and computational cost, establishing a scalable pathway toward practical quantum advantage in scale-resolving CFD simulations.

quant-pharXiv:2608.24150•Aug 26, 2026•1 citation

Quantum Algorithms for Computational Fluid Dynamics

Mario Guillaume Cecile, Nis-Luca van Hülst, Tomohiro Hashizume +19 more

We present a comprehensive review of quantum approaches for solving partial differential equations (PDEs) arising in computational fluid dynamics (CFD). We examine fully quantum approaches, including quantum linear system algorithms (QLSAs), ranging from the Harrow--Hassidim--Lloyd (HHL) algorithm to quantum singular value transformation (QSVT), Hamiltonian simulation, and quantum lattice Boltzmann methods (QLBMs), while emphasizing hybrid quantum--classical approaches, including quantum physics-informed neural networks (QPINNs) and amplitude-encoded variational PDE solvers. We focus on hardware-agnostic algorithms compatible with present noisy processors and emerging fault-tolerant architectures. For each framework, we analyze the mathematical formulation, algorithmic structure, and principal limitations. We also examine tensor-network (TN) representations, since CFD fields, differential operators, and geometrical information can often be encoded efficiently in low-rank form. The TN formalism bridges CFD discretizations and quantum states, operators, and circuits, enabling compact representations to be translated into tensor-programmable variational quantum algorithms (TP-VQAs). We further review benchmark problems, including Poisson, reaction, diffusion, and nonlinear model equations, and assess how well quantum algorithms capture key features of fluid dynamics. Our analysis highlights that potential quantum advantage is highly problem dependent and governed by condition number, representational complexity, state preparation, and measurement constraints. We outline capabilities, limitations, and challenges toward scalable quantum algorithms for CFD.

quant-pharXiv:2609.39962•Oct 1, 2026•1 citation

A Tensor Network-Based Quantum Algorithm for the Nonlinear 1D Burgers' Equation

Muralikrishnan Gopalakrishnan Meena, Vincent Jones, Yu Zhang +1 more

In this work, we implement a tensor network-based quantum algorithm to solve unsteady, nonlinear partial differential equations (PDEs). The challenge lies in how to effectively represent, encode, process, and evolve the nonlinear system of PDEs on quantum computers. We will discuss the new techniques using the compressible 1-dimensional (1D) Burgers' equation as an example, because it represents the fundamental nonlinear feature and yet removes certain complexity in physics, allowing us to focus on the design of quantum algorithms. Previous attempts to solve nonlinear PDEs in quantum computation have often involved storing multiple copies of solutions or employing linearizations. Neither is practical due to exponential scaling with evolution time or insufficient solution accuracy. Our framework is based on matrix product states (MPSs) and matrix product operators (MPOs). For example, the velocity field is represented by MPS, whereas the linear and nonlinear spatial differential terms of the velocity field are processed by MPOs. Our primary focus herein is to verify and validate the various tensor network components of the algorithm using solutions obtained by the classical algorithms on high performance computing (HPC) architectures. We use a classical time marching method to demonstrate the functionality of the tensor network operations to model the PDE and their robustness with the time evolution of the system. Our classical simulation results demonstrate the utility of tensor network-based operations in modeling nonlinear PDEs and highlight the necessity as well as potential advantages of using quantum simulations for these techniques.

AIAA SciTech Forum•Jan 8, 2026•1 citation

Tensor network methods for non-perturbative dynamics of open quantum systems

Thibaut Lacroix, Adam Burgess, Nicola Lorenzoni +11 more

The description of open quantum system dynamics beyond the perturbative treatment (usually associated with Markovian master equations) is a computationally challenging task due to the unfavorable exponential scaling of memory kernels. Developed over recent decades in the context of quantum information and condensed matter, tensor networks provide both a new formalism and a toolbox for overcoming previous computational bottlenecks. This framework enables the formulation of non-perturbative, numerically exact methods for describing the dynamics of open quantum systems to controllable numerical accuracy. In this review, we present these methods and discuss their commonalities and differences to paint a comprehensive view of the field.

quant-pharXiv:2608.09850•Aug 11, 2026•7 citations
Solving the high-dimensional, nonlinear partial differential equations that govern the rich physics of plasmas remains a major computational challenge. In fluid dynamics, quantum-inspired methods based on tensor-network techniques have recently emerged as a promising new paradigm, offering large degrees of data compression on conventional hardware and a natural pathway towards solving exponentially large problems on quantum computers. Early studies suggest that tensor-network methods may also help overcome key bottlenecks in computational plasma dynamics, particularly for industry-relevant scenarios where conventional simulations remain costly. In this work, we present recent progress in developing tensor-network methods compared to standard particle-in-cell codes and discuss their capability to overcome the bottlenecks of conventional approaches. We further extend the tensor-network formulation to support the insertion of electromagnetic fields at arbitrary spatial locations. This capability is demonstrated through the injection of a laser field to accelerate a plasma, providing a key step towards tensor-network-based simulation of externally driven plasma systems.
The paper addresses how to inject electromagnetic fields at interior locations in tensor-network simulations of plasma dynamics, extending earlier implementations restricted to boundary injection. It uses a classical matrix-product-state (MPS) representation of discretized Vlasov–Maxwell fields and distribution functions, with binary grid encoding and finite-difference derivatives represented as matrix-product operators.
The new component is a total-field/scattered-field (TFSF) construction. The domain is partitioned into regions containing either the total field or only scattered fields. At their interface, analytical incident-field contributions correct the finite-difference derivatives. These corrections are implemented using MPS tensors supported at the two adjacent grid points. The construction also accommodates two opposing injected beams.
A Maxwell-field propagation example places injection interfaces 32 grid points from the boundaries and shows field snapshots at t=Lx/(6c)t=L_x/(6c)t=Lx​/(6c) and t=Lx/ct=L_x/ct=Lx​/c. A beat-wave calculation measures average runtime per step over the first 50 steps at fixed bond dimension χ=512\chi=512χ=512; the reported scaling indicates that adding TFSF preserves logarithmic runtime dependence on grid resolution in this test. Earlier bump-on-tail and beat-wave results are reviewed as background, including the need for χ=512\chi=512χ=512 to reproduce beat-wave current density without noticeable truncation errors.
The stated efficiency depends on restricting correlations without losing relevant physics. Further development is needed to match mature particle-in-cell capabilities. The paper does not present a quantum-computer implementation; its quantum connection is through tensor-network representations and possible future algorithms.
The dynamics of plasmas are governed by a set of non-linear differential equations which remain challenging to solve directly for large 2D and 3D problems. Here we investigate how tensor networks could be applied to plasmas described by the Vlasov-Maxwell system of equations and investigate parameter regimes which show promise for efficient simulations. We show for low-dimensional problems that the simplest form of tensor networks known as a Matrix Product State performs sufficiently well, however in regimes with a strong permanent magnetic field or high-dimensional problems one may need to consider alternative tensor network geometries. We conclude the study of the Vlasov-Maxwell system with the application of tensor networks to an industrially relevant test case and validate our results against state of the art plasma solvers based on Particle-In-Cell codes. We also extend the application of tensor networks to the alternative plasma description of Magnetohydrodynamics and outline how this can be encoded using Matrix Product States.
The accurate simulation of complex systems, encompassing fields like materials science, quantum chemistry, and finance, often presents a formidable computational challenge. Traditional methods frequently struggle to scale effectively, particularly when dealing with high-dimensionality or intricate correlations. This paper introduces a novel simulation approach leveraging tensor networks (TN) in conjunction with quantum-inspired sampling techniques. The core idea is to approximate the dynamics of these complex systems by exploiting the inherent structure of tensor networks and employing sampling strategies inspired by quantum measurement processes. We demonstrate that this hybrid approach offers a pathway towards scalable simulations, achieving high accuracy while mitigating the computational bottlenecks associated with conventional methods. The key innovations lie in the adaptive construction of TNs based on the system's correlation structure and the utilization of quantum-inspired sampling methods to efficiently capture the relevant dynamics. This work presents a theoretical framework and outlines a methodology for implementing such simulations, paving the way for advancements in the modeling and understanding of complex systems.
Nonlinear terms present a fundamental challenge for quantum computational fluid dynamics, as their implementation on inherently linear quantum hardware typically requires resource-intensive workarounds that limit scalability to large-scale simulations. We present a hybrid quantum-classical tensor network algorithm that addresses this bottleneck by combining variational time-stepping with quantum tensor programming to efficiently compile operators and time-dependent fields into quantum circuits. Within a probabilistic framework, we replace prior state-based nonlinear implementations with tensor-based block encodings, stabilizing success probabilities that otherwise decay exponentially with system size. Benchmarking on turbulent flow fields demonstrates that the algorithm maintains high success probabilities and moderate measurement overhead across increasing Reynolds numbers and grid resolutions. Compared to fully classical tensor network solvers, our hybrid approach yields substantial reductions in both memory footprint and computational cost, establishing a scalable pathway toward practical quantum advantage in scale-resolving CFD simulations.
We present a comprehensive review of quantum approaches for solving partial differential equations (PDEs) arising in computational fluid dynamics (CFD). We examine fully quantum approaches, including quantum linear system algorithms (QLSAs), ranging from the Harrow--Hassidim--Lloyd (HHL) algorithm to quantum singular value transformation (QSVT), Hamiltonian simulation, and quantum lattice Boltzmann methods (QLBMs), while emphasizing hybrid quantum--classical approaches, including quantum physics-informed neural networks (QPINNs) and amplitude-encoded variational PDE solvers. We focus on hardware-agnostic algorithms compatible with present noisy processors and emerging fault-tolerant architectures. For each framework, we analyze the mathematical formulation, algorithmic structure, and principal limitations. We also examine tensor-network (TN) representations, since CFD fields, differential operators, and geometrical information can often be encoded efficiently in low-rank form. The TN formalism bridges CFD discretizations and quantum states, operators, and circuits, enabling compact representations to be translated into tensor-programmable variational quantum algorithms (TP-VQAs). We further review benchmark problems, including Poisson, reaction, diffusion, and nonlinear model equations, and assess how well quantum algorithms capture key features of fluid dynamics. Our analysis highlights that potential quantum advantage is highly problem dependent and governed by condition number, representational complexity, state preparation, and measurement constraints. We outline capabilities, limitations, and challenges toward scalable quantum algorithms for CFD.
In this work, we implement a tensor network-based quantum algorithm to solve unsteady, nonlinear partial differential equations (PDEs). The challenge lies in how to effectively represent, encode, process, and evolve the nonlinear system of PDEs on quantum computers. We will discuss the new techniques using the compressible 1-dimensional (1D) Burgers' equation as an example, because it represents the fundamental nonlinear feature and yet removes certain complexity in physics, allowing us to focus on the design of quantum algorithms. Previous attempts to solve nonlinear PDEs in quantum computation have often involved storing multiple copies of solutions or employing linearizations. Neither is practical due to exponential scaling with evolution time or insufficient solution accuracy. Our framework is based on matrix product states (MPSs) and matrix product operators (MPOs). For example, the velocity field is represented by MPS, whereas the linear and nonlinear spatial differential terms of the velocity field are processed by MPOs. Our primary focus herein is to verify and validate the various tensor network components of the algorithm using solutions obtained by the classical algorithms on high performance computing (HPC) architectures. We use a classical time marching method to demonstrate the functionality of the tensor network operations to model the PDE and their robustness with the time evolution of the system. Our classical simulation results demonstrate the utility of tensor network-based operations in modeling nonlinear PDEs and highlight the necessity as well as potential advantages of using quantum simulations for these techniques.
The description of open quantum system dynamics beyond the perturbative treatment (usually associated with Markovian master equations) is a computationally challenging task due to the unfavorable exponential scaling of memory kernels. Developed over recent decades in the context of quantum information and condensed matter, tensor networks provide both a new formalism and a toolbox for overcoming previous computational bottlenecks. This framework enables the formulation of non-perturbative, numerically exact methods for describing the dynamics of open quantum systems to controllable numerical accuracy. In this review, we present these methods and discuss their commonalities and differences to paint a comprehensive view of the field.