betaFeedback

WorksPhysics and Astronomy

Nonlinearity-preserving quantum simulation of flows in the early fault-tolerant regime

Abstract

Ensemble prediction of nonlinear dynamics propagates a probability density whose linear transport equation retains the nonlinear drift, but grid-dependent circuit costs leave end-to-end feasibility in early fault-tolerant quantum computing unresolved. We couple polynomial reduced-order models fitted by sparse identification of nonlinear dynamics to Walsh-synthesized Koopman-von Neumann (KvN) transport and surface-code resource estimation. At fixed model dimension and drift degree, per-step transport rotation counts scale polylogarithmically with cells per reduced coordinate. Balancing model accuracy against circuit costs makes reduced-model polynomial degree a design variable for early fault-tolerant quantum simulation. For a cylinder wake approaching saturation, preparation, propagation and sampling to 1% relative root-mean-square field error against the radial model are estimated to take 1.62 h on about 560,000 physical qubits. Estimated three-coordinate wake runtimes span hours to weeks below one million qubits. IBM hardware experiments demonstrate nonlinear radial KvN transport for this wake, using reference circuits to mitigate noise.

Manuscript

Nonlinear dynamics can make individual trajectories sensitive to small uncertainties in initial conditions, so reproducing attractor dynamics can be more informative than tracking a particular trajectory[1]. Ensemble prediction describes how this uncertainty evolves by propagating a probability distribution over possible states[2]. The wake behind a circular cylinder at Reynolds number 100 provides a simple test: disturbances grow from an unstable steady flow and saturate into stable periodic vortex shedding[3, 4]. The probability density representing the initial uncertainty obeys a linear transport equation whose drift retains the nonlinear dynamics[5, 6]. The challenge is to preserve these dynamics in low-degree reduced models while controlling the quantum costs of ensemble preparation, propagation and sampling.

Existing quantum approaches address different parts of this task. Near-term studies have demonstrated selected flow processes on quantum processors[7, 8], and a learned Koopman model implements linear observable evolution in circuits with nonlinear classical encoding and decoding[9]. Quantum lattice Boltzmann and Trotterized transport schemes treat prescribed velocity fields in which each component is independent of its own coordinate[10, 11]; the drift is then divergence-free, which excludes contraction towards attracting equilibria, a mechanism required for the ensemble dynamics targeted here. Reconstructing and re-preparing the distribution between steps[10, 12] interrupts coherent propagation and can erode end-to-end quantum speedups[13].

Carleman linearization and Koopman–von Neumann (KvN) embedding offer fault-tolerant routes to nonlinear drift[5, 14], with potential exponential advantage over deterministic Eulerian Liouville solvers for sparse KvN Hamiltonians[5]. Grid refinement can increase the step count or operator norm of Carleman solvers[15, 16] and the matrix-element scale in sparse KvN Hamiltonian simulation[5]. An upwind KvN circuit using a linear combination of Hamiltonian simulations (LCHS–KvN) suppresses parasitic oscillations with about 10⁸ single-target multi-controlled gates for ten steps on a 128-cell grid[17], with the authors noting that implementation requires fault-tolerant quantum hardware.

Bridging the gap between algorithmic advances and end-to-end feasibility in early fault-tolerant quantum computing (EFTQC) requires controlling circuit costs while retaining favourable grid scaling. In this regime, quantum processors run coherent algorithms with quantum error correction (QEC) before large-scale fault-tolerant hardware becomes available[18]; below-threshold error correction has been demonstrated[19], and IBM's roadmap targets a fault-tolerant processor for 2029[20]. Logical-qubit budgets constrain encoded coordinates; circuit-depth budgets constrain coherent propagation steps. The budget also covers initial-state preparation and the shots needed for accurate observable estimates.

Reduced-order models (ROMs) support repeated ensemble predictions for flow-control design and parametric studies[3, 21, 22] and determine both the physical approximation and the circuit: retained coordinates set the register width[5, 23], while polynomial degree and couplings set the rotations per step. Eliminating unresolved variables generally introduces memory and fluctuating-force terms[24]. Model error and initial uncertainty motivate ensemble prediction[25]. Jennings et al.[16] analyse end-to-end costs for Carleman-linearized spatial lattice-Boltzmann dynamics solved with a quantum linear solver. Reducing the flow before KvN embedding lets us exploit the ROM’s low-degree polynomial drift to compress circuits for ensemble prediction[2, 26, 27, 28].

Low-degree polynomial ROMs further connect physical modelling to efficient quantum propagation. Incompressible Navier–Stokes advection is quadratic, and standard Galerkin projection preserves this polynomial degree[4]. Quadratic and cubic models have been developed for wake dynamics[3], reactor oscillations[29], neuron activation and compressible flow[30], and nonlinear structural vibrations[31], while polynomial maps estimate drag and lift from wake-mode amplitudes[32]. We fit the reduced equations using sparse identification of nonlinear dynamics (SINDy) with a prescribed low-degree polynomial library[1, 33]. We test whether the model and its closure retain growth, saturation and an amplitude-dependent oscillation frequency[4, 34]. Walsh synthesis exploits the polynomial drift to reduce transport rotation counts.

At fixed model dimension and drift degree, the number of transport rotations per time step grows at most polylogarithmically with the number of cells per reduced coordinate, suggesting potential scaling benefits over deterministic ensemble grids[5]. We choose the polynomial degree by balancing model accuracy against KvN circuit cost. We then optimize designs for fault-tolerant execution. For the same task, we compare against a reconstructed block-encoding circuit that loads coordinates into amplitudes to form the drift operator[35], using surface-code estimates[36, 37, 38] covering preparation, propagation and sampling to 1% relative root-mean-square (RMS) field error against the continuum model. To test whether KvN circuits can describe nonlinear classical dynamics on quantum hardware, we execute a four-qubit circuit for radial transport, omitting the phase register. We mitigate noise using reference circuits whose propagation gates have zero rotation angles. IBM hardware experiments demonstrate nonlinear radial transport through measurements of ensemble observables during approach to an attracting state.

Results

Cylinder-wake dynamics and quantum KvN circuit

An ensemble can spread as disturbances grow away from the unstable steady wake and concentrate as its radial amplitude saturates (Fig. 1a). We retain these dynamics with two oscillatory proper orthogonal decomposition (POD) modes and a shift mode linking steady and mean shedding flows [3]. Our prediction task prepares an initial ensemble, propagates it with a quantum circuit derived from the fitted equations, and reconstructs the field from radius and phase measurements. Circuit and shot counts then determine physical qubits and runtime (Fig. 1b–f).

To construct the quantum transport model, we project the computational fluid dynamics (CFD) snapshots in Fig. 1b onto the oscillatory POD pair and shift mode, and SINDy fits a quadratic model constrained by reflection symmetry (Methods). For normalized oscillatory coordinates x,yx,y, we define the squared radial amplitude by r2=x2+y2r^2=x^2+y^2 and eliminate the independent normalized shift coordinate zz using the fitted closure z≈r2z\approx r^2, following Brunton et al.¹. Angular averaging the fitted model with this closure gives

drdt∗=μ(r−r3),dθdt∗=ω+γr2.(1)\frac{\mathrm{d}r}{\mathrm{d}t^*}=\mu\left(r-r^3\right),\quad\frac{\mathrm{d}\theta}{\mathrm{d}t^*}=\omega+\gamma r^2. \tag*{(1)}

Here rr is radius normalized by its saturated value, θ\theta is oscillation phase and t∗t^* is nondimensional physical time. The frozen coefficients are μ=0.092482\mu=0.092482, ω=0.75309\omega=0.75309 and γ=0.30173\gamma=0.30173, where ω\omega is the radius-independent angular rate (Supplementary equation (S6)).

We propagate a Gaussian model of initial radius uncertainty²⁸ under equation (1). Its probability density ρ\rho obeys the Liouville equation ∂tρ=−∇⋅(Fρ)\partial_t\rho=-\nabla\cdot(\mathbf{F}\rho). Its L2L^2 norm can change while total probability is conserved, so direct density evolution can be nonunitary, motivating methods such as LCHS³⁹. The radial drift vanishes at r=0,1r=0,1 and the angle is periodic. Under these boundary conditions the continuous KvN evolution is unitary⁵,⁶, with the density given by the squared magnitude of the amplitude

∂tψ=−F⋅∇ψ−12(∇⋅F)ψ,ρ=∣ψ∣2,(2)\partial_t\psi=-\mathbf{F}\cdot\nabla\psi-\frac{1}{2}(\nabla\cdot\mathbf{F})\psi,\quad\rho=\lvert\psi\rvert^2, \tag*{(2)}

where ψ\psi is the amplitude and F\mathbf{F} the vector field in equation (1). Contraction towards saturation is therefore compatible with unitary propagation. We represent Nx=2nN_x=2^n uniform cells on the normalized radius interval [0,1][0,1] with an nn-qubit register. Each computational basis state labels one cell, and its squared amplitude gives the cell probability. A real skew-symmetric discretization couples neighbouring-cell amplitudes. Each coupling evolves as a two-state RyR_y rotation¹², with angle equal to the shared-face drift times the layer duration divided by the cell width. These local amplitude transfers approximate transport of the density by that drift. The even layer acts on pairs (0,1),(2,3),…(0,1),(2,3),\ldots, and the odd layer on (1,2),(3,4),…(1,2),(3,4),\ldots. Rotations commute within each layer because no cell belongs to two pairs. Across layers, pairs share cells, so their application order matters. We approximate their joint evolution using symmetric Trotterization: an even half step, an odd full step and an even half step cancel the leading splitting-error term and give second-order accuracy in time (Methods).

With NxN_x radial cells, about Nx/2N_x/2 pairs per layer require O(Nx)O(N_x) separate rotations per step. To retain potential quantum grid-scaling benefits⁵, we use Walsh synthesis⁴⁰, expressing each pair’s angle as a weighted sum of pair-index parities. One target bit distinguishes the cells within each pair; the remaining n−1n-1 bits identify the pair. A Walsh parity is negative when its selected bits contain an odd number of ones and positive otherwise. Each nonzero coefficient requires one target rotation, with its sign set by that parity (Fig. 1c, illustrated for a linear drift). On the uniform grid, the shared-face coordinate is a weighted sum of the pair-index bits plus a constant. For drift degree at most KK, parities involving more than KK bits vanish, bounding the rotations per layer by

∑ℓ=0min⁡(K,n−1)(n−1ℓ)=O(nK).(3)\sum_{\ell=0}^{\min(K,n-1)}\binom{n-1}{\ell}=O(n^K). \tag*{(3)}

The three layers per step therefore require O((log⁡2Nx)K)O\left((\log_2 N_x)^K\right) radial transport rotations, with K=3K=3 for the wake (Supplementary Notes 3 and 4).

Reconstructing the velocity field requires the mean oscillatory coordinates and the mean shift coordinate. Under the shift closure, the normalized modal state is (x,y,z)T=(rcos⁡θ,rsin⁡θ,r2)T(x,y,z)^{\mathsf{T}}=(r\cos\theta,r\sin\theta,r^2)^{\mathsf{T}}. Integrating the angular equation in equation (1) gives θ=θc+Φ\theta=\theta_c+\Phi, with θc=θ0+ω(t∗−40)\theta_c=\theta_0+\omega(t^*-40), where θ0=atan2⁡(y,x)\theta_0=\operatorname{atan2}(y,x) is taken from the CFD state projected at t∗=40t^*=40 and Φ\Phi accumulates along each radial trajectory. The accumulated phase, the vector of ensemble averages (moments) m\mathbf{m} and the mean coordinates are

Φ(t∗)=γ∫40t∗r(s)2 ds,m=(⟨rcos⁡Φ⟩,⟨rsin⁡Φ⟩,⟨r2⟩)T,\Phi(t^*)=\gamma\int_{40}^{t^*}r(s)^2\,\mathrm{d}s,\qquad\mathbf{m}=\left(\langle r\cos\Phi\rangle,\langle r\sin\Phi\rangle,\langle r^2\rangle\right)^{\mathsf{T}},
⟨x⟩=m1cos⁡θc−m2sin⁡θc,⟨y⟩=m1sin⁡θc+m2cos⁡θc,⟨z⟩=m3.(4)\langle x\rangle=m_1\cos\theta_c-m_2\sin\theta_c,\quad\langle y\rangle=m_1\sin\theta_c+m_2\cos\theta_c,\quad\langle z\rangle=m_3. \tag*{(4)}

Angle brackets denote ensemble averages. Two phase qubits coherently accumulate Φ\Phi through radius-controlled updates around each radial step, without intermediate measurement (Fig. 1d). For this Gaussian input, matrix product state (MPS) preparation has a gate count logarithmic in radial cell count at fixed bond dimension, layer budget and compilation precision[41]. Classical compilation is offline; each shot executes the preparation circuit, NtN_t propagation steps and radius and phase readouts. Equation (4) then gives the modal averages for field reconstruction (Fig. 1e; Methods). We call the resulting circuit Walsh–KvN. Its 33-step benchmark uses nine logical qubits; end-to-end surface-code estimates place this task within the EFTQC window in Fig. 1f.

Ensemble simulation of vortex shedding with Walsh–KvN

Walsh–KvN recovers the alternating transverse-velocity lobes of the finite-element method (FEM) reference (Figure 2a), using 64 radial cells and 33 propagation steps from t∗=40t^*=40 to 49.829. For Figure 2b, we divide training data into four consecutive time blocks, fit each candidate on three and predict the fourth. We average field errors against CFD projected onto the retained POD modes over four tests. Rotation bounds sum one Walsh layer for each of three modal coordinates, with 64 cells per coordinate (Methods). We retain the 12-coefficient quadratic fit on the Pareto frontier, beyond which error reductions per added rotation diminish. Exact modal expectations from the ideal circuit follow the FEM spiral (Figure 2c). Near saturation, the FEM trajectory approaches the shift-closure relation z≈r2z\approx r^2 (Figure 2d).

Wake reconstruction and ROM selection

Figure 2. Wake reconstruction and ROM selection. a, Transverse velocity at Reynolds number 100; rows show times and columns compare FEM and Walsh–KvN. b, Model validation. Filled symbols mark the Pareto frontier; the circle marks the adopted quadratic fit. We sum rotation bounds for one Walsh layer in each of three modal coordinates. c,d, Modal trajectories and shift closure from exact circuit expectations. e, Errors for the three-mode ROM (3-mode), its reconstruction after shift closure and angular averaging (Radial), and the reconstruction from circuit readouts (Circuit). Grey/red errors are divided by the FEM field norm; blue is noiseless bias divided by the matched continuum Radial ensemble field norm. The dotted 1% RMS target also includes sampling and implementation errors. f, Drag (top) and lift (bottom). Blue lines show exact circuit expectations; open points use 815 separate ideal shots shared per time. Shading marks the circuit interval.

fig:2e compares the three-mode ROM (3-mode), the field after shift closure and angular averaging (Radial), and circuit reconstruction (Circuit). For one initial state, 3-mode differs from FEM by 6.42% at the final time, including projection and reduced-dynamics errors. Radial differs from 3-mode by 0.380% above zero and below 0.60% throughout the interval. Both comparisons are normalized by the FEM field norm. For the initial ensemble, the blue Circuit vs Radial curve gives 0.107% noiseless bias after 33 steps.

More shots reduce sampling fluctuations but leave systematic field bias. Accounting for both and implementation-error bounds, 815 accepted shots meet the 1% relative RMS field-error target after 33 steps at a per-attempt implementation-error budget of 10−410^{-4} (Methods; Supplementary Note 7).

We fit FEM drag and lift data with polynomials of modal coordinates[32] and average them directly from circuit readouts, without field reconstruction. Force readout measures phase correlations in different settings, so we assess it separately with 815 ideal shots per time for both forces. Their relative RMS errors against FEM are 0.21% and 10.5%, respectively (Figure 2f; Methods). The larger lift error partly reflects greater phase sensitivity; drag is dominated by constant and radial terms. Lift’s FEM RMS denominator is only 1/7.9 of drag’s, further magnifying the relative error.

End-to-end fault-tolerant resource estimates

Physical-qubit count and total task time are coupled: minimizing one need not make the other feasible. We minimize each separately and assess both designs against the early fault-tolerant hardware window[42]. The processor combines a core that executes the logical circuit with magic-state factories (MSFs; Figure 3a). MSFs distil and supply T states for non-Clifford gates through the core buffer, which stores them before consumption. The core’s data block holds and processes logical qubits encoded in surface-code patches.

Figure 3. Architecture, magic-state supply and joint selection. a, Surface-code core and multilevel magic-state factory (MSF). Each Pauli π/8\pi/8 rotation consumes one T state. Factory output accounts for cultivation, distillation and logical faults. b, Core and final-level factory timing. The QEC round duration and classical reaction time are troundt_{\mathrm{round}} and treactt_{\mathrm{react}}, respectively. With supply enforced, τT\tau_{\mathrm{T}} equals the nominal core interval τcore\tau_{\mathrm{core}}; with waiting allowed, insufficient final-level units set τT\tau_{\mathrm{T}} to the mean supply interval τMSF\tau_{\mathrm{MSF}}. c, We construct the architecture frontier by Pareto filtering data-block layouts, code distances and MSF configurations using physical-qubit count QQ, effective core error per T state ecore(T)e_{\mathrm{core}}^{(\mathrm{T})}, factory-output error eMSFe_{\mathrm{MSF}} and T-state consumption interval τT\tau_{\mathrm{T}}. Joint selection evaluates retained architectures and synthesis precisions for arbitrary rotations, minimizing qubit count or total task time under the per-attempt error budget.

Fast data blocks use more qubits than compact blocks to shorten T-state consumption intervals[37]; under a qubit cap, insufficient factory supply can limit this gain (Supplementary Figure S10). The supply policy also matters: we compare requiring mean supply to meet core demand (supply enforced) with permitting waits (waiting allowed; Figure 3b). At physical error probability 5×10−45 \times10^{-4}, waiting reduces minimum qubits by 27% while increasing time per attempt by 3.2% (Supplementary Figure S11).

Supplementary Figure S10. Coherent propagation capacity and factory supply. a, Maximum admissible step count for compact, intermediate and fast data blocks across physical error probabilities 2×10−42 \times10^{-4}–9×10−49 \times10^{-4}, under physical-qubit caps of 10510^{5} and 10610^{6}. b, Ratio of nominal core interval to T-state consumption interval at the corresponding capacity-maximizing designs. Unity denotes core-limited execution; values below unity denote factory-limited execution. Capacity uses a 10−410^{-4} per-attempt error budget and a 24-hour budget divided by 815 accepted shots. It does not certify field accuracy after longer evolutions.

Supplementary Figure S11. Circuit-specific optimization of factory supply. a, Physical qubits and runtime per attempt versus core code distance for the wake circuit with 7,392 native T/T† gates. b, Relative changes in selected physical qubits and runtime when waits are allowed. c, Runtime changes across physical error probabilities and native T counts, keeping 4,803 arbitrary rotations fixed. d, Corresponding core-distance sweep for the 200,000-native-T control. The control tests circuit-cost sensitivity rather than an additional flow simulation. In a and d, blue circles use the left physical-qubit axis and orange squares use the right runtime axis; axis colours match the corresponding curves.

We vary data-block layouts, code distances that set error protection, distillation levels and parallel factory units. Pareto filtering keeps architectures for which no alternative improves qubit count, T-state timing, core error or magic-state error without worsening another measure. Tighter rotation synthesis reduces approximation error but requires more T states. We then jointly select a retained architecture and rotation-synthesis precision under the error budget to minimize qubits or total task time (Figure 3c; Methods). Across physical error probabilities 2×10−42 \times10^{-4}–9×10−49 \times10^{-4}, we use a 10−410^{-4} per-attempt implementation-error budget. At the reference probability, the minimum-qubit radial design needs 53,382 physical qubits and 20.07 h; the fastest needs 559,942 qubits and 1.62 h (Table 1).

CalculationGrid cellsLogical qubitsStepsShotsT gates per attemptPhysical qubitsTotal timeGate bound‡
Walsh–KvN, radial649338153.77×1053.77 \times10^{5}559,9421.62 hO(Ntn3)O\left(N_t n^3\right)
Walsh–KvN, refined radial12810668091.19×1061.19 \times10^{6}561,5425.09 hO(Ntn3)O\left(N_t n^3\right)
BE–KvN, matched6437—8131.12×1091.12 \times10^{9}986,060262.9 dO(TNx5/2n2)O\left(T N_x^{5/2} n^2\right)
Three-coordinate, late64×32×6464 \times32 \times6420661041.46×1071.46 \times10^{7}702,7138.85 hO(Ntn2)O\left(N_t n^2\right)
Three-coordinate, growth256×32×256256 \times32 \times256245282344.14×1084.14 \times10^{8}809,05125.76 dO(Ntn2)O\left(N_t n^2\right)
LCHS–KvN, different task†12826108154.46×10104.46 \times10^{10}2,983,51135.5 yrO(∥ALCHS∥Tn)O\left(\lVert A_{\mathrm{LCHS}}\rVert T n\right)

Table 1. Fastest estimated fault-tolerant designs.

To assess how tailoring circuits to low-degree polynomial drift affects feasibility within the illustrative EFTQC window (Figure 4a)[18, 43, 44, 45], we compare Walsh–KvN with two reference circuits (BE–KvN and LCHS–KvN). BE–KvN[35] uses the same centred-difference generator, initial distribution, grid and interval. Each block-encoding call costs O(K(log⁡2Nx)2)O\left(K\left(\log_{2}N_x\right)^2\right) gates for NxN_x cells and drift degree KK. Its oracle uses normalized coordinate inputs xix_i satisfying ∑ixi2=1\sum_i x_i^2 = 1. Loading our fixed-interval grid requires rescaling these coordinates; restoring the physical drift scale gives the Nx1+K/2N_x^{1+K/2} call-count factor at fixed duration and tolerance in this reconstruction (Supplementary equations (S81)–(S84)). Enforcing normalization through grid spacing would change the interval; normalizing the full generator instead requires proportionally longer evolution. Walsh–KvN is about three orders of magnitude faster for the minimum-qubit and fastest designs; both circuits fit the window’s qubit range, but only Walsh–KvN finishes within one day (Figure 4b,Figure 4c).

Figure 4. Physical resources for nonlinear ensemble prediction. aa, Published hardware settings and estimates; shading marks the illustrative early fault-tolerant window. bb, Minimum-qubit (open) and fastest (filled) designs under a 10−410^{-4} per-attempt error budget. Curves exceeding one million qubits are clipped. cc, Total task time at physical error probability 5×10−45 \times10^{-4}; inset, expected time per accepted shot. Walsh–KvN and matched BE–KvN need 815 and 813 accepted shots for 1% relative RMS field error. LCHS–KvN uses its published sine-drift task; total time assumes 815 accepted shots for comparison, without a matched field-error target. Its fastest design uses 2.98 million physical qubits and appears only in cc. Axis breaks indicate separate time scales. Supplementary Notes 8–11 specify the model and search.

LCHS–KvN[17] uses nonunitary upwind transport to suppress parasitic oscillations. Its optimized bound has a logarithmic grid factor whose exponent is independent of drift degree under the assumptions in Supplementary Note 3. Its published ten-step benchmark uses a cubic polynomial in the sine signal, avoiding inverse-sine approximation in drift encoding. Recompiling this circuit at its original input and grid gives a fastest uncapped design outside the window’s qubit range at the reference physical error probability (Figure 4c; Methods).

At the same 1% field-error target, refining 64 to 128 cells doubles steps from 33 to 66 and raises runtime from 1.62 to 5.09 h, with one extra logical qubit and less than 1% more physical qubits (Table 1). For resolved distributions, refinement may replace upwinding; strong contraction may require upwinding to suppress oscillations, as resolving them by centred refinement can exceed EFTQC budgets (Methods).

To assess sensitivity to factory design and the corresponding error modelling, we re-estimate the minimum physical-qubit count for the 33-step radial Walsh–KvN circuit using two additional factory models [37, 46] and the same core model (Supplementary Figure S12). We also assess sensitivity to gate composition by varying the number of native T gates—those present before arbitrary-rotation synthesis—while holding the logical width and arbitrary-rotation count fixed. At each setting, we reoptimize the architecture and rotation-synthesis precision under each factory-supply policy. The qubit savings and runtime changes obtained by allowing waits for T states depend on both native T count and physical error probability; the runtime change can even reverse sign (Supplementary Figure S9 and Supplementary Figure S11). These results show why architecture, supply policy and synthesis precision must be optimized together for each circuit and resource budget.

Supplementary Figure S9. Physical-qubit changes under alternative factory-supply policies. Colours show the relative change between the independently minimized footprints, using the supply-enforced policy as the reference. The waiting-allowed control fixes one top-level unit, and the supply-enforced design meets mean core demand. The dashed line marks 7,392 native T gates, and outlined circles mark the largest sampled runtime increase at each marked physical error probability. Synthesis, distances and factory settings are reoptimized at each grid point. Note 10 and the sweep source data specify fixed inputs and grid controls.

Supplementary Figure S12. Error budget and resource-model sensitivity. a, Physical qubits and total task time for the same 1% relative RMS wake-field-error target under different per-attempt error budgets. The marked 10−410^{-4} setting is the common comparison error budget, not the field tolerance. b, Minimum-qubit estimates for the same 33-step radial Walsh–KvN circuit under three factory models with a common core model. Bracketed labels use main-manuscript reference numbers.

Uncapped designs at physical error probability 5×10−45 \times10^{-4} and per-attempt error budget 10−410^{-4}. Wake rows target 1% relative RMS field error. Shots are accepted samples; times include failed attempts. T counts include rotation synthesis.

† Published LCHS–KvN task; total time assumes 815 accepted shots without a matched field-error target.

‡ Bounds exclude rotation synthesis and shots. nn is the maximum coordinate-register width, Nx=2nN_x = 2^n, NtN_t the step count, TT the normalized duration and ALCHSA_{\mathrm{LCHS}} the LCHS generator (Supplementary Notes 3, 11 and 12).

Coupled nonlinear dynamics and wake growth

References

  1. [1]Brunton, S. L., Proctor, J. L., and Kutz, J. N. Discovering governing equations from data by sparse identification of nonlinear dynamical systems. Proceedings of the National Academy of Sciences 113, 3932–3937 (2016). https://doi.org/10.1073/pnas.1517384113
  2. [2]Ning, Z. and Eghtershar, B. Filtered Neural Galerkin model reduction schemes for efficient propagation of initial condition uncertainties in digital twins. (2025). https://arxiv.org/abs/2511.00670
  3. [3]Noack, B. R., Afanasiev, K., Morzynski, M., Tadmor, G., and Thiele, F. A hierarchy of low-dimensional models for the transient and post-transient cylinder wake. Journal of Fluid Mechanics 497, 335–363 (2003). https://doi.org/10.1017/S0022112003006694
  4. [4]Schlegel, M. and Noack, B. R. On long-term boundedness of Galerkin models. Journal of Fluid Mechanics 765, 325–352 (2015). https://doi.org/10.1017/jfm.2014.736
  5. [5]Joseph, I. Koopman–von Neumann approach to quantum simulation of nonlinear classical dynamics. Physical Review Research 2, 043102 (2020). https://doi.org/10.1103/PhysRevResearch.2.043102
  6. [6]Stengl, M., Geiß, P., Klus, S., and Pokutta, S. Existence and uniqueness of solutions of the Koopman–von Neumann equation on bounded domains. Journal of Physics A Mathematical and Theoretical 57, 395302 (2024). https://doi.org/10.1088/1751-8121/adf67d
  7. [7]Wang, Z., Zhong, J., Wang, K., et al. Simulating fluid vortex interactions on a superconducting quantum processor. Nature Communications 17, 2602 (2026). https://doi.org/10.1038/s41467-026-69168-8
  8. [8]Meng, Z., Zhong, J., Xu, S., et al. Simulating unsteady flows on a superconducting quantum processor. Communications Physics 7, 949 (2024). https://doi.org/10.1038/s42005-024-02145-w
  9. [9]Zhang, B., An, D., Meng, Z., et al. Quantum simulation of real-world nonlinear dynamics via Koopman method. (2026). https://arxiv.org/abs/2607.07338
  10. [10]Tiwari, A., Ioannis, J., Joio, J., et al. Algorithmic Advances Towards a Realizable Quantum Lattice Boltzmann Method. (2025). https://arxiv.org/abs/2504.10870
  11. [11]Zylberman, J., Fredon, T., Loureiro, N. F., and Debbasch, F. Trotter-based quantum algorithm for solving transport equations with exponentially fewer time-steps. Quantum Science and Technology 11, 025015 (2026). https://doi.org/10.1088/2058-9565/ae488e
  12. [12]Akash, M. M. H., Dev, T., Nguyen, N.-Q., Chen, Y., Wu, H., and Shoele, K. Efficient Quantum Simulation of Variable-Coefficient Transport with Continuous Source Injection. (2026). https://arxiv.org/abs/2608.27712
  13. [13]Succi, S., Itani, W., Sreenivasan, K. and Steijl, R. Quantum computing for fluids: Where do we stand? EPL 144, 10001 (2023). https://doi.org/10.1209/0295-5075/acfdc7
  14. [14]Li, X., Yin, X., Wiebe, N., et al. Potential quantum advantage for simulation of fluid dynamics. Physical Review Research 7, 013036 (2025). https://doi.org/10.1103/PhysRevResearch.7.013036
  15. [15]Penuel, J., Katabarwa, A., Johnson, P. D., et al. Detailed assessment of calculating drag force with quantum computers: Explicit time-evolution precludes exponential advantage for nonlinear differential equations. (2025). https://arxiv.org/abs/2406.06323v3
  16. [16]Jennings, D., Korzekwa, K., Lostaglio, M., Ashworth, R., Marsili, E., and Rolston, S. End-to-End Quantum Algorithm for Nonlinear Fluid Dynamics with Bounded Quantum Advantage. PRX Quantum 7, 033060 (2026). https://doi.org/10.1103/xysy-q3fp
  17. [17]Novikau, I. and Joseph, I. Quantum algorithm for the advection-diffusion equation and the Koopman-von Neumann approach to nonlinear dynamical systems. Computer Physics Communications 309, 109498 (2025). https://doi.org/10.1016/j.cpc.2025.109498
  18. [18]Katabarwa, A., Gratsea, K., Caesura, A., and Johnson, P. D. Early Fault-Tolerant Quantum Computing. PRX Quantum 5, 020101 (2024). https://doi.org/10.1103/PRXQuantum.5.020101
  19. [19]Google Quantum AI and Collaborators. Quantum error correction below the surface code threshold. Nature 638, 920–926 (2025). https://doi.org/10.1038/s41586-024-08449-y
  20. [20]IBM. IBM Quantum Roadmap. IBM Technology Atlas (updated March 2026; accessed 10 November 2026). https://www.ibm.com/roadmaps/quantum/2030/
  21. [21]Bergmann, M. and Cordier, L. Optimal control of the cylinder wake in the laminar regime by trust-region methods and POD reduced-order models. Journal of Computational Physics 227, 7813–7840 (2008). https://doi.org/10.1016/j.jcp.2008.04.034
  22. [22]Zighed, I., Thome, N., Gallinari, P., and Sayadi, T. Uncertainty-aware and parametrized dynamic reduced-order model: Application to unsteady flows. Physical Review Fluids 10, 114902 (2025). https://doi.org/10.1103/f6ty-t6gl
  23. [23]Jin, S. and Liu, N. Quantum algorithms for nonlinear partial differential equations. Bulletin des Sciences Mathématiques 194, 103457 (2024). https://doi.org/10.1016/j.bulsci.2024.103457
  24. [24]Chorin, A. J., Hald, O. H., and Kupperman, R. Optimal prediction and the Mori–Zwanzig representation of irreversible processes. Proceedings of the National Academy of Sciences 97, 2968–2973 (2000). https://doi.org/10.1073/pnas.97.7.2968
  25. [25]Majda, A. J. and Qi, D. Strategies for Reduced-Order Models for Predicting the Statistical Responses and Uncertainty Quantification in Complex Turbulent Dynamical Systems. SIAM Review 60, 491–549 (2018). https://doi.org/10.1137/16M1104664
  26. [26]Succi, S., Itani, W., Sanavio, C., Sreenivasan, K. R., and Steijl, R. Ensemble fluid simulations on quantum computers. Computers & Fluids 270, 106148 (2024). https://doi.org/10.1016/j.compfluid.2023.106148
  27. [27]Ollinaho, P., Carver, G. D., Lang, S. T. K., Tuppi, L., Ekblom, M., and Järvinen, H. Ensemble prediction using a new dataset of ECMWF initial states – OpenEnsemble 1.0. Geoscientific Model Development 14, 2143–2160 (2021). https://doi.org/10.5194/gmd-14-2143-2021
  28. [28]Vittaldev, V., Russell, R. P., and Linares, R. Spacecraft Uncertainty Propagation Using Gaussian Mixture Models and Polynomial Chaos Expansions. Journal of Guidance, Control, and Dynamics 39, 2615–2626 (2016). https://doi.org/10.2514/1.G001571
  29. [29]Peherstorfer, B. and Willcox, K. Data-driven operator inference for nonintrusive projection-based model reduction. Computer Methods in Applied Mechanics and Engineering 306, 196–215 (2016). https://doi.org/10.1016/j.cma.2016.03.025
  30. [30]Qian, E., Kramer, B., Peherstorfer, B., and Willcox, K. Lift & Learn: Physics-informed machine learning for large-scale nonlinear dynamical systems. Physica D 406, 132401 (2020). https://doi.org/10.1016/j.physd.2020.132401
  31. [31]Karamooz, Mahdiabadi, M., Tiso, P., Brandt, A., and Rixen, D. J. A non-intrusive model-order reduction of geometrically nonlinear structural dynamics using modal derivatives. Mechanical Systems and Signal Processing 147, 107126 (2021). https://doi.org/10.1016/j.ymssp.2020.107126
  32. [32]Deng, N., Noack, B. R., Morzyński, M., and Pastur, L. R. Galerkin force model for transient and post-transient dynamics of the fluidic pinball. Journal of Fluid Mechanics 918, A4 (2021). https://doi.org/10.1017/jfm.2021.299
  33. [33]Loiseau, J.-C. and Brunton, S. L. Constrained sparse Galerkin regression. Journal of Fluid Mechanics 838, 42–67 (2018). https://arxiv.org/abs/1611.033271
  34. [34]Kaptanoglu, A. A., Callaham, J. L., Aravkin, A., Hansen, C. J., and Brunton, S. L. Promoting global stability in data-driven models of quadratic nonlinear dynamics. Physical Review Fluids 6, 094401 (2021). https://doi.org/10.1103/PhysRevFluids.6.094401
  35. [35]Guseynov, N., Huang, X., and Liu, N. Gate construction of block-encoding for Hamiltonians needed for simulating partial differential equations. Physical Review Research 7, 033100 (2025). https://doi.org/10.1103/xlpd-fb1g
  36. [36]Ross, N. J. and Selinger, P. Optimal ancilla-free Clifford+T approximation of z-rotations. Quantum Information and Computation 16, 901–953 (2016). https://arxiv.org/abs/1403.2975
  37. [37]Litinski, D. A Game of Surface Codes Large-Scale Quantum Computing with Lattice Surgery. Quantum 3, 128 (2019). https://doi.org/10.22331/q-2019-03-05-128
  38. [38]Silva, A., Scherer, A. W., Webb, Z., et al. Optimizing Multi-level Magic State Factories for Fault-Tolerant Quantum Architectures. (2025). https://arxiv.org/abs/2411.04270v2
  39. [40]Welch, J., Greenbaum, D., Mostame, S., and Aspuru-Guzik, A. Efficient quantum circuits for diagonal unitaries without ancillas. New Journal of Physics 16, 033040 (2014). https://doi.org/10.1088/1367-2630/16/3/033040
  40. [41]Iaconis, J., Johri, S. & Zhu, E. Y. Quantum state preparation of normal distributions using matrix product states. npj Quantum Information 10, 15 (2024). https://doi.org/10.1038/s41534-024-00805-0
  41. [42]Zhou, H., Cain, M. & Lukin, M. D. Opportunities in full-stack design of low-overhead fault-tolerant quantum computation. Nature Computational Science 5, 1110–1119 (2025). https://doi.org/10.1038/s43588-025-00895-6
  42. [43]Beverland, M. E., Murali, P., Troyer, M., et al. Assessing requirements to scale to practical quantum advantage. (2022). https://arxiv.org/abs/2211.07629v1
  43. [44]Akakoshi, Y., Maruyama, K., Oshima, H., Sato, S., and Fujii, K. Partially Fault-Tolerant Quantum Computing Architecture with Error-Corrected Clifford Gates and Space-Time Efficient Analog Rotations. PRX Quantum 5, 010337 (2024). https://doi.org/10.1103/PRXQuantum.5.010337
  44. [45]Gidney, C. How to factor 2048 bit RSA integers with less than a million noisy qubits. Preprint at https://arxiv.org/abs/2505.15917 (2025).
  45. [46]Litinski, D. Magic State Distillation: Not as Costly as You Think. Quantum 3, 205 (2019). https://doi.org/10.22331/q-2019-12-02-205
  46. [47]Novikau, I. & Joseph, I. Globalizing the Carleman linear embedding method for nonlinear dynamics. Preprint at https://arxiv.org/abs/2510.15715 (2025).
  47. [48]Giannakis, D., Ourmazd, A., Pfeffer, P., Schumacher, J., and Slawinska, J. Embedding classical dynamics in a quantum computer. Physical Review A 105, 052404 (2022). https://doi.org/10.1103/PhysRevA.105.052404
  48. [49]Montanaro, A. Quantum speedup of Monte Carlo methods. Proceedings of the Royal Society A 471, 20150301 (2015). https://doi.org/10.1098/rspa.2015.0301
  49. [50]Gidney, C., Shutty, N., and Jones, C. Magic state cultivation growing T states as cheap as CNOT gates. (2024). https://arxiv.org/abs/2409.17595
  50. [51]Gidney, C. and Ekerå, M. How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits. Quantum 5, 433 (2021). https://doi.org/10.22331/q-2021-04-15-433
  51. [53]Khattar, T. and Gidney, C. Rise of conditionally clean ancillae for efficient quantum circuit constructions. Quantum 9, 1752 (2025). https://doi.org/10.22331/q-2025-05-21-1752
  52. [54]Zindorf, B. and Bose, S. Efficient Implementation of Multi-Controlled Quantum Gates. Preprint at https://arxiv.org/abs/2404.02279v3 (2025).
  53. [55]McArdle, S., Gilyén, A., and Berta, M. Quantum state preparation without coherent arithmetic. Physical Review Letters 136, 240603 (2026). https://doi.org/10.1103/ntvs-c48s
  54. [56]Novikau, I. and Joseph, I. An efficient explicit implementation of a near-optimal quantum algorithm for simulating linear dissipative differential equations. Journal of Computational Physics 564, 115132 (2026). https://doi.org/10.1016/j.jcp.2026.115132

Paper details

vlnc:W_m7vmpzsc
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Physics and Astronomy

Claude (Anthropic), ChatGPT (OpenAI)

View statement
Looking for related papers…
Contents