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:2606.30447 · Computer Methods in Applied Mechanics and Engineering

A quantum spectral solver for periodic incompressible Stokes flow

Juan M. Gimenez, Fehmi Cirak, Michael Ortiz

Published Sep 29, 2026• 1 citation
arXivHTMLPDF

Abstract

We present a quantum spectral solver for the steady incompressible Stokes equations on a two-dimensional periodic domain. The method uses the Quantum Fourier Transform as a coherent change of basis and exploits the resulting spectral structure of the Stokes operator: the Laplacian becomes diagonal, while incompressibility is enforced mode by mode through a Helmholtz projection. In two dimensions, this projection is realized by a mode-dependent rotation from Cartesian velocity components to longitudinal–transverse coordinates, followed by component-conditioned inverse-Laplacian scaling. The velocity and pressure fields are encoded as quantum states over Fourier modes and physical components, and the corresponding spectral factors are implemented through polynomially encoded amplitude blocks. The construction extends recent quantum spectral methods in computational mechanics to an incompressible flow operator with explicit pressure–velocity splitting and divergence-free projection. The approach is also compatible with multiscale finite-element architectures in which quantum parallelism can simultaneously update all representative volume element (RVE) states. Numerical verification includes a steady vortex, a regularized periodic force-dipole benchmark, and an RVE-inspired Kolmogorov-like fluctuation benchmark. The latter illustrates how the circuit can recover a homogenized kinetic-energy observable without reconstructing the full velocity field, consistent with the role of averaged quantities in multiscale flow calculations. Subject to application-dependent assumptions about efficient state preparation and observable estimation, the circuit has polylogarithmic dependence on the grid resolution, with the polynomial degree and tile count appearing as explicit approximation and implementation parameters.

DOI
10.1016/j.cma.2026.119453

Related papers

A Quantum Spectral Method for Non-Periodic Boundary Value Problems

Eky Febrianto, Yiren Wang, Burigede Liu +2 more

Quantum computing holds the promise of solving computational mechanics problems in polylogarithmic time, meaning computational time scales as $\mathscr{O}((\log N)^c)$, where $N$ is the problem size and $c$ a constant. We propose a quantum spectral method with polylogarithmic complexity for solving non-periodic boundary value problems with arbitrary Dirichlet boundary conditions. Our method extends the recently proposed approach by Liu et al. (2025), in which periodic problems are discretised using truncated Fourier series. In such spectral methods, the discretisation of boundary value problems with constant coefficients leads to a set of algebraic equations in the Fourier space. We implement the respective diagonal solution operator by first approximating it with a polynomial and then quantum encoding the polynomial. The mapping between the physical and Fourier spaces is accomplished using the quantum Fourier transform (QFT). To impose zero Dirichlet boundary conditions, we double the domain size and reflect all physical fields antisymmetrically. The respective reflection matrix defines the quantum sine transform (QST) by pre- and post-multiplying with the QFT. For non-zero Dirichlet boundary conditions, the solution is decomposed into a boundary-conforming and a homogeneous part. The homogenous part is determined by solving a problem with a suitably modified forcing vector. We illustrate the basic approach with a Dirichlet-Poisson problem and demonstrate its generality by applying it to a fractional stochastic PDE for modelling spatial random fields. We discuss the circuit implementation of the proposed approach and provide numerical evidence confirming its polylogarithmic complexity.

math.NACross-listedarXiv:2511.11494•Computer Methods in Applied Mechanics and Engineering•Nov 17, 2025•7 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

A Preconditioned Quantum Linear Solver for Periodic Two-Phase Heat Conduction with Mesh-Independent Condition Number

Krishnan Suresh

We consider here computational homogenization of a periodic two-phase conduction problem. Quantum linear-system algorithms for its finite element discretization are limited by the condition number of the stiffness matrix. This condition number grows quadratically with the number of elements per side. Classically, preconditioning by the homogeneous (single-phase) operator bounds the condition number by the conductivity contrast, for every mesh size. On a quantum computer, however, a preconditioner encoded as a separate factor multiplies the subnormalizations, and the quadratic dependency returns. In this paper, we absorb the closed-form inverse square root of the homogeneous operator into the finite element factors. The preconditioned operator then becomes the product of a norm-preserving gradient operator $\mat{V}$, a diagonal matrix of scaled conductivities, and $\mat{V}^T$. Each factor has norm at most one. The block encoding therefore has subnormalization one, and its condition number is bounded by just the conductivity contrast, for every mesh size and in every dimension. The operator $\mat{V}$ is applied as a quantum Fourier transform, a small rotation at each wavenumber, and an inverse transform. Quantum singular value transformation then block-encodes the inverse of the preconditioned operator. We test the method numerically on three periodic cells with up to $10^6$ unknowns. The results confirm that the condition number does not depend on the mesh, and the energy-norm error of the inverse is below the polynomial tolerance at every mesh. On meshes of $4 \times 4$ and $8 \times 8$ elements, we also build the entire inverse as one Qiskit circuit and simulate it by state vector, with the rotation at each wavenumber built from uniformly controlled rotations. The output state agrees with the finite element solution to within the polynomial tolerance.

arXiv:2610.41690•Oct 30, 2026•0 citations

Efficient and Explicit Block Encoding of Finite Difference Discretizations of the Laplacian

Andreas Sturm, Niclas Schillo

The data input model is a fundamental component of every quantum algorithm, as its efficiency is crucial for achieving potential speed-ups over classical methods. For quantum linear algebra tasks that utilize quantum eigenvalue or singular value transformations, block encoding is the established technique for accessing matrix data. A key application of this is solving partial differential equations, where the Laplacian operator and its finite difference discretization serve as foundational examples. In this article, we present an efficient and explicit block encoding method for the Laplacian with periodic boundary conditions that enhances existing approaches in key aspects. We detail the construction of the quantum algorithm and illustrate how it leverages the unique structure of finite difference discretizations. Furthermore, we analytically derive the scaling of the sub-normalization factor and of the success probability of the block encoding with respect to the problem dimension, the grid width of the finite difference grid and the regularity of the exact solution, and we give resource estimates.

arXiv:2509.02429•ACM Transactions on Quantum Computing•Aug 1, 2026•9 citations

Quantum circuits of elastic wave equations via Schrödingerisation

Shi Jin, Chundan Zhang

We construct explicit quantum circuits for the velocity-stress formulation of elastic wave equations in homogeneous media using Schrödingerisation. After rewriting the equations in symmetric matrix form(SMF), we use Fourier spectral discretization for source-driven periodic problems and staggered-grid finite differences for Dirichlet, Neumann, and impedance boundary conditions. The Schrödingerisation method transforms any linear PDEs into a system of Schrödinger-type PDEs -with unitary evolution- using the warped phase transformation that maps the equations in one higher dimension. For periodic problems, we develop circuits by combining controlled Fourier-mode rotations. For physical boundaries, interleaved encoding swaps the spatial and field-component registers, enabling a more efficient circuit construction using shift operators. We analyze $p$th-order Trotter-Suzuki formulas and derive splitting-error and CNOT-gate estimates, under the assumptions of smooth auxiliary initialization and solution-state recovery. Comparison with classical partitioned splitting methods identifies a polynomial improvement in spatial-resolution dependence for the quantum state-evolution subroutine. Noiseless circuit simulations of a forced periodic problem and an impedance problem illustrate the constructions and quantify their errors against exact solutions and classical reference computations.

quant-pharXiv:2610.37247•Oct 28, 2026•0 citations

Towards quantum computational mechanics

Burigede Liu, M. Ortíz, Fehmi Cirak

The advent of quantum computers , operating on entirely different physical principles and abstractions from those of classical digital computers , sets forth a new computing paradigm that can potentially result in game-changing efficiencies and computational performance. Specifically, the ability to simultaneously evolve the state of an entire quantum system leads to quantum parallelism and interference. Despite these prospects, opportunities to bring quantum computing to bear on problems of computational mechanics remain largely unexplored. In this work, we demonstrate how quantum computing can indeed be used to solve representative volume element (RVE) problems in computational homogenisation with polylogarithmic complexity of 𝒪 ⁡ ( ( l o g ⁡ 𝑁 ) 𝑐 ) , compared to 𝒪 ⁡ ( 𝑁 𝑐 ) in classical computing. Thus, our quantum RVE solver attains exponential acceleration with respect to classical solvers, bringing concurrent multiscale computing closer to practicality. The proposed quantum RVE solver combines conventional algorithms such as a fixed-point iteration for a homogeneous reference material and the Fast Fourier Transform (FFT). However, the quantum computing reformulation of these algorithms requires a fundamental paradigm shift and a complete rethinking and overhaul of the classical implementation. We employ or develop several techniques, including the Quantum Fourier Transform (QFT), quantum encoding of polynomials, classical piecewise Chebyshev approximation of functions and an auxiliary algorithm for implementing the fixed-point iteration and show that, indeed, an efficient implementation of RVE solvers on quantum computers is possible. We additionally provide theoretical proofs and numerical evidence confirming the anticipated 𝒪 ⁡ ( ( l o g ⁡ 𝑁 ) 𝑐 ) complexity of the proposed solver.

Computer Methods in Applied Mechanics and Engineering•Oct 1, 2024•34 citations
We present a quantum spectral solver for the steady incompressible Stokes equations on a two-dimensional periodic domain. The method uses the Quantum Fourier Transform as a coherent change of basis and exploits the resulting spectral structure of the Stokes operator: the Laplacian becomes diagonal, while incompressibility is enforced mode by mode through a Helmholtz projection. In two dimensions, this projection is realized by a mode-dependent rotation from Cartesian velocity components to longitudinal–transverse coordinates, followed by component-conditioned inverse-Laplacian scaling. The velocity and pressure fields are encoded as quantum states over Fourier modes and physical components, and the corresponding spectral factors are implemented through polynomially encoded amplitude blocks. The construction extends recent quantum spectral methods in computational mechanics to an incompressible flow operator with explicit pressure–velocity splitting and divergence-free projection. The approach is also compatible with multiscale finite-element architectures in which quantum parallelism can simultaneously update all representative volume element (RVE) states. Numerical verification includes a steady vortex, a regularized periodic force-dipole benchmark, and an RVE-inspired Kolmogorov-like fluctuation benchmark. The latter illustrates how the circuit can recover a homogenized kinetic-energy observable without reconstructing the full velocity field, consistent with the role of averaged quantities in multiscale flow calculations. Subject to application-dependent assumptions about efficient state preparation and observable estimation, the circuit has polylogarithmic dependence on the grid resolution, with the polynomial degree and tile count appearing as explicit approximation and implementation parameters.
Quantum computing holds the promise of solving computational mechanics problems in polylogarithmic time, meaning computational time scales as O((log⁡N)c)\mathscr{O}((\log N)^c)O((logN)c), where NNN is the problem size and ccc a constant. We propose a quantum spectral method with polylogarithmic complexity for solving non-periodic boundary value problems with arbitrary Dirichlet boundary conditions. Our method extends the recently proposed approach by Liu et al. (2025), in which periodic problems are discretised using truncated Fourier series. In such spectral methods, the discretisation of boundary value problems with constant coefficients leads to a set of algebraic equations in the Fourier space. We implement the respective diagonal solution operator by first approximating it with a polynomial and then quantum encoding the polynomial. The mapping between the physical and Fourier spaces is accomplished using the quantum Fourier transform (QFT). To impose zero Dirichlet boundary conditions, we double the domain size and reflect all physical fields antisymmetrically. The respective reflection matrix defines the quantum sine transform (QST) by pre- and post-multiplying with the QFT. For non-zero Dirichlet boundary conditions, the solution is decomposed into a boundary-conforming and a homogeneous part. The homogenous part is determined by solving a problem with a suitably modified forcing vector. We illustrate the basic approach with a Dirichlet-Poisson problem and demonstrate its generality by applying it to a fractional stochastic PDE for modelling spatial random fields. We discuss the circuit implementation of the proposed approach and provide numerical evidence confirming its polylogarithmic complexity.
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.
We consider here computational homogenization of a periodic two-phase conduction problem. Quantum linear-system algorithms for its finite element discretization are limited by the condition number of the stiffness matrix. This condition number grows quadratically with the number of elements per side. Classically, preconditioning by the homogeneous (single-phase) operator bounds the condition number by the conductivity contrast, for every mesh size. On a quantum computer, however, a preconditioner encoded as a separate factor multiplies the subnormalizations, and the quadratic dependency returns. In this paper, we absorb the closed-form inverse square root of the homogeneous operator into the finite element factors. The preconditioned operator then becomes the product of a norm-preserving gradient operator $\mat{V}$, a diagonal matrix of scaled conductivities, and $\mat{V}^T$. Each factor has norm at most one. The block encoding therefore has subnormalization one, and its condition number is bounded by just the conductivity contrast, for every mesh size and in every dimension. The operator $\mat{V}$ is applied as a quantum Fourier transform, a small rotation at each wavenumber, and an inverse transform. Quantum singular value transformation then block-encodes the inverse of the preconditioned operator. We test the method numerically on three periodic cells with up to 10610^6106 unknowns. The results confirm that the condition number does not depend on the mesh, and the energy-norm error of the inverse is below the polynomial tolerance at every mesh. On meshes of 4×44 \times 44×4 and 8×88 \times 88×8 elements, we also build the entire inverse as one Qiskit circuit and simulate it by state vector, with the rotation at each wavenumber built from uniformly controlled rotations. The output state agrees with the finite element solution to within the polynomial tolerance.
The data input model is a fundamental component of every quantum algorithm, as its efficiency is crucial for achieving potential speed-ups over classical methods. For quantum linear algebra tasks that utilize quantum eigenvalue or singular value transformations, block encoding is the established technique for accessing matrix data. A key application of this is solving partial differential equations, where the Laplacian operator and its finite difference discretization serve as foundational examples. In this article, we present an efficient and explicit block encoding method for the Laplacian with periodic boundary conditions that enhances existing approaches in key aspects. We detail the construction of the quantum algorithm and illustrate how it leverages the unique structure of finite difference discretizations. Furthermore, we analytically derive the scaling of the sub-normalization factor and of the success probability of the block encoding with respect to the problem dimension, the grid width of the finite difference grid and the regularity of the exact solution, and we give resource estimates.
We construct explicit quantum circuits for the velocity-stress formulation of elastic wave equations in homogeneous media using Schrödingerisation. After rewriting the equations in symmetric matrix form(SMF), we use Fourier spectral discretization for source-driven periodic problems and staggered-grid finite differences for Dirichlet, Neumann, and impedance boundary conditions. The Schrödingerisation method transforms any linear PDEs into a system of Schrödinger-type PDEs -with unitary evolution- using the warped phase transformation that maps the equations in one higher dimension. For periodic problems, we develop circuits by combining controlled Fourier-mode rotations. For physical boundaries, interleaved encoding swaps the spatial and field-component registers, enabling a more efficient circuit construction using shift operators. We analyze pppth-order Trotter-Suzuki formulas and derive splitting-error and CNOT-gate estimates, under the assumptions of smooth auxiliary initialization and solution-state recovery. Comparison with classical partitioned splitting methods identifies a polynomial improvement in spatial-resolution dependence for the quantum state-evolution subroutine. Noiseless circuit simulations of a forced periodic problem and an impedance problem illustrate the constructions and quantify their errors against exact solutions and classical reference computations.
The advent of quantum computers , operating on entirely different physical principles and abstractions from those of classical digital computers , sets forth a new computing paradigm that can potentially result in game-changing efficiencies and computational performance. Specifically, the ability to simultaneously evolve the state of an entire quantum system leads to quantum parallelism and interference. Despite these prospects, opportunities to bring quantum computing to bear on problems of computational mechanics remain largely unexplored. In this work, we demonstrate how quantum computing can indeed be used to solve representative volume element (RVE) problems in computational homogenisation with polylogarithmic complexity of 𝒪 ⁡ ( ( l o g ⁡ 𝑁 ) 𝑐 ) , compared to 𝒪 ⁡ ( 𝑁 𝑐 ) in classical computing. Thus, our quantum RVE solver attains exponential acceleration with respect to classical solvers, bringing concurrent multiscale computing closer to practicality. The proposed quantum RVE solver combines conventional algorithms such as a fixed-point iteration for a homogeneous reference material and the Fast Fourier Transform (FFT). However, the quantum computing reformulation of these algorithms requires a fundamental paradigm shift and a complete rethinking and overhaul of the classical implementation. We employ or develop several techniques, including the Quantum Fourier Transform (QFT), quantum encoding of polynomials, classical piecewise Chebyshev approximation of functions and an auxiliary algorithm for implementing the fixed-point iteration and show that, indeed, an efficient implementation of RVE solvers on quantum computers is possible. We additionally provide theoretical proofs and numerical evidence confirming the anticipated 𝒪 ⁡ ( ( l o g ⁡ 𝑁 ) 𝑐 ) complexity of the proposed solver.