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

Towards Solving Transport Equations in Battery Modelling with Variational Quantum Algorithms

Schelling, Michael, Pool, Albert, Steffen, David, Horstmann, Birger

Published Apr 23, 2025• 0 citations
OpenAlex

Abstract

The material design for batteries in industry and research is greatly facilitated by computational simulations on classical computers. A central tool are numerical solvers for Partial Differential Equations (PDEs), which arise as the transport equations of ions in the continuum-model of battery cells. However, these methods reach their limits when simulating the fine-grained heterogeneous structures of porous electrodes. Quantum computing is a promising candidate to achieve an advantage in scalability through the exponential growth of representable states. On current NISQ-devices promising candidates are Variational Quantum Algorithms (VQAs) to solve nonlinear PDEs. Experimental results demonstrate the capabilities of both space-time encodings with Quantum Non-linear Processing Units (QNPUs) and spectral feature mappings with Differentiable Quantum Circuits (DQCs).

Related papers

Variational Quantum Algorithms for Continuum Modelling of Batteries

Pool, Albert, Schelling, Michael, Horstmann, Birger

Quantum computing is becoming relevant to energy science for more accurate calculations in quantum chemistry and in materials discovery with quantum machine learning methods. However, it is also applicable to cell models thanks to recent works solving nonlinear partial differential equations (PDEs). Various methods have been recently proposed, including fault-tolerant quantum linear systems algorithms (QLSAs) for linear and nonlinear PDEs. In practice, however, these fault-tolerant algorithms do not yet give a quantum advantage. On current noisy intermediate-scale quantum (NISQ) devices, these algorithms are affected by strong limitations on the depth of the quantum circuits that can be coherently executed. On NISQ devices, variational quantum algorithms (VQAs) have become a popular approach to solving PDEs. Many algorithms have been proposed that solve one time step at a time, which inherently presents a limitation to the scalability and accuracy. In our paper, we combine quantum nonlinear processing units (QNPUs) with the Feynman-Kitaev Hamiltonian to achieve a spacetime solution instead, and apply it to the nonlinear Burgers equation. We find the ground state of this Hamiltonian using an adaptive optimization procedure to avoid barren plateaus. Here, we also apply this method to an adapted version of the single particle model with electrolyte (SPMe).

•Jan 1, 2025•0 citations

Performance Study of Variational Quantum Algorithms for Solving the Poisson Equation on a Quantum Computer

Mazen Ali, Matthias Kabel

Recent advances in quantum computing and their increased availability has led to a growing interest in possible applications. Among those is the solution of partial differential equations (PDEs) for, e.g., material or flow simulation. Currently, the most promising route to useful deployment of quantum processors in the short to near term are so-called hybrid variational quantum algorithms (VQAs). Thus, variational methods for PDEs have been proposed as a candidate for quantum advantage in the noisy intermediate-scale quantum (NISQ) era. In this work, we conduct an extensive study of utilizing VQAs on real quantum devices to solve the simplest prototype of a PDE---the Poisson equation. Although results on noiseless simulators for small problem sizes may seem deceivingly promising, the performance on quantum computers is very poor. We argue that direct resolution of PDEs via an amplitude encoding of the solution is not a good use case within reach of today's quantum devices---especially when considering large system sizes and more complicated nonlinear PDEs that are required in order to be competitive with classical high-end solvers.

arXiv:2211.14064•Physical Review Applied•Jul 25, 2023•41 citations

Influence of different feature maps on solving partial differential equations on quantum computers

Steffen, David, Schelling, Michael, Schwab, Felix Konrad +1 more

Differentiable quantum circuits (DQCs) [1] are variational algorithms to solve partial differential equations on quantum computers. We investigate the potential of this method to solve systems of coupled partial differential equations as they occur in the simulation of electrochemical systems, e.g., fuel cells and batteries. A crucial part of DQCs is the feature space in which the input variables are encoded into quantum states. Possible choices are a Chebyshev feature map or a Fourier feature map, that generate a set of corresponding basis functions to fit the desired model. We show results on the influence of different feature maps on the expressibility and trainability for spatiotemporal models, on the use case of transport equations from battery simulation. [1] Kyriienko, O. et al., Phys. Rev. A 2021, 103, 052416

•Jan 1, 2025•0 citations

Quantum algorithms to solve partial differential equations in battery modelling

Pool, Albert, Somoza, Alejandro, Mc Keever, Conor +2 more

Mathematical models of electrochemical systems such as batteries or fuel cells consist of sets of coupled nonlinear partial differential equations. We describe how variational quantum algorithms (VQAs) can be used to solve these equations on a quantum computer [1]. VQAs are hybrid quantum-classical algorithms, where a cost function is calculated on a quantum computer and its parameters are optimised classically. We present a spacetime representation, inspired by the Feynman--Kitaev Hamiltonian [2], where the solution to a PDE at all times is obtained by minimising just one function. [1] A.J. Pool, A.D. Somoza, C. Mc Keever, M. Lubasch, B. Horstmann, Phys. Rev. Res. 6 (2024), 3, 033257 [2] S. Barison, F. Vicentini, J.I. Cirac, G. Carleo, Phys. Rev. Res. 4 (2022), 4, 043161

•Jan 1, 2025•0 citations

A Practical Quantum Solver for Multidimensional Partial Differential Equations

Manu Chaudhary, Kareem El-Araby, Alvir Nobel +9 more

Quantum computing has the potential to transform computational problem-solving by leveraging quantum mechanical principles of superposition and entanglement. This capability is particularly important for the numerical solution of complex and/or multidimensional partial differential equations (PDEs). There are currently many quantum techniques available for solving PDEs, which are mainly based on variational quantum algorithms (VQAs). However, the existing quantum PDE solvers, particularly those based on VQAs suffer from limitations such as low accuracy, high execution times, and low scalability on both simulators as well as on real quantum devices. 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 our proposed algorithm by solving several practically useful PDEs such as Poisson, heat, Black-Scholes, and Navier-Stokes equations. Our results demonstrate higher accuracy, higher scalability, and faster execution times compared to VQA-based solvers on noise-free and noisy quantum simulators from IBM and achieved promising results on real quantum hardware.

International Conference for High Performance Computing, Networking, Storage and Analysis (SC)•Nov 7, 2025•2 citations

Hybrid Krylov-Subspace Methods for Solving Non-Linear PDEs on Quantum Computers

Schelling, Michael, Horstmann, Birger

Numerical solvers for Partial Differential Equations (PDEs) are of great interest in various domains, e.g., in aerodynamics or for transport equations in lectrochemistry [1], and the need for fine-grained solutions of on-linear PDEs is growing. While subspace methods allow for a dimensionality reduction, non-linear PDEs require linearization schemes, such as the Carleman-linearization [2], resulting in linear systems of exponential dimensionality, operating on the limits of classical methods. Motivated by Krylov-subspace methods [3], which find approximate solutions in iteratively growing subspaces, the aim of this talk is to investigate the potential of two existing methods from quantum computing to compose a NISQ-era hybrid quantum-classical algorithm. Firstly, non-linear quantum computing (QNPUs) [4,5] and secondly Quantum Subspace Expansion (QSE) [6], both promising tools towards more scalable computations. The use of QNPUs enables linearization in a tensor-product-subspace using ancilla qubits, while offering efficient gate-based implementations. On the other hand, QSE measures high-dimensional overlaps on a quantum computer. The combination of these two methods yields the possibility of encapsulating the high-dimensional steps of linearization and subspace projection on a quantum device. As a result, only a lower-dimensional subspace problem remains to be solved on classical hardware.

•May 20, 2025•0 citations
The material design for batteries in industry and research is greatly facilitated by computational simulations on classical computers. A central tool are numerical solvers for Partial Differential Equations (PDEs), which arise as the transport equations of ions in the continuum-model of battery cells. However, these methods reach their limits when simulating the fine-grained heterogeneous structures of porous electrodes. Quantum computing is a promising candidate to achieve an advantage in scalability through the exponential growth of representable states. On current NISQ-devices promising candidates are Variational Quantum Algorithms (VQAs) to solve nonlinear PDEs. Experimental results demonstrate the capabilities of both space-time encodings with Quantum Non-linear Processing Units (QNPUs) and spectral feature mappings with Differentiable Quantum Circuits (DQCs).
Quantum computing is becoming relevant to energy science for more accurate calculations in quantum chemistry and in materials discovery with quantum machine learning methods. However, it is also applicable to cell models thanks to recent works solving nonlinear partial differential equations (PDEs). Various methods have been recently proposed, including fault-tolerant quantum linear systems algorithms (QLSAs) for linear and nonlinear PDEs. In practice, however, these fault-tolerant algorithms do not yet give a quantum advantage. On current noisy intermediate-scale quantum (NISQ) devices, these algorithms are affected by strong limitations on the depth of the quantum circuits that can be coherently executed. On NISQ devices, variational quantum algorithms (VQAs) have become a popular approach to solving PDEs. Many algorithms have been proposed that solve one time step at a time, which inherently presents a limitation to the scalability and accuracy. In our paper, we combine quantum nonlinear processing units (QNPUs) with the Feynman-Kitaev Hamiltonian to achieve a spacetime solution instead, and apply it to the nonlinear Burgers equation. We find the ground state of this Hamiltonian using an adaptive optimization procedure to avoid barren plateaus. Here, we also apply this method to an adapted version of the single particle model with electrolyte (SPMe).
Recent advances in quantum computing and their increased availability has led to a growing interest in possible applications. Among those is the solution of partial differential equations (PDEs) for, e.g., material or flow simulation. Currently, the most promising route to useful deployment of quantum processors in the short to near term are so-called hybrid variational quantum algorithms (VQAs). Thus, variational methods for PDEs have been proposed as a candidate for quantum advantage in the noisy intermediate-scale quantum (NISQ) era. In this work, we conduct an extensive study of utilizing VQAs on real quantum devices to solve the simplest prototype of a PDE---the Poisson equation. Although results on noiseless simulators for small problem sizes may seem deceivingly promising, the performance on quantum computers is very poor. We argue that direct resolution of PDEs via an amplitude encoding of the solution is not a good use case within reach of today's quantum devices---especially when considering large system sizes and more complicated nonlinear PDEs that are required in order to be competitive with classical high-end solvers.
Differentiable quantum circuits (DQCs) [1] are variational algorithms to solve partial differential equations on quantum computers. We investigate the potential of this method to solve systems of coupled partial differential equations as they occur in the simulation of electrochemical systems, e.g., fuel cells and batteries. A crucial part of DQCs is the feature space in which the input variables are encoded into quantum states. Possible choices are a Chebyshev feature map or a Fourier feature map, that generate a set of corresponding basis functions to fit the desired model. We show results on the influence of different feature maps on the expressibility and trainability for spatiotemporal models, on the use case of transport equations from battery simulation. [1] Kyriienko, O. et al., Phys. Rev. A 2021, 103, 052416
Mathematical models of electrochemical systems such as batteries or fuel cells consist of sets of coupled nonlinear partial differential equations. We describe how variational quantum algorithms (VQAs) can be used to solve these equations on a quantum computer [1]. VQAs are hybrid quantum-classical algorithms, where a cost function is calculated on a quantum computer and its parameters are optimised classically. We present a spacetime representation, inspired by the Feynman--Kitaev Hamiltonian [2], where the solution to a PDE at all times is obtained by minimising just one function. [1] A.J. Pool, A.D. Somoza, C. Mc Keever, M. Lubasch, B. Horstmann, Phys. Rev. Res. 6 (2024), 3, 033257 [2] S. Barison, F. Vicentini, J.I. Cirac, G. Carleo, Phys. Rev. Res. 4 (2022), 4, 043161
Quantum computing has the potential to transform computational problem-solving by leveraging quantum mechanical principles of superposition and entanglement. This capability is particularly important for the numerical solution of complex and/or multidimensional partial differential equations (PDEs). There are currently many quantum techniques available for solving PDEs, which are mainly based on variational quantum algorithms (VQAs). However, the existing quantum PDE solvers, particularly those based on VQAs suffer from limitations such as low accuracy, high execution times, and low scalability on both simulators as well as on real quantum devices. 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 our proposed algorithm by solving several practically useful PDEs such as Poisson, heat, Black-Scholes, and Navier-Stokes equations. Our results demonstrate higher accuracy, higher scalability, and faster execution times compared to VQA-based solvers on noise-free and noisy quantum simulators from IBM and achieved promising results on real quantum hardware.
Numerical solvers for Partial Differential Equations (PDEs) are of great interest in various domains, e.g., in aerodynamics or for transport equations in lectrochemistry [1], and the need for fine-grained solutions of on-linear PDEs is growing. While subspace methods allow for a dimensionality reduction, non-linear PDEs require linearization schemes, such as the Carleman-linearization [2], resulting in linear systems of exponential dimensionality, operating on the limits of classical methods. Motivated by Krylov-subspace methods [3], which find approximate solutions in iteratively growing subspaces, the aim of this talk is to investigate the potential of two existing methods from quantum computing to compose a NISQ-era hybrid quantum-classical algorithm. Firstly, non-linear quantum computing (QNPUs) [4,5] and secondly Quantum Subspace Expansion (QSE) [6], both promising tools towards more scalable computations. The use of QNPUs enables linearization in a tensor-product-subspace using ancilla qubits, while offering efficient gate-based implementations. On the other hand, QSE measures high-dimensional overlaps on a quantum computer. The combination of these two methods yields the possibility of encapsulating the high-dimensional steps of linearization and subspace projection on a quantum device. As a result, only a lower-dimensional subspace problem remains to be solved on classical hardware.