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:2508.15691 · Quantum Science and Technology

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

Julien Zylberman, Thibault Fredon, Nuno Loureiro, Fabrice Debbasch

Published Feb 20, 2026• 3 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1088/2058-9565/ae488e

Related papers

Quantum algorithm for anisotropic diffusion and convection equations with vector norm scaling

Julien Zylberman, Thibault Fredon, Nuno F. Loureiro +1 more

In this work, we tackle the resolution of partial differential equations (PDEs) on digital quantum computers. Two fundamental PDEs are addressed: the anisotropic diffusion equation and the anisotropic convection equation. We present a quantum numerical scheme consisting of three steps: quantum state preparation, evolution with diagonal operators, and measurement of observables of interest. The evolution step relies on a high-order centered finite difference and a product formula approximation, also known as Trotterization. We provide novel vector-norm analysis to bound the different sources of error. We prove that the number of time-steps required in the evolution can be reduced by a factor $Θ(16^n)$ for the diffusion equation, and $Θ(4^n)$ for the convection equation, where $n$ is the number of qubits per dimension, an exponential reduction compared to the previously established operator-norm analysis.

quant-pharXiv:2603.08799•Communications in computer and information science•Mar 11, 2026•1 citation

Resource-efficient quantum simulation of transport phenomena via Hamiltonian embedding

Joseph Li, Gengzhi Yang, Jiaqi Leng +1 more

Transport phenomena play a key role in a variety of application domains, and efficient simulation of these dynamics remains an outstanding challenge. While quantum computers offer potential for significant speedups, existing algorithms either lack rigorous theoretical guarantees or demand substantial quantum resources, preventing scalable and efficient validation on realistic quantum hardware. To address this gap, we develop a comprehensive framework for simulating classes of transport equations, offering both rigorous theoretical guarantees -- including exponential speedups in specific cases -- and a systematic, hardware-efficient implementation. Central to our approach is the Hamiltonian embedding technique, a white-box approach for end-to-end simulation of sparse Hamiltonians that avoids abstract query models and retains near-optimal asymptotic complexity. Empirical resource estimates indicate that our approach can yield an order-of-magnitude (e.g., $42\times$) reduction in circuit depth given favorable problem structures. We then apply our framework to solve linear and nonlinear transport PDEs, including the first experimental demonstration of a 2D advection equation on a trapped-ion quantum computer.

quant-pharXiv:2602.03099•Quantum Science and Technology•Feb 4, 2026•3 citations

Utilizing Quantum Computing for Solving Multidimensional Partial Differential Equations

Manu Chaudhary

Quantum computing has the potential to revolutionize computational problem-solving by leveraging the quantum mechanical phenomena such as superposition and entanglement, enabling fundamentally different computational strategies compared to classical computing. Classical methods for solving complex and high dimensional partial differential equations (PDEs), crucial for modeling diverse physical phenomena, suffer from an exponential growth in computational complexity known as the curse of dimensionality. This can limit their effectiveness for certain high-resolution simulations and real-time computational applications. In contrast, quantum computing inherently exploits superposition and entanglement to efficiently represent and simultaneously manipulate large-scale discretized PDEs, using exponentially fewer resources compared to classical systems. There are currently many quantum techniques available for solving partial differential equations (PDEs), which are mainly based on variational quantum circuits. However, the existing quantum PDE solvers, particularly those based on variational quantum eigensolver (VQE) techniques, suffer from several limitations. These include low accuracy, high execution times, and low scalability on quantum simulators as well as on noisy intermediate-scale quantum (NISQ) devices, especially for multidimensional PDEs. In this work, we propose an efficient and scalable algorithm for solving multidimensional PDEs. We present two variants of our algorithm: the first leverages finite-difference method (FDM), classical-to-quantum (C2Q) encoding, and numerical instantiation, while the second employs FDM, C2Q, and column-by-column decomposition (CCD). Both variants are designed to enhance accuracy and scalability while reducing execution times. We have validated and evaluated our proposed concepts using a number of case studies including multidimensional Poisson equation, multidimensional heat equation, Black Scholes equation for financial option pricing, and Navier-Stokes equation for computational fluid dynamics (CFD), achieving promising results. Our results demonstrate higher accuracy, higher scalability, and faster execution times compared to VQE-based solvers on noise-free and noisy quantum simulators from IBM. Additionally, we validated our approach on hardware emulators and actual quantum hardware, employing noise mitigation techniques. This work establishes a practical and effective approach for solving PDEs using quantum computing for engineering and scientific applications.

•Jan 1, 2025•0 citations

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

Kartick Paul, Rahul V, S. Aravinda +1 more

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.

quant-pharXiv:2608.23127•Aug 25, 2026•1 citation

A Quantum Algorithm for Multidimensional Partial Differential Equations with Practical Case Studies

Manu Chaudhary, Kareem El-Araby, Devon Bontrager +12 more

Partial differential equations (PDEs) play a central role in scientific and engineering analysis, with applications spanning fluid dynamics, heat and mass transfer, electromagnetism, quantum mechanics, and financial modeling, where they are used to describe diffusion processes, wave propagation, and the evolution of complex systems over space and time. Solving multidimensional partial differential equations (PDEs) is a computationally challenging problem, even for the most advanced classical systems. Over the past decade, quantum computing has attracted significant interest as a potential approach for solving complex computational problems, including multidimensional PDEs. Although a variety of approaches have been proposed for solving PDEs, most of the existing techniques are based on variational quantum algorithms (VQAs). Despite being promising, these VQA-based approaches suffer from low accuracy, long execution times, and limited scalability. In this work, we propose a scalable and efficient quantum algorithm for solving multidimensional PDEs. Our algorithm has two variants. One variant is based on the finite difference method (FDM), classical-to-quantum (C2Q) encoding, and numerical instantiation, whereas the other is based on FDM, C2Q, and column-by-column decomposition (CCD). We have also evaluated our algorithm using several practical case studies; namely, Poisson, heat, Black–Scholes, and Navier–Stokes equations. The results show that our proposed approach achieves higher accuracy, greater scalability, and faster execution time than the VQA-based approaches. We validated these findings on both noise-free and noisy simulators, as well as on a hardware emulator and real IBM quantum hardware.

Algorithms•Jul 7, 2026•0 citations

Quantum dynamics simulation of the advection-diffusion equation

Hirad Alipanah, Feng Zhang, Yong-Xin Yao +6 more

The advection-diffusion equation is simulated via several quantum algorithms. Three formulations are considered: (1) Trotterization, (2) variational quantum time evolution (VarQTE), and (3) adaptive variational quantum dynamics simulation (AVQDS). These schemes were originally developed for the Hamiltonian simulation of many-body quantum systems. The finite-difference discretized operator of the transport equation is formulated as a Hamiltonian and solved without the need for ancillary qubits. Computations are conducted on a quantum simulator (IBM Qiskit Aer) and a superconducting quantum hardware (IBM Fez). The former emulates the latter without the noise. The actual hardware implementation experiences significant noise. The results of the quantum simulator are compared with data from direct numerical simulation (DNS) with infidelities of the order 10 − 5 . In the quantum simulator, Trotterization is observed to have the lowest infidelity and is suitable for fault-tolerant computation. The AVQDS algorithm requires the lowest gate count and circuit depth. The VarQTE algorithm is the next best in terms of gate counts, but the number of its optimization variables is directly proportional to the number of qubits. Due to current hardware limitations, Trotterization cannot be implemented, as it has an overwhelmingly large number of operations. Meanwhile, AVQDS and VarQTE can be executed at the hardware level. These algorithms present a new paradigm for computational transport phenomena on quantum computers.

arXiv:2503.13729•Physical Review Research•Oct 19, 2025•16 citations
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.
In this work, we tackle the resolution of partial differential equations (PDEs) on digital quantum computers. Two fundamental PDEs are addressed: the anisotropic diffusion equation and the anisotropic convection equation. We present a quantum numerical scheme consisting of three steps: quantum state preparation, evolution with diagonal operators, and measurement of observables of interest. The evolution step relies on a high-order centered finite difference and a product formula approximation, also known as Trotterization. We provide novel vector-norm analysis to bound the different sources of error. We prove that the number of time-steps required in the evolution can be reduced by a factor Θ(16n)Θ(16^n)Θ(16n) for the diffusion equation, and Θ(4n)Θ(4^n)Θ(4n) for the convection equation, where nnn is the number of qubits per dimension, an exponential reduction compared to the previously established operator-norm analysis.
Transport phenomena play a key role in a variety of application domains, and efficient simulation of these dynamics remains an outstanding challenge. While quantum computers offer potential for significant speedups, existing algorithms either lack rigorous theoretical guarantees or demand substantial quantum resources, preventing scalable and efficient validation on realistic quantum hardware. To address this gap, we develop a comprehensive framework for simulating classes of transport equations, offering both rigorous theoretical guarantees -- including exponential speedups in specific cases -- and a systematic, hardware-efficient implementation. Central to our approach is the Hamiltonian embedding technique, a white-box approach for end-to-end simulation of sparse Hamiltonians that avoids abstract query models and retains near-optimal asymptotic complexity. Empirical resource estimates indicate that our approach can yield an order-of-magnitude (e.g., 42×42\times42×) reduction in circuit depth given favorable problem structures. We then apply our framework to solve linear and nonlinear transport PDEs, including the first experimental demonstration of a 2D advection equation on a trapped-ion quantum computer.
Quantum computing has the potential to revolutionize computational problem-solving by leveraging the quantum mechanical phenomena such as superposition and entanglement, enabling fundamentally different computational strategies compared to classical computing. Classical methods for solving complex and high dimensional partial differential equations (PDEs), crucial for modeling diverse physical phenomena, suffer from an exponential growth in computational complexity known as the curse of dimensionality. This can limit their effectiveness for certain high-resolution simulations and real-time computational applications. In contrast, quantum computing inherently exploits superposition and entanglement to efficiently represent and simultaneously manipulate large-scale discretized PDEs, using exponentially fewer resources compared to classical systems. There are currently many quantum techniques available for solving partial differential equations (PDEs), which are mainly based on variational quantum circuits. However, the existing quantum PDE solvers, particularly those based on variational quantum eigensolver (VQE) techniques, suffer from several limitations. These include low accuracy, high execution times, and low scalability on quantum simulators as well as on noisy intermediate-scale quantum (NISQ) devices, especially for multidimensional PDEs. In this work, we propose an efficient and scalable algorithm for solving multidimensional PDEs. We present two variants of our algorithm: the first leverages finite-difference method (FDM), classical-to-quantum (C2Q) encoding, and numerical instantiation, while the second employs FDM, C2Q, and column-by-column decomposition (CCD). Both variants are designed to enhance accuracy and scalability while reducing execution times. We have validated and evaluated our proposed concepts using a number of case studies including multidimensional Poisson equation, multidimensional heat equation, Black Scholes equation for financial option pricing, and Navier-Stokes equation for computational fluid dynamics (CFD), achieving promising results. Our results demonstrate higher accuracy, higher scalability, and faster execution times compared to VQE-based solvers on noise-free and noisy quantum simulators from IBM. Additionally, we validated our approach on hardware emulators and actual quantum hardware, employing noise mitigation techniques. This work establishes a practical and effective approach for solving PDEs using quantum computing for engineering and scientific applications.
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.
Partial differential equations (PDEs) play a central role in scientific and engineering analysis, with applications spanning fluid dynamics, heat and mass transfer, electromagnetism, quantum mechanics, and financial modeling, where they are used to describe diffusion processes, wave propagation, and the evolution of complex systems over space and time. Solving multidimensional partial differential equations (PDEs) is a computationally challenging problem, even for the most advanced classical systems. Over the past decade, quantum computing has attracted significant interest as a potential approach for solving complex computational problems, including multidimensional PDEs. Although a variety of approaches have been proposed for solving PDEs, most of the existing techniques are based on variational quantum algorithms (VQAs). Despite being promising, these VQA-based approaches suffer from low accuracy, long execution times, and limited scalability. In this work, we propose a scalable and efficient quantum algorithm for solving multidimensional PDEs. Our algorithm has two variants. One variant is based on the finite difference method (FDM), classical-to-quantum (C2Q) encoding, and numerical instantiation, whereas the other is based on FDM, C2Q, and column-by-column decomposition (CCD). We have also evaluated our algorithm using several practical case studies; namely, Poisson, heat, Black–Scholes, and Navier–Stokes equations. The results show that our proposed approach achieves higher accuracy, greater scalability, and faster execution time than the VQA-based approaches. We validated these findings on both noise-free and noisy simulators, as well as on a hardware emulator and real IBM quantum hardware.
The advection-diffusion equation is simulated via several quantum algorithms. Three formulations are considered: (1) Trotterization, (2) variational quantum time evolution (VarQTE), and (3) adaptive variational quantum dynamics simulation (AVQDS). These schemes were originally developed for the Hamiltonian simulation of many-body quantum systems. The finite-difference discretized operator of the transport equation is formulated as a Hamiltonian and solved without the need for ancillary qubits. Computations are conducted on a quantum simulator (IBM Qiskit Aer) and a superconducting quantum hardware (IBM Fez). The former emulates the latter without the noise. The actual hardware implementation experiences significant noise. The results of the quantum simulator are compared with data from direct numerical simulation (DNS) with infidelities of the order 10 − 5 . In the quantum simulator, Trotterization is observed to have the lowest infidelity and is suitable for fault-tolerant computation. The AVQDS algorithm requires the lowest gate count and circuit depth. The VarQTE algorithm is the next best in terms of gate counts, but the number of its optimization variables is directly proportional to the number of qubits. Due to current hardware limitations, Trotterization cannot be implemented, as it has an overwhelmingly large number of operations. Meanwhile, AVQDS and VarQTE can be executed at the hardware level. These algorithms present a new paradigm for computational transport phenomena on quantum computers.