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

ADVANCES IN GEO-ENERGY RESEARCH

Coupled simulation of pressure and saturation in water flooding using a quantum linear system solver

Li Xu, Yahong Xiang, Ming Li, Lei Zhang, Cunqi Jia

Published Aug 10, 2026• 0 citations
Publisher

Abstract

Sequential water flood simulation alternates implicit pressure solves with explicit saturation updates. This study examines, under ideal statevector access, how a solution state produced by the Harrow‑Hassidim‑Lloyd quantum linear system algorithm can be inserted into that sequential workflow for a two‑phase model in one dimension. The evolving pressure systems are preconditioned from the left using rebuilt sparse approximate inverses, converted by Hermitian block dilation, and treated with signed phase estimation at finite resolution. The formulation also identifies the classical normalization, sign recovery, and complete field readout operations required before a solution state can drive the transport update. Steady and transient component tests precede coupled calculations on three successively refined grids. Across these grids, the statevector and direct pressure solutions remain closely aligned in direction, while the finest grid saturation trajectories show the largest difference and the statevector branch reaches the imposed upper saturation bound. Each plotted statevector pressure is aligned by a global scalar with the exact solution of its current dilated system, so the results assess algebraic data exchange rather than an independent reconstruction of physical pressure. A separate pilot covering five steps finds similar directional agreement between pressure solutions when a right sparse approximate inverse is rebuilt or updated using a sparse approximate map, but the combined setup problem. The results show that close directional agreement between pressure solutions does not by itself guarantee accurate saturation transport and thus provide a reference point for assessing such solvers in sequential reservoir simulation. All calculations use ideal statevectors; no quantum hardware, speedup of the complete workflow, or hardware advantage is demonstrated. Document Type: Original article Cited as:Xu, L., Xiang, Y., Li, M., Zhang, L., Jia, C. Coupled simulation of pressure and saturation in water flooding using a quantum linear system solver. Advances in Geo‑Energy Research, 2026, 21(3): 220‑237. https://doi.org/10.46690/ager.2026.09.03

DOI
10.46690/ager.2026.09.03

Related papers

The First Application of Quantum Computing Algorithm in Streamline-Based Simulation of Water-Flooding Reservoirs

Xiang Rao

Abstract Though generic quantum computers are not yet available, we have access to the Noisy Intermediate-Scale Quantum (NISQ) era. The advent of variational quantum algorithms has opened doors for quantum computing in science and engineering during the NISQ era. This study integrates the quantum algorithm with classical streamline methods for efficient, high-precision simulation of two-phase flows, aiming to inform future quantum computing-based reservoir simulation technologies. We employ the variational quantum algorithm to solve the linearized finite volume discrete pressure equations. This process involves decomposing the coefficient matrix of the linear equations using the Pauli basis and preparing the quantum state of the coefficient vector through a unitary operation. A parameterized hardware-efficient ansatz is then constructed, and the quantum circuit’s output (i.e., the cost function value) is obtained via the Hadamard Test. Classical optimizer minimizes the cost function, updating the ansatz parameters to solve the pressure equations. Streamline distribution across the computational domain and time of flight distribution along each streamline are rapidly derived, with water saturation distribution calculated using a high order weighted essentially non-oscillatory (WENO) scheme on each streamline. This results in an integrated workflow combining quantum computing, streamline tracking, and high-order numerical methods. We tested three cases, including homogeneous reservoirs, heterogeneous reservoirs, and multi-well injection and production scenarios. Xanadu’s Pennylane open-source library was used to implement the variational quantum algorithm for computing pressure distribution. The results show that this variational quantum algorithm can achieve high-precision calculation of pressure distribution within fewer optimization steps, with relative computational errors all within 1%. Based on the streamline distribution obtained from tracking, the WENO scheme on the streamlines reduces the numerical dispersion error of the calculated saturation distribution compared to the upwind finite difference scheme, thereby further improving the computational resolution of the waterflooding front. This work pioneers a hybrid quantum-classical workflow for streamline-based reservoir simulation, showcasing its potential for accuracy, efficiency, and robustness in two-phase flow simulations across various reservoir types, paving the way for future quantum computing-based general-purpose reservoir simulators.

Abu Dhabi International Petroleum Exhibition & Conference (ADIPEC)•Nov 3, 2024•10 citations

An HHL-Based Quantum-Classical Solver for the Incompressible Navier-Stokes Equations with Approximate QST

Moshe Inger, Steven Frankel

In computational fluid dynamics (CFD), the numerical integration of the Navier-Stokes equations is frequently constrained by the Poisson equation to determine the pressure. Discretization of this equation often results in the need to solve a system of linear algebraic equations. This step typically represents the primary computational bottleneck. Quantum linear system algorithms such as Harrow-Hassidim-Lloyd (HHL) offer the potential for exponential speedups for solving sparse linear systems, such as those that arise from the discretized Poisson equation. In this work, we successfully couple HHL to a discretized formulation of the incompressible Navier-Stokes equations and demonstrate both accurate lid-driven cavity flow simulations as a fully integrated benchmark problem, and accurate flow of the Taylor-Green vortex. To address the readout limitation, we utilize a recent novel quantum state tomography (QST) approach based on Chebyshev polynomials and Quantum Amplitude Estimation (QAE), which enables approximate statevector extraction without full state reconstruction. Together, these results clarify the algorithmic structure required for quantum CFD, explicitly confront the measurement bottleneck, and establish benchmark problems for future quantum fluid simulations. We implement the solver using IBM's Qiskit framework and validate the hybrid quantum-classical simulation against standard classical numerical methods. Our results demonstrate that the hybrid solver successfully captures the global vortex dynamics of the lid-driven cavity problem and the Taylor-Green vortex, offering a robust pathway for integrating quantum subroutines into more practical higher-Reynolds number CFD workflows.

quant-pharXiv:2603.18222•Mar 20, 2026•0 citations

Integrating quantum algorithms into classical frameworks: a predictor–corrector approach using HHL

Omer Rathore, Alastair G. Basden, Nicholas Chancellor +1 more

Abstract The application of quantum algorithms to classical problems is generally accompanied by significant bottlenecks when transferring data between quantum and classical states, often negating any intrinsic quantum advantage. Here we address this challenge for a well-known algorithm for linear systems of equations, originally proposed by Harrow, Hassidim and Lloyd (HHL), by adapting it into a predictor–corrector instead of a direct solver. Rather than seeking the solution at the next time step, the goal now becomes determining the change between time steps. This strategy enables the intelligent omission of computationally costly steps commonly found in many classical algorithms, while simultaneously mitigating the notorious readout problems associated with extracting solutions from a quantum state. Random or regularly performed skips instead lead to simulation failure. We demonstrate that our methodology secures a useful polynomial advantage over a conventional application of the HHL algorithm. The practicality and versatility of the approach are illustrated through applications in various fields such as smoothed particle hydrodynamics, plasma simulations, and reactive flow configurations. Moreover, the proposed algorithm is well suited to run asynchronously on future heterogeneous hardware infrastructures and can effectively leverage the synergistic strengths of classical as well as quantum compute resources.

arXiv:2406.19996•Quantum Science and Technology•Feb 27, 2025•5 citations

Quantum HHL Algorithm for Solving 1D Linear Advection Equation Using Explicit and Implicit Finite Difference Schemes

Batuhan Yalcin, Lucy Zhang

This study develops and implements a Harrow-Hassidim-Lloyd (HHL) quantum algorithm for solving a one-dimensional linear advection equation with periodic boundary conditions. The governing equation is first discretized using a classical finite difference (FD) scheme to obtain a linear system suitable for quantum solution. We present a newly designed, circuit-level implementation of HHL assembled from Qiskit circuit components and exploit the circulant structure of the periodic discretization matrices through Fourier-based matrix evolution. The HHL algorithm is benchmarked with three explicit schemes and one implicit scheme. The implicit scheme requires a nontrivial linear solve arising from the discretized PDE on progressively finer grids, whereas the explicit schemes provide different input fields for testing state preparation and reconstruction with identity coefficient matrices. HHL solution states are validated against direct classical solves in noiseless simulation. For hardware execution, the periodic matrix structure permits a Fourier implementation that applies reciprocal eigenvalues without phase estimation. Results on the IBM Rensselaer Nighthawk processor are compared at a shared final time. Noiseless reconstructed fields approach the transported profile on resolved grids, while substantial hardware errors remain for both explicit and implicit schemes. Crank-Nicolson remains exceptionally well-conditioned and utilizes similar circuit re sources to the explicit controls, proving that hardware degradation in our tests was not driven by poor matrix conditioning. Ultimately, this study shows new means for HHL algorithms to study quantum CFD problems involving advection equations with implicit time integrations, while demonstrating how state preparation and measurement affect the practical performance of quantum solvers on current devices.

arXiv:2611.01167•Oct 31, 2026•0 citations

A Hybrid Quantum-Classical Coarse-to-Fine Finite Element Solver for Heterogeneous Darcy Flow

Kapil Chawla, Sanghyun Lee, Jonathan Valyou

Quantum linear system algorithms offer theoretical potential for solving large sparse systems from PDE discretizations. However, applying them directly to fine-scale problems remains impractical on near-term hardware because of limited qubits, restricted circuit depth, and noise. They also prepare a quantum state rather than solution coefficients, whose recovery requires measurement and reconstruction. In this work, we develop a hybrid quantum-classical coarse-to-fine finite element framework for heterogeneous Darcy flow. We investigate whether a measured quantum coarse solution improves fine-grid initialization and reduces subsequent classical solver work. Rather than solve the full fine-scale system on a quantum device, we apply a method inspired by the Variational Quantum Linear Solver (VQLS) to the Galerkin coarse system. We reconstruct the approximate coarse solution from measurements, prolongate it to the fine grid, and use it to initialize a classical preconditioned iterative solve.} Numerical experiments on steady heterogeneous Darcy flow and a time-dependent SPE10-based problem show that measured quantum coarse solutions can improve fine-grid initialization, while classical correction recovers accurate pressure fields. The effect on classical solver iterations depends on the problem. All quantum computations were simulated using Qiskit Aer.

arXiv:2611.09593•Nov 6, 2026•0 citations

Quantum Computing Implementation for Solving Pressure Equations in Reservoir Numerical Simulation

X. Rao

Summary In the current noisy intermediate-scale quantum (NISQ) era, the variational quantum algorithm (VQA) opens the door to introducing quantum computing into geosciences. Therefore, this paper will study the application effect of VQA in solving the pressure equations in reservoir flow problems for the first time and provide a reference for constructing standardized field-scale quantum algorithms for reservoir numerical simulation in the future. We first obtain the linearized discrete pressure equations using the standard finite volume procedure, and then use the variational quantum linear solver (VQLS) to solve the discrete equations to obtain the pressure distribution in the reservoir domain. Besides, we propose two practical strategies to reduce the complexity of preparing the quantum state corresponding to the coefficient vector of the pressure equations. Xanadu’s Pennylane open-source library is adopted to implement the hybrid quantum computing procedure of this study. A toy case is given to illustrate the technical detail and the computational performance of the quantum computing procedure. The results show that the workflow can obtain high-accuracy reservoir pressure distribution and the strategies can accelerate the optimization convergence speed to achieve more accurate solutions in the same number of optimization steps.

EAGE Asia Pacific Meeting on Near Surface Geoscience & Engineering•Jan 1, 2024•1 citation
Sequential water flood simulation alternates implicit pressure solves with explicit saturation updates. This study examines, under ideal statevector access, how a solution state produced by the Harrow‑Hassidim‑Lloyd quantum linear system algorithm can be inserted into that sequential workflow for a two‑phase model in one dimension. The evolving pressure systems are preconditioned from the left using rebuilt sparse approximate inverses, converted by Hermitian block dilation, and treated with signed phase estimation at finite resolution. The formulation also identifies the classical normalization, sign recovery, and complete field readout operations required before a solution state can drive the transport update. Steady and transient component tests precede coupled calculations on three successively refined grids. Across these grids, the statevector and direct pressure solutions remain closely aligned in direction, while the finest grid saturation trajectories show the largest difference and the statevector branch reaches the imposed upper saturation bound. Each plotted statevector pressure is aligned by a global scalar with the exact solution of its current dilated system, so the results assess algebraic data exchange rather than an independent reconstruction of physical pressure. A separate pilot covering five steps finds similar directional agreement between pressure solutions when a right sparse approximate inverse is rebuilt or updated using a sparse approximate map, but the combined setup problem. The results show that close directional agreement between pressure solutions does not by itself guarantee accurate saturation transport and thus provide a reference point for assessing such solvers in sequential reservoir simulation. All calculations use ideal statevectors; no quantum hardware, speedup of the complete workflow, or hardware advantage is demonstrated. Document Type: Original article Cited as:Xu, L., Xiang, Y., Li, M., Zhang, L., Jia, C. Coupled simulation of pressure and saturation in water flooding using a quantum linear system solver. Advances in Geo‑Energy Research, 2026, 21(3): 220‑237. https://doi.org/10.46690/ager.2026.09.03
Abstract Though generic quantum computers are not yet available, we have access to the Noisy Intermediate-Scale Quantum (NISQ) era. The advent of variational quantum algorithms has opened doors for quantum computing in science and engineering during the NISQ era. This study integrates the quantum algorithm with classical streamline methods for efficient, high-precision simulation of two-phase flows, aiming to inform future quantum computing-based reservoir simulation technologies. We employ the variational quantum algorithm to solve the linearized finite volume discrete pressure equations. This process involves decomposing the coefficient matrix of the linear equations using the Pauli basis and preparing the quantum state of the coefficient vector through a unitary operation. A parameterized hardware-efficient ansatz is then constructed, and the quantum circuit’s output (i.e., the cost function value) is obtained via the Hadamard Test. Classical optimizer minimizes the cost function, updating the ansatz parameters to solve the pressure equations. Streamline distribution across the computational domain and time of flight distribution along each streamline are rapidly derived, with water saturation distribution calculated using a high order weighted essentially non-oscillatory (WENO) scheme on each streamline. This results in an integrated workflow combining quantum computing, streamline tracking, and high-order numerical methods. We tested three cases, including homogeneous reservoirs, heterogeneous reservoirs, and multi-well injection and production scenarios. Xanadu’s Pennylane open-source library was used to implement the variational quantum algorithm for computing pressure distribution. The results show that this variational quantum algorithm can achieve high-precision calculation of pressure distribution within fewer optimization steps, with relative computational errors all within 1%. Based on the streamline distribution obtained from tracking, the WENO scheme on the streamlines reduces the numerical dispersion error of the calculated saturation distribution compared to the upwind finite difference scheme, thereby further improving the computational resolution of the waterflooding front. This work pioneers a hybrid quantum-classical workflow for streamline-based reservoir simulation, showcasing its potential for accuracy, efficiency, and robustness in two-phase flow simulations across various reservoir types, paving the way for future quantum computing-based general-purpose reservoir simulators.
In computational fluid dynamics (CFD), the numerical integration of the Navier-Stokes equations is frequently constrained by the Poisson equation to determine the pressure. Discretization of this equation often results in the need to solve a system of linear algebraic equations. This step typically represents the primary computational bottleneck. Quantum linear system algorithms such as Harrow-Hassidim-Lloyd (HHL) offer the potential for exponential speedups for solving sparse linear systems, such as those that arise from the discretized Poisson equation. In this work, we successfully couple HHL to a discretized formulation of the incompressible Navier-Stokes equations and demonstrate both accurate lid-driven cavity flow simulations as a fully integrated benchmark problem, and accurate flow of the Taylor-Green vortex. To address the readout limitation, we utilize a recent novel quantum state tomography (QST) approach based on Chebyshev polynomials and Quantum Amplitude Estimation (QAE), which enables approximate statevector extraction without full state reconstruction. Together, these results clarify the algorithmic structure required for quantum CFD, explicitly confront the measurement bottleneck, and establish benchmark problems for future quantum fluid simulations. We implement the solver using IBM's Qiskit framework and validate the hybrid quantum-classical simulation against standard classical numerical methods. Our results demonstrate that the hybrid solver successfully captures the global vortex dynamics of the lid-driven cavity problem and the Taylor-Green vortex, offering a robust pathway for integrating quantum subroutines into more practical higher-Reynolds number CFD workflows.
Abstract The application of quantum algorithms to classical problems is generally accompanied by significant bottlenecks when transferring data between quantum and classical states, often negating any intrinsic quantum advantage. Here we address this challenge for a well-known algorithm for linear systems of equations, originally proposed by Harrow, Hassidim and Lloyd (HHL), by adapting it into a predictor–corrector instead of a direct solver. Rather than seeking the solution at the next time step, the goal now becomes determining the change between time steps. This strategy enables the intelligent omission of computationally costly steps commonly found in many classical algorithms, while simultaneously mitigating the notorious readout problems associated with extracting solutions from a quantum state. Random or regularly performed skips instead lead to simulation failure. We demonstrate that our methodology secures a useful polynomial advantage over a conventional application of the HHL algorithm. The practicality and versatility of the approach are illustrated through applications in various fields such as smoothed particle hydrodynamics, plasma simulations, and reactive flow configurations. Moreover, the proposed algorithm is well suited to run asynchronously on future heterogeneous hardware infrastructures and can effectively leverage the synergistic strengths of classical as well as quantum compute resources.
This study develops and implements a Harrow-Hassidim-Lloyd (HHL) quantum algorithm for solving a one-dimensional linear advection equation with periodic boundary conditions. The governing equation is first discretized using a classical finite difference (FD) scheme to obtain a linear system suitable for quantum solution. We present a newly designed, circuit-level implementation of HHL assembled from Qiskit circuit components and exploit the circulant structure of the periodic discretization matrices through Fourier-based matrix evolution. The HHL algorithm is benchmarked with three explicit schemes and one implicit scheme. The implicit scheme requires a nontrivial linear solve arising from the discretized PDE on progressively finer grids, whereas the explicit schemes provide different input fields for testing state preparation and reconstruction with identity coefficient matrices. HHL solution states are validated against direct classical solves in noiseless simulation. For hardware execution, the periodic matrix structure permits a Fourier implementation that applies reciprocal eigenvalues without phase estimation. Results on the IBM Rensselaer Nighthawk processor are compared at a shared final time. Noiseless reconstructed fields approach the transported profile on resolved grids, while substantial hardware errors remain for both explicit and implicit schemes. Crank-Nicolson remains exceptionally well-conditioned and utilizes similar circuit re sources to the explicit controls, proving that hardware degradation in our tests was not driven by poor matrix conditioning. Ultimately, this study shows new means for HHL algorithms to study quantum CFD problems involving advection equations with implicit time integrations, while demonstrating how state preparation and measurement affect the practical performance of quantum solvers on current devices.
Quantum linear system algorithms offer theoretical potential for solving large sparse systems from PDE discretizations. However, applying them directly to fine-scale problems remains impractical on near-term hardware because of limited qubits, restricted circuit depth, and noise. They also prepare a quantum state rather than solution coefficients, whose recovery requires measurement and reconstruction. In this work, we develop a hybrid quantum-classical coarse-to-fine finite element framework for heterogeneous Darcy flow. We investigate whether a measured quantum coarse solution improves fine-grid initialization and reduces subsequent classical solver work. Rather than solve the full fine-scale system on a quantum device, we apply a method inspired by the Variational Quantum Linear Solver (VQLS) to the Galerkin coarse system. We reconstruct the approximate coarse solution from measurements, prolongate it to the fine grid, and use it to initialize a classical preconditioned iterative solve.} Numerical experiments on steady heterogeneous Darcy flow and a time-dependent SPE10-based problem show that measured quantum coarse solutions can improve fine-grid initialization, while classical correction recovers accurate pressure fields. The effect on classical solver iterations depends on the problem. All quantum computations were simulated using Qiskit Aer.
Summary In the current noisy intermediate-scale quantum (NISQ) era, the variational quantum algorithm (VQA) opens the door to introducing quantum computing into geosciences. Therefore, this paper will study the application effect of VQA in solving the pressure equations in reservoir flow problems for the first time and provide a reference for constructing standardized field-scale quantum algorithms for reservoir numerical simulation in the future. We first obtain the linearized discrete pressure equations using the standard finite volume procedure, and then use the variational quantum linear solver (VQLS) to solve the discrete equations to obtain the pressure distribution in the reservoir domain. Besides, we propose two practical strategies to reduce the complexity of preparing the quantum state corresponding to the coefficient vector of the pressure equations. Xanadu’s Pennylane open-source library is adopted to implement the hybrid quantum computing procedure of this study. A toy case is given to illustrate the technical detail and the computational performance of the quantum computing procedure. The results show that the workflow can obtain high-accuracy reservoir pressure distribution and the strategies can accelerate the optimization convergence speed to achieve more accurate solutions in the same number of optimization steps.