🔢 mathematics

Quantum Simulation of Stokes Flow via Schrödingerisation and Artificial Compressibility

This paper proposes a quantum algorithm that combines Schrödingerisation with artificial compressibility to efficiently simulate high-dimensional incompressible Stokes flow, achieving an exponential speedup in problem dimensionality as validated by numerical simulations on Qiskit.

Original authors: Shi Jin, Jiaqi Tang, Qilong Zhai, Lei Zhang

Published 2026-07-02

📖 4 min read🧠 Deep dive

CC BY 4.0

Original authors: Shi Jin, Jiaqi Tang, Qilong Zhai, Lei Zhang

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). ✨ This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

Imagine you are trying to predict how honey flows through a complex maze of tiny pipes. In the real world, this is called Stokes flow, and it happens everywhere from oil moving through rock to blood flowing through capillaries. The math behind this is tricky because the fluid is "incompressible"—meaning you can't squeeze it, so if water goes in one side, it must come out the other side instantly.

In the world of classical computers, solving this "must go out" rule creates a massive headache. It's like trying to solve a giant puzzle where every single piece is locked to every other piece. As the maze gets bigger or more complex (higher dimensions), the time it takes a classical computer to solve it explodes, becoming practically impossible.

This paper proposes a clever new way to solve this puzzle using quantum computers. Here is the breakdown of their approach, explained simply:

1. The "Fake Stretch" Trick (Artificial Compressibility)

The biggest problem with the math is the "locked" rule that the fluid can't be squeezed. The authors use a classic trick called Artificial Compressibility.

The Analogy: Imagine the fluid is actually a very stiff sponge. In the real world, it's solid (incompressible). But for the math, they pretend it's slightly stretchy. This allows the pressure to "wiggle" and adjust itself over time rather than being locked in place instantly.
The Result: This turns the impossible "locked puzzle" into a dynamic system that evolves over time, which is much easier to simulate.

2. The "Shadow Puppet" Transformation (Schrödingerisation)

Even with the "stretchy" trick, the math is still too weird for a quantum computer. Quantum computers are great at simulating things that behave like waves (like light or electrons), but they struggle with the "dissipative" or "leaky" nature of fluid flow.

The Analogy: The authors use a technique called Schrödingerisation. Think of this as taking a flat, 2D shadow puppet show (the fluid equations) and projecting it onto a 3D wall. By adding an extra "dimension" (a hidden variable), they can transform the messy, leaky fluid equations into a perfect, clean wave equation.
The Magic: Once transformed, the problem looks exactly like a quantum wave. Now, the quantum computer can use its native superpowers to simulate the flow efficiently.

3. Building the Quantum Machine (The Circuit)

The paper doesn't just say "use a quantum computer"; they actually designed the specific blueprint (circuit) for it.

They broke the complex math down into tiny, manageable steps (like chopping a large vegetable into small dice).
They mapped these steps onto quantum gates (the switches of a quantum computer).
They proved that this blueprint works and that the errors stay small.

4. Why This Matters: The Speed Boost

The paper claims a massive advantage for high-dimensional problems (problems with many variables or dimensions).

The Analogy: If a classical computer is a person walking through a maze, checking every path one by one, a quantum computer using this method is like a ghost that can walk through all the walls at once.
The Claim: As the problem gets more complex (more dimensions), the classical computer slows down exponentially (it takes forever). The quantum computer, however, only slows down linearly (it stays fast). The authors claim this is an exponential speedup.

5. Did They Actually Do It?

Yes. They didn't just write theory; they ran simulations on Qiskit (a real quantum computing software platform).

They tested their "blueprint" on a simulated quantum computer.
They showed that the quantum simulation matched the known mathematical answers for fluid flow.
They checked how the error changes when they tweak the settings (like grid size or time steps) and confirmed the method is stable and accurate.

Summary

The authors took a notoriously difficult fluid dynamics problem, gave the fluid a little "fake stretch" to make it manageable, projected it into a higher dimension to make it look like a quantum wave, and built a specific quantum circuit to solve it. Their math shows that for complex, multi-dimensional flows, this method could be exponentially faster than anything classical computers can do today. They proved it works in simulation, paving the way for future use on real quantum hardware.

Technical Summary: Quantum Simulation of Stokes Flow via Schrödingerisation and Artificial Compressibility

Problem Statement
Simulating incompressible Stokes flow is critical for applications in microfluidics, low-Reynolds-number hydrodynamics, and porous media transport. However, classical numerical methods face a fundamental bottleneck: the saddle-point structure of the Stokes system requires exact satisfaction of the incompressibility constraint ( $\nabla \cdot u = 0$ ) at the discrete level. This coupling leads to large, ill-conditioned linear systems that are computationally expensive to solve, with resource requirements scaling prohibitively as the problem dimensionality increases. While classical regularization techniques like artificial compressibility exist, they remain computationally prohibitive in high-dimensional settings due to the exponential scaling of required resources.

Methodology
The authors propose a unified quantum algorithmic framework that addresses these challenges by integrating artificial compressibility with the Schrödingerisation technique.

Artificial Compressibility Regularization: The strict incompressibility condition is relaxed by introducing a pseudo-pressure evolution equation. Specifically, the continuity equation $\nabla \cdot u = 0$ is replaced with $\nabla \cdot u = \varepsilon p$ , where $\varepsilon$ is a small artificial compressibility parameter. This transforms the original saddle-point problem into a coupled initial-value problem involving the momentum equation and a parabolic pressure evolution equation. The authors provide error estimates demonstrating linear convergence ( $O(\varepsilon)$ ) of the regularized solution to the true incompressible solution.
Staggered-Grid Discretization: To ensure numerical stability and proper velocity-pressure coupling, the system is discretized using a staggered-grid finite volume method. This approach places velocity components and pressure at different nodal points, avoiding spurious oscillations common in collocated grids.
Schrödingerisation Mapping: The core innovation lies in mapping the resulting non-Hermitian, dissipative partial differential equations (PDEs) onto a unitary quantum system. By employing a "warped phase transformation" ( $w = e^{-q}u$ ) and a Fourier transform over the auxiliary variable $q$ , the authors embed the original dynamics into a higher-dimensional Hilbert space. This embedding converts the dissipative system into a Schrödinger-type equation ( $\partial_t \hat{v} = i H_{Stokes} \hat{v}$ ) with a Hermitian Hamiltonian $H_{Stokes}$ .
Quantum Circuit Construction: The authors design an explicit quantum circuit to simulate the time evolution operator $U_{Stokes}(\tau) = \exp(i H_{Stokes} \tau)$ .
- The Hamiltonian is decomposed using the first-order Lie-Trotter-Suzuki formula into elementary components.
- Finite difference operators (shift and Laplacian) are represented using binary encodings and shift operators ( $S_+, S_-$ ).
- The circuit utilizes Quantum Fourier Transforms (QFT) to switch between the auxiliary $q$ -space and the momentum $\eta$ -space, enabling the simulation of the non-unitary original dynamics via unitary quantum evolution.
- The solution is recovered via inverse QFT and projective measurement on the auxiliary variable subspace where $q > 0$ .

Key Contributions

Unified Framework: The paper presents the first explicit quantum algorithm for the Stokes equations that combines artificial compressibility with Schrödingerisation, providing a coherent formulation for the coupled velocity-pressure system.
Explicit Circuit Design: The authors derive a detailed quantum circuit implementation, including the decomposition of the Hamiltonian into elementary gates (CNOT, Hadamard, Phase, and multi-controlled rotation gates) and provide a rigorous gate count analysis.
Complexity Analysis: A rigorous complexity analysis establishes a theoretical quantum advantage. The authors demonstrate that for high-dimensional problems, the proposed method achieves an exponential speedup in problem dimensionality compared to classical methods. Specifically, while classical complexity scales as $O(\delta^{-(d+4)})$ under certain assumptions, the quantum approach avoids this exponential dependence on dimension $d$ .
Numerical Validation: The algorithm's validity and scalability are corroborated through numerical simulations performed on the Qiskit platform, including accuracy tests on benchmark problems and parameter convergence analyses.

Results
Numerical simulations on Qiskit validate the algorithm's accuracy. The authors tested the method on a coupled Stokes system with an analytic solution, demonstrating that the pointwise error decreases as the discretization parameters ( $n_x, n_q$ ) increase and the time step ($dt$) and artificial compressibility parameter ( $\varepsilon$ ) decrease. The results confirm the correctness of the differential operator discretization and the overall stability of the quantum circuit design.

Significance and Claims
The paper claims to offer a significant breakthrough in computational fluid dynamics by overcoming the dimensionality bottleneck inherent in classical Stokes flow simulations. By converting a non-unitary, saddle-point problem into a unitary quantum evolution, the method leverages the potential of quantum computing to solve high-dimensional fluid dynamics problems that are currently intractable for classical computers. The authors emphasize that their approach provides a "provable exponential speedup" in the problem dimensionality, making it a viable candidate for future applications in complex geometries and high-dimensional hydrodynamics. The work is positioned as a foundational step toward porting such algorithms to near-term quantum hardware and eventually extending the framework to the nonlinear Navier-Stokes equations.