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

Tensor network approaches for plasma dynamics

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

physics.plasm-phquant-phSubmitted Dec 17, 2025• Announced Dec 19, 2025• 2 citations
arXivHTMLPDF

Abstract

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.

Related papers

Quantum approaches for particle-in-cell codes

Ryan J. J. Connor, Andrew J. Daley, Callum W. Duncan +1 more

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.

physics.plasm-phCross-listedarXiv:2610.03254•Oct 5, 2026•0 citations

Tensor Network Methods for Advection–Diffusion–Reaction Systems Using Quantum-Inspired Representations

Nahid Binandeh Dehaghani, Rafał Wiśniewski, A. Pedro Aguiar

We present a quantum-inspired tensor-network framework for solving advection–diffusion–reaction (ADR) partial differential equations. Discretized solution fields are encoded as matrix product states (MPS), while differential operators are represented as matrix product operators (MPOs). Time integration is performed entirely in tensor-network form using explicit Euler updates with controlled truncation. The method is evaluated on one- and two-dimensional ADR problems and compared with high-accuracy Runge–Kutta reference solutions. Numerical results show that the proposed representation remains compact, stable, and accurate across a range of dynamical regimes. The solver captures both local solution profiles and global observables while maintaining small bond dimensions throughout the simulation. These results highlight the potential of tensor networks as efficient structure-preserving tools for PDE simulation in multiple spatial dimensions.

International Conference on Control, Decision and Information Technologies (CoDIT)•Jul 1, 2026•0 citations

Tensor Network Methods for Advection-Diffusion-Reaction Systems Using Quantum-Inspired Representations

Nahid Binandeh Dehaghani, Rafal Wisniewski, A. Pedro Aguiar

We present a quantum-inspired tensor-network framework for solving advection-diffusion-reaction (ADR) partial differential equations. Discretized solution fields are encoded as matrix product states (MPS), while differential operators are represented as matrix product operators (MPOs). Time integration is performed entirely in tensor-network form using explicit Euler updates with controlled truncation. The method is evaluated on one- and two-dimensional ADR problems and compared with high-accuracy Runge-Kutta reference solutions. Numerical results show that the proposed representation remains compact, stable, and accurate across a range of dynamical regimes. The solver captures both local solution profiles and global observables while maintaining small bond dimensions throughout the simulation. These results highlight the potential of tensor networks as efficient structure-preserving tools for PDE simulation in multiple spatial dimensions.

math.NACross-listedarXiv:2607.14150•Jul 15, 2026•0 citations

Quantum Simulation of Molecular Dynamics with Tensor Networks

Jincheng Zhang

This paper explores the application of tensor network methods for simulating molecular dynamics on quantum computers. Traditional molecular dynamics simulations are computationally expensive, particularly for complex systems exhibiting strong quantum correlations. Tensor networks provide a powerful framework for representing and manipulating high-dimensional quantum states, potentially offering a pathway to efficiently simulate molecular dynamics by directly leveraging quantum computational resources. This work details the theoretical framework, outlining how tensor network techniques, specifically Matrix Product States (MPS) and Tree Tensor Networks (TTN), can be adapted for this purpose. We present a simplified model of a diatomic molecule to illustrate the core concept: the construction of a tensor network representation of the molecular wavefunction, followed by the application of time evolution operators to simulate dynamics. The focus is on demonstrating the potential of this approach rather than a fully optimized simulation, highlighting key challenges and future research directions. The efficiency gains compared to classical methods are discussed, acknowledging the significant technological hurdles involved in realizing this approach on near-term quantum devices. We investigate the scalability of the method, considering the limitations imposed by the bond dimension of the tensor network. The ultimate goal is to demonstrate how tensor networks can provide a viable strategy for tackling computationally intractable molecular dynamics problems, paving the way for a new era of quantum-enhanced molecular simulations.

•Sep 5, 2026•0 citations

Tensor networks for lattice gauge theories beyond one dimension

Giuseppe Magnifico, Giovanni Cataldi, Marco Rigobello +4 more

Tensor network methods are numerical tools and algorithms to study many-body quantum systems in and out of equilibrium, based on tailored variational wave functions. They have found significant applications in simulating lattice gauge theories that approach relevant problems in high-energy physics. Compared to Monte Carlo methods, they do not suffer from the sign problem, allowing them to explore challenging regimes such as finite chemical potentials and real-time dynamics. Further development is required to tackle fundamental challenges, such as accessing continuum limits or computations of large-scale quantum chromodynamics. This work reviews the state-of-the-art tensor network methods and discusses a possible roadmap for algorithmic development and strategies to enhance their capabilities and extend their applicability to open high-energy problems. We provide tailored estimates of the theoretical and computational resource scaling for attacking large-scale lattice gauge theories. Tensor networks are a powerful complementary approach to Monte Carlo methods for simulating lattice gauge theories, enabling access to challenging regimes such as real-time dynamics and finite-density systems. This work reviews the state of the art, outlines a roadmap for algorithmic developments, and provides resource estimates to guide large-scale applications in high-energy physics.

arXiv:2407.03058•Communications Physics•Aug 9, 2025•53 citations

Who can compete with quantum computers? Lecture notes on quantum inspired tensor networks computational techniques

Xavier Waintal, Chen-How Huang, Christoph W. Groth

This is a set of lectures on tensor networks with a strong emphasis on the core algorithms involving Matrix Product States (MPS) and Matrix Product Operators (MPO). Compared to other presentations, particular care has been given to disentangle aspects of tensor networks from the quantum many-body problem: MPO/MPS algorithms are presented as a way to deal with linear algebra on extremely (exponentially) large matrices and vectors, regardless of any particular application. The lectures include well-known algorithms to find eigenvectors of MPOs (the celebrated DMRG), solve linear problems, and recent learning algorithms that allow one to map a known function into an MPS (the Tensor Cross Interpolation, or TCI, algorithm). The lectures end with a discussion of how to represent functions and perform calculus with tensor networks using the "quantics" representation. They include the detailed analytical construction of important MPOs such as those for differentiation, indefinite integration, convolution, and the quantum Fourier transform. Three concrete applications are discussed in detail: the simulation of a quantum computer (either exactly or with compression), the simulation of a quantum annealer, and techniques to solve partial differential equations (e.g. Poisson, diffusion, or Gross-Pitaevskii) within the "quantics" representation. The lectures have been designed to be accessible to a first-year PhD student and include detailed proofs of all statements.

quant-pharXiv:2601.03035•SciPost Physics Lecture Notes•Jan 7, 2026•17 citations
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.
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.
We present a quantum-inspired tensor-network framework for solving advection–diffusion–reaction (ADR) partial differential equations. Discretized solution fields are encoded as matrix product states (MPS), while differential operators are represented as matrix product operators (MPOs). Time integration is performed entirely in tensor-network form using explicit Euler updates with controlled truncation. The method is evaluated on one- and two-dimensional ADR problems and compared with high-accuracy Runge–Kutta reference solutions. Numerical results show that the proposed representation remains compact, stable, and accurate across a range of dynamical regimes. The solver captures both local solution profiles and global observables while maintaining small bond dimensions throughout the simulation. These results highlight the potential of tensor networks as efficient structure-preserving tools for PDE simulation in multiple spatial dimensions.
We present a quantum-inspired tensor-network framework for solving advection-diffusion-reaction (ADR) partial differential equations. Discretized solution fields are encoded as matrix product states (MPS), while differential operators are represented as matrix product operators (MPOs). Time integration is performed entirely in tensor-network form using explicit Euler updates with controlled truncation. The method is evaluated on one- and two-dimensional ADR problems and compared with high-accuracy Runge-Kutta reference solutions. Numerical results show that the proposed representation remains compact, stable, and accurate across a range of dynamical regimes. The solver captures both local solution profiles and global observables while maintaining small bond dimensions throughout the simulation. These results highlight the potential of tensor networks as efficient structure-preserving tools for PDE simulation in multiple spatial dimensions.
This paper explores the application of tensor network methods for simulating molecular dynamics on quantum computers. Traditional molecular dynamics simulations are computationally expensive, particularly for complex systems exhibiting strong quantum correlations. Tensor networks provide a powerful framework for representing and manipulating high-dimensional quantum states, potentially offering a pathway to efficiently simulate molecular dynamics by directly leveraging quantum computational resources. This work details the theoretical framework, outlining how tensor network techniques, specifically Matrix Product States (MPS) and Tree Tensor Networks (TTN), can be adapted for this purpose. We present a simplified model of a diatomic molecule to illustrate the core concept: the construction of a tensor network representation of the molecular wavefunction, followed by the application of time evolution operators to simulate dynamics. The focus is on demonstrating the potential of this approach rather than a fully optimized simulation, highlighting key challenges and future research directions. The efficiency gains compared to classical methods are discussed, acknowledging the significant technological hurdles involved in realizing this approach on near-term quantum devices. We investigate the scalability of the method, considering the limitations imposed by the bond dimension of the tensor network. The ultimate goal is to demonstrate how tensor networks can provide a viable strategy for tackling computationally intractable molecular dynamics problems, paving the way for a new era of quantum-enhanced molecular simulations.
Tensor network methods are numerical tools and algorithms to study many-body quantum systems in and out of equilibrium, based on tailored variational wave functions. They have found significant applications in simulating lattice gauge theories that approach relevant problems in high-energy physics. Compared to Monte Carlo methods, they do not suffer from the sign problem, allowing them to explore challenging regimes such as finite chemical potentials and real-time dynamics. Further development is required to tackle fundamental challenges, such as accessing continuum limits or computations of large-scale quantum chromodynamics. This work reviews the state-of-the-art tensor network methods and discusses a possible roadmap for algorithmic development and strategies to enhance their capabilities and extend their applicability to open high-energy problems. We provide tailored estimates of the theoretical and computational resource scaling for attacking large-scale lattice gauge theories. Tensor networks are a powerful complementary approach to Monte Carlo methods for simulating lattice gauge theories, enabling access to challenging regimes such as real-time dynamics and finite-density systems. This work reviews the state of the art, outlines a roadmap for algorithmic developments, and provides resource estimates to guide large-scale applications in high-energy physics.
This is a set of lectures on tensor networks with a strong emphasis on the core algorithms involving Matrix Product States (MPS) and Matrix Product Operators (MPO). Compared to other presentations, particular care has been given to disentangle aspects of tensor networks from the quantum many-body problem: MPO/MPS algorithms are presented as a way to deal with linear algebra on extremely (exponentially) large matrices and vectors, regardless of any particular application. The lectures include well-known algorithms to find eigenvectors of MPOs (the celebrated DMRG), solve linear problems, and recent learning algorithms that allow one to map a known function into an MPS (the Tensor Cross Interpolation, or TCI, algorithm). The lectures end with a discussion of how to represent functions and perform calculus with tensor networks using the "quantics" representation. They include the detailed analytical construction of important MPOs such as those for differentiation, indefinite integration, convolution, and the quantum Fourier transform. Three concrete applications are discussed in detail: the simulation of a quantum computer (either exactly or with compression), the simulation of a quantum annealer, and techniques to solve partial differential equations (e.g. Poisson, diffusion, or Gross-Pitaevskii) within the "quantics" representation. The lectures have been designed to be accessible to a first-year PhD student and include detailed proofs of all statements.