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

Realizing Unstructured PDE Forecasting on Superconducting Quantum Processors

Erik Connerty, Jonathan Eastridge, Taylor L. Patti, Gerasimos Angelatos, Ethan N. Evans

Published Nov 7, 2026• 0 citations
arXivHTMLPDF

Abstract

Simulating high dimensional unstructured Partial Differential Equations (PDEs) with quantum processors is a major challenge with significant potential benefit. Existing methods have been demonstrated at small qubit counts, on simplifications of realistic problems. We implement a quantum reservoir network (QRN) for forecasting high-dimensional unstructured PDEs using up to 52 qubits on IBM superconducting hardware. Our method is gradient-free and does not suffer from the challenges of variational quantum algorithms. Instead, the QRN provides a large kernel space, up to 2^52 dimensions and beyond the reach of exact classical simulation, that remains useful under current hardware noise levels. Furthermore, a partial measure-and-reset mechanism enables total circuit runtime for ~24 times the qubit coherence time, so qubit lifetimes do not limit the forecast horizon. Thus, our method enables forecasting realistic unstructured nonlinear PDEs on quantum hardware. Typical difficulties associated with predicting large scale PDEs, such as transpilation, exponential shot requirements, hardware noise, and short qubit lifetimes are mitigated through careful design considerations and a dynamic observable reconstruction method. We validate our approach using a ~34k cell unstructured 2D cylinder flow at Reynolds number 1000 and a challenging nonlinear Gray--Scott reaction--diffusion problem, demonstrating high fidelity prediction on CUDA-Q simulation and on 26 and 52-qubit superconducting quantum processors. Specifically, we show that adding QRN features to an autoencoder linear prediction pipeline reduces prediction error by 21%-43%. Finally, we demonstrate closed-loop autoregressive PDE forecasting on these problems. This work demonstrates, for the first time, quantum circuits with depth beyond qubit lifetimes achieving accurate unstructured mesh forecasting on highly nonlinear PDEs.

DOI
10.48550/arxiv.2611.10351

Related papers

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

Predicting chaotic dynamics on NISQ hardware with quantum reservoir networks

Erik Connerty, Ethan N. Evans, Gerasimos Angelatos +1 more

Abstract Recent advances in artificial intelligence have highlighted the remarkable capabilities of neural network (NN)-powered systems on classical computers. However, these systems face significant computational challenges that limit scalability and efficiency. Here, we propose a quantum reservoir network (QRN) algorithm for prediction and reconstruction of dynamical systems with current quantum hardware. This is developed from the recent NISQRC framework to imbue quantum circuits with a practical fading memory, and we demonstrate its effectiveness on an IBM quantum processor. We apply classical control-theoretic response analysis to characterize the QRN, emphasizing its rich nonlinear dynamics and memory, as well as its ability to be fine-tuned with sparsity and re-uploading blocks. Noisy and noiseless simulations, as well as IBM hardware experiments, demonstrate the capability of our QRN to reconstruct unknown latent variables of the Lorenz system at future timesteps. Our results show that the QRN can operate with persistent memory for over 100 times longer than the median $${{{{\mathcal{T}}}}}_{1}$$ T 1 and $${{{{\mathcal{T}}}}}_{2}$$ T 2 of the QPU, achieving state-of-the-art time-series performance on IBM hardware.

arXiv:2505.06799•Communications Physics•May 4, 2026•4 citations

Bridging quantum and classical computing for partial differential equations through multifidelity machine learning

Bruno Jacob, Amanda A. Howard, Panos Stinis

Quantum algorithms for partial differential equations (PDEs) face severe practical constraints on near-term hardware: limited qubit counts restrict spatial resolution to coarse grids, while circuit depth limitations prevent accurate long-time integration. These hardware bottlenecks confine quantum PDE solvers to low-fidelity regimes despite their theoretical potential for computational speedup. We introduce a multifidelity learning framework that corrects coarse quantum solutions to high-fidelity accuracy using sparse classical training data, facilitating the path toward practical quantum utility for scientific computing. The approach trains a low-fidelity surrogate on abundant quantum solver outputs, then learns correction mappings through a multifidelity neural architecture that balances linear and nonlinear transformations. Demonstrated on benchmark nonlinear PDEs including viscous Burgers equation and incompressible Navier-Stokes flows via quantum lattice Boltzmann methods, the framework successfully corrects coarse quantum predictions and achieves temporal extrapolation well beyond the classical training window. This strategy illustrates how one can reduce expensive high-fidelity simulation requirements while producing predictions that are competitive with classical accuracy. By bridging the gap between hardware-limited quantum simulations and application requirements, this work establishes a pathway for extracting computational value from current quantum devices in real-world scientific applications, advancing both algorithm development and practical deployment of near-term quantum computing for computational physics.

cs.LGCross-listedarXiv:2512.05241•Dec 8, 2025•2 citations

Quantum variational solving of nonlinear and multidimensional partial differential equations

Abhijat Sarma, Thomas W. Watts, Mudassir Moosa +2 more

A variational quantum algorithm for numerically solving partial differential equations (PDEs) on a quantum computer was proposed by Lubasch et al. [Phys. Rev. A 101, 010301(R) (2020)]. In this paper we generalize the method introduced by Lubasch et al. to cover a broader class of nonlinear PDEs as well as multidimensional PDEs and study the performance of the variational quantum algorithm on several example equations. Specifically, we show via numerical simulations that the algorithm can solve instances of the single-asset Black-Scholes equation with a nontrivial nonlinear volatility model, the double-asset Black-Scholes equation, the Buckmaster equation, and the deterministic Kardar-Parisi-Zhang equation. Our simulations use up to $n=12$ Ansatz qubits, computing PDE solutions with ${2}^{n}$ grid points. We also perform proof-of-concept demonstrations with a trapped-ion quantum processor from IonQ [Nat. Commun. 10, 5464 (2019)], showing accurate computation of two representative expectation values needed for the calculation of a single time step of the nonlinear Black-Scholes equation. Through our classical simulations and demonstrations on quantum hardware, we identify and discuss several open challenges for using quantum variational methods to solve PDEs in a regime with a large number (much greater than ${2}^{20}$) of grid points, but also a practical number of gates per circuit and circuit shots.

arXiv:2311.01531•Physical Review A•Jun 21, 2024•52 citations

Leveraging Metrologically Useful States in Quantum Reservoir Networks

Erik L. Connerty, Margarite LaBorde, Ethan N. Evans

Interest in using quantum computers for the purpose of predicting chaotic partial differential equations (PDEs) has been growing with the advent of newer low-error quantum computers and robust simulation tools. In this paper, we present a method that utilizes a quantum reservoir network (QRN) to predict latent space representations of the high-dimensional chaotic 1-D Kuramoto-Sivashinksy (KS) system. This hybrid approach takes advantage of advancements in classical machine learning (ML) through the use of a classical autoencoder as well as techniques from quantum metrology through the use of a unitary that creates metrologically-useful states. Through rigorous simulation and analysis, we show that the proposed method outperforms alternative QRN implementations without this metrologically-useful state preparation, and also show better performance than classical echo-state networks when weight regularization is not used. Finally, we bring to light potential issues that can arise when using autoencoders within QRC pipelines.

quant-pharXiv:2607.06500•Jul 8, 2026•1 citation

Time evolution of nonlinear dynamics on a quantum processor

José Diogo da Costa Jesus, Abhishek Setty, Tommaso Calarco +3 more

From fluid flow and transport to collective dynamics, numerical simulation of nonlinear partial differential equations underpins modern scientific computing. Extending this capability to quantum computers remains a longstanding challenge because nonlinear and non-Hermitian evolution is fundamentally incompatible with conventional Hamiltonian-based quantum simulation. Here we experimentally realize the time evolution of nonlinear fluid dynamics on a quantum processor using a hybrid variational framework for the viscous and inviscid Burgers equations. Our approach directly encodes the nonlinear dynamics into a variational optimization procedure, avoiding the enlarged linear embeddings and truncation overhead associated with Carleman linearization-based quantum algorithms. We further demonstrate convection-dominated dynamics corresponding to Reynolds numbers of order $10^2$. We encode the governing evolution into parametrized quantum circuits and iteratively reconstruct the time-dependent field through quantum-classical optimization. By introducing a zero-noise extrapolation method without additional circuit-folding overhead, we accurately execute deep error-circuits with entangling-gate counts beyond those typical of Hadamard test circuits. We accurately reconstruct the time evolution across multiple timesteps despite hardware noise and finite device coherence. Our results constitute, to our knowledge, the first experimental realization of nonlinear time propagation on a quantum processor, extending quantum simulation beyond predominantly linear settings and establishing a route toward quantum computation for nonlinear continuum dynamics.

quant-pharXiv:2608.13041•Aug 14, 2026•3 citations
Simulating high dimensional unstructured Partial Differential Equations (PDEs) with quantum processors is a major challenge with significant potential benefit. Existing methods have been demonstrated at small qubit counts, on simplifications of realistic problems. We implement a quantum reservoir network (QRN) for forecasting high-dimensional unstructured PDEs using up to 52 qubits on IBM superconducting hardware. Our method is gradient-free and does not suffer from the challenges of variational quantum algorithms. Instead, the QRN provides a large kernel space, up to 2^52 dimensions and beyond the reach of exact classical simulation, that remains useful under current hardware noise levels. Furthermore, a partial measure-and-reset mechanism enables total circuit runtime for ~24 times the qubit coherence time, so qubit lifetimes do not limit the forecast horizon. Thus, our method enables forecasting realistic unstructured nonlinear PDEs on quantum hardware. Typical difficulties associated with predicting large scale PDEs, such as transpilation, exponential shot requirements, hardware noise, and short qubit lifetimes are mitigated through careful design considerations and a dynamic observable reconstruction method. We validate our approach using a ~34k cell unstructured 2D cylinder flow at Reynolds number 1000 and a challenging nonlinear Gray--Scott reaction--diffusion problem, demonstrating high fidelity prediction on CUDA-Q simulation and on 26 and 52-qubit superconducting quantum processors. Specifically, we show that adding QRN features to an autoencoder linear prediction pipeline reduces prediction error by 21%-43%. Finally, we demonstrate closed-loop autoregressive PDE forecasting on these problems. This work demonstrates, for the first time, quantum circuits with depth beyond qubit lifetimes achieving accurate unstructured mesh forecasting on highly nonlinear PDEs.
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.
Abstract Recent advances in artificial intelligence have highlighted the remarkable capabilities of neural network (NN)-powered systems on classical computers. However, these systems face significant computational challenges that limit scalability and efficiency. Here, we propose a quantum reservoir network (QRN) algorithm for prediction and reconstruction of dynamical systems with current quantum hardware. This is developed from the recent NISQRC framework to imbue quantum circuits with a practical fading memory, and we demonstrate its effectiveness on an IBM quantum processor. We apply classical control-theoretic response analysis to characterize the QRN, emphasizing its rich nonlinear dynamics and memory, as well as its ability to be fine-tuned with sparsity and re-uploading blocks. Noisy and noiseless simulations, as well as IBM hardware experiments, demonstrate the capability of our QRN to reconstruct unknown latent variables of the Lorenz system at future timesteps. Our results show that the QRN can operate with persistent memory for over 100 times longer than the median T1{{{{\mathcal{T}}}}}_{1}T1​ T 1 and T2{{{{\mathcal{T}}}}}_{2}T2​ T 2 of the QPU, achieving state-of-the-art time-series performance on IBM hardware.
Quantum algorithms for partial differential equations (PDEs) face severe practical constraints on near-term hardware: limited qubit counts restrict spatial resolution to coarse grids, while circuit depth limitations prevent accurate long-time integration. These hardware bottlenecks confine quantum PDE solvers to low-fidelity regimes despite their theoretical potential for computational speedup. We introduce a multifidelity learning framework that corrects coarse quantum solutions to high-fidelity accuracy using sparse classical training data, facilitating the path toward practical quantum utility for scientific computing. The approach trains a low-fidelity surrogate on abundant quantum solver outputs, then learns correction mappings through a multifidelity neural architecture that balances linear and nonlinear transformations. Demonstrated on benchmark nonlinear PDEs including viscous Burgers equation and incompressible Navier-Stokes flows via quantum lattice Boltzmann methods, the framework successfully corrects coarse quantum predictions and achieves temporal extrapolation well beyond the classical training window. This strategy illustrates how one can reduce expensive high-fidelity simulation requirements while producing predictions that are competitive with classical accuracy. By bridging the gap between hardware-limited quantum simulations and application requirements, this work establishes a pathway for extracting computational value from current quantum devices in real-world scientific applications, advancing both algorithm development and practical deployment of near-term quantum computing for computational physics.
A variational quantum algorithm for numerically solving partial differential equations (PDEs) on a quantum computer was proposed by Lubasch et al. [Phys. Rev. A 101, 010301(R) (2020)]. In this paper we generalize the method introduced by Lubasch et al. to cover a broader class of nonlinear PDEs as well as multidimensional PDEs and study the performance of the variational quantum algorithm on several example equations. Specifically, we show via numerical simulations that the algorithm can solve instances of the single-asset Black-Scholes equation with a nontrivial nonlinear volatility model, the double-asset Black-Scholes equation, the Buckmaster equation, and the deterministic Kardar-Parisi-Zhang equation. Our simulations use up to n=12n=12n=12 Ansatz qubits, computing PDE solutions with 2n{2}^{n}2n grid points. We also perform proof-of-concept demonstrations with a trapped-ion quantum processor from IonQ [Nat. Commun. 10, 5464 (2019)], showing accurate computation of two representative expectation values needed for the calculation of a single time step of the nonlinear Black-Scholes equation. Through our classical simulations and demonstrations on quantum hardware, we identify and discuss several open challenges for using quantum variational methods to solve PDEs in a regime with a large number (much greater than 220{2}^{20}220) of grid points, but also a practical number of gates per circuit and circuit shots.
Interest in using quantum computers for the purpose of predicting chaotic partial differential equations (PDEs) has been growing with the advent of newer low-error quantum computers and robust simulation tools. In this paper, we present a method that utilizes a quantum reservoir network (QRN) to predict latent space representations of the high-dimensional chaotic 1-D Kuramoto-Sivashinksy (KS) system. This hybrid approach takes advantage of advancements in classical machine learning (ML) through the use of a classical autoencoder as well as techniques from quantum metrology through the use of a unitary that creates metrologically-useful states. Through rigorous simulation and analysis, we show that the proposed method outperforms alternative QRN implementations without this metrologically-useful state preparation, and also show better performance than classical echo-state networks when weight regularization is not used. Finally, we bring to light potential issues that can arise when using autoencoders within QRC pipelines.
From fluid flow and transport to collective dynamics, numerical simulation of nonlinear partial differential equations underpins modern scientific computing. Extending this capability to quantum computers remains a longstanding challenge because nonlinear and non-Hermitian evolution is fundamentally incompatible with conventional Hamiltonian-based quantum simulation. Here we experimentally realize the time evolution of nonlinear fluid dynamics on a quantum processor using a hybrid variational framework for the viscous and inviscid Burgers equations. Our approach directly encodes the nonlinear dynamics into a variational optimization procedure, avoiding the enlarged linear embeddings and truncation overhead associated with Carleman linearization-based quantum algorithms. We further demonstrate convection-dominated dynamics corresponding to Reynolds numbers of order 10210^2102. We encode the governing evolution into parametrized quantum circuits and iteratively reconstruct the time-dependent field through quantum-classical optimization. By introducing a zero-noise extrapolation method without additional circuit-folding overhead, we accurately execute deep error-circuits with entangling-gate counts beyond those typical of Hadamard test circuits. We accurately reconstruct the time evolution across multiple timesteps despite hardware noise and finite device coherence. Our results constitute, to our knowledge, the first experimental realization of nonlinear time propagation on a quantum processor, extending quantum simulation beyond predominantly linear settings and establishing a route toward quantum computation for nonlinear continuum dynamics.