arXiv:2610.24342
Quantum-Classical Iterative Refinement for the Pressure-Poisson Equation on NISQ Hardware
Doyeol "David" Ahn, Byeongyong Park, Rho Shin Myong, Franz Klein
Abstract
We present a hybrid quantum-classical iterative refinement for the pressure-Poisson equation of the incompressible Navier-Stokes projection method on noisy quantum hardware. Rather than solving the pressure equation once per time step, we solve it repeatedly for the normalized residual and scale each quantum direction by a least-squares fit to the physical residual. As a result, the error of the quantum solve enters as a contraction factor $\sinθ_k$ of the residual rather than as an error floor. This removes the requirement of a state infidelity below $10^{-7}$ that was estimated for single-solve schemes. The hardware noise then sets the rate of convergence but not the attainable accuracy, and it is this change of the role of the quantum solve, not an improvement of the hardware, that allows the residual to converge. With a boundary-consistent staggered (MAC) discretization, the pressure residual equals the velocity divergence left after projection up to the factor $Δt/ρ$. On the IBM processor ibm_cleveland, a four-qubit ($16\times16$) problem reached a relative residual below $10^{-7}$ within eight to ten corrections in all 20 runs of a pre-registered experiment, whereas a single solve with a comparable number of shots stopped at 0.33-0.59. In a six-qubit ($64\times64$) pilot, all three runs reached the same tolerance in 13 corrections. On the IonQ Forte processor, a manufactured-solution benchmark reached $5.6\times10^{-8}$ in nine corrections. With the variational training itself carried out on ibm_cleveland, the residual fell to $5.6\times10^{-4}$ in seven corrections, below the pre-specified tolerance of $10^{-3}$, at the rate predicted by a noise model. To the best of our knowledge, these are the first converged pressure solutions obtained on quantum hardware.
AI Summary
The paper asks whether noisy quantum linear solves can support accurate pressure projection in incompressible Navier–Stokes simulations without requiring extremely high single-solve fidelity. It proposes hybrid iterative refinement: repeatedly solve for the normalized pressure residual using a quantum routine, then scale the resulting direction by a classical least-squares fit to the physical residual. The stated analysis makes quantum-solve error enter through a residual contraction factor $\sin\theta_k$, rather than an accuracy floor. This is intended to avoid a previously estimated single-solve state-infidelity requirement below $10^{-7}$: noise affects convergence speed rather than attainable accuracy. For a boundary-consistent staggered MAC discretization, the remaining velocity divergence equals the pressure residual multiplied by $\Delta t/\rho$. On IBM’s ibm_cleveland processor, a four-qubit, $16\times16$ linear system reached relative residual below $10^{-7}$ in eight to ten corrections in all 20 runs of a preregistered experiment; single solves with comparable shot counts stopped at 0.33–0.59. A six-qubit, $64\times64$ pilot reached the same tolerance in 13 corrections in all three runs. An IonQ Forte manufactured-solution benchmark reached $5.6\times10^{-8}$ in nine corrections. With variational training itself performed on ibm_cleveland, seven corrections reached $5.6\times10^{-4}$, below the prespecified $10^{-3}$ tolerance, at a rate reported to match a noise model. The reported demonstrations involve small systems, and the hardware-trained result has a looser tolerance. Only the abstract is available; it does not establish scaling, end-to-end computational advantage, or performance in larger flow simulations.
Written by gpt-6.1-sol from the abstract only. Automated: it can be wrong.