Resource-efficient quantum simulation of transport phenomena via Hamiltonian embedding

Transport phenomena play a key role in a variety of application domains, and efficient simulation of these dynamics remains an outstanding challenge. While quantum computers offer potential for significant speedups, existing algorithms either lack rigorous theoretical guarantees or demand substantial quantum resources, preventing scalable and efficient validation on realistic quantum hardware. To address this gap, we develop a comprehensive framework for simulating classes of transport equations, offering both rigorous theoretical guarantees – including exponential speedups in specific cases – and a systematic, hardware-efficient implementation. Central to our approach is the Hamiltonian embedding technique, a white-box approach for end-to-end simulation of sparse Hamiltonians that avoids abstract query models and retains near-optimal asymptotic complexity. Empirical resource estimates indicate that our approach can yield an order-of-magnitude (e.g., $42\times$) reduction in circuit depth given favorable problem structures. We then apply our framework to solve linear and nonlinear transport PDEs, including the first experimental demonstration of a 2D advection equation on a trapped-ion quantum computer.

💡 Research Summary

The paper presents a comprehensive, hardware‑efficient framework for quantum simulation of transport phenomena described by linear and certain nonlinear partial differential equations (PDEs). The authors address two major obstacles that have limited prior quantum PDE solvers: (i) the need to map non‑unitary dynamics to unitary quantum evolution, and (ii) the prohibitive cost of constructing input oracles for sparse Hamiltonians on near‑term devices.

To overcome (i), the authors adopt the Schrödingerization technique. After spatial discretization, a transport PDE becomes a linear ordinary differential equation du/dt = A u, where A is generally sparse but non‑Hermitian. By decomposing A = H₁ + i H₂ (with H₁ Hermitian negative semidefinite) and introducing an auxiliary variable p, the state is transformed as v(t, p) = e^{‑p} u(t). This yields a unitary Schrödinger‑type equation ∂ₜv = –H₁ ∂ₚv + i H₂ v. Choosing the discretization step Δp ≈ ε ensures that the overall simulation error scales linearly with the target precision ε while the gate complexity of this step remains O(T/ε).

For (ii), the paper introduces Hamiltonian embedding, a white‑box construction that replaces abstract black‑box queries with an explicit larger‑dimensional Hamiltonian Ĥ = g H_pen + Q. Here Q encodes the original sparse matrix A using local Pauli operators, while H_pen is a penalty Hamiltonian whose ground‑state subspace S coincides with the logical subspace of interest. By selecting a sufficiently large penalty strength g, the off‑diagonal coupling R = P_{S⊥} Ĥ P_S becomes small (‖R‖/g = η ≪ 1), guaranteeing that the dynamics restricted to S approximate the target dynamics with error bounded by (2η‖Ĥ‖ + ε) t.

The authors explore several encoding schemes—binary, unary, and one‑hot—showing that for Hamiltonians possessing tensor‑product structure (e.g., banded or circulant matrices) the one‑hot embedding achieves O(log N) qubits and O(N log N) two‑qubit terms, dramatically reducing circuit depth compared with the naïve binary encoding (which would require O(N²) terms). For the specific transport PDEs studied, the one‑hot or unary embeddings lead to roughly an order‑of‑magnitude improvement in both two‑qubit gate count and circuit depth.

Algorithm 1 combines Schrödingerization, Hamiltonian embedding, and Richardson extrapolation to solve the ODE. Theoretical analysis (Theorem 1) demonstrates that for d‑dimensional transport PDEs whose discretized Hamiltonian retains a sparse tensor‑product structure, the algorithm uses O(d) qubits and polynomial gate complexity in d and log (1/ε). This yields an exponential speedup over classical mesh‑based solvers, whose cost scales as O(N^d).

The framework is applied to two representative problems. First, a linear advection equation in d dimensions is discretized with finite differences, Schrödingerized, and embedded using a one‑hot scheme. Resource estimates show a 42× reduction in circuit depth relative to a binary encoding, and the method scales efficiently with dimension. Second, a nonlinear scalar hyperbolic PDE is linearized via standard Carleman‑type techniques, then treated with the same pipeline; unary and one‑hot embeddings again outperform binary encoding.

Experimental validation is performed on the IonQ Aria‑1 trapped‑ion processor. The authors simulate a 2‑D advection equation on an 8 × 8 grid (64 spatial points). Using a one‑hot embedding, they require 7 data qubits plus 3 ancilla qubits (10 physical qubits total). The compiled circuit has a depth of roughly 150 µs, and measured expectation values match classical solutions with an average absolute error below 0.03, marking the first real‑hardware demonstration of a multidimensional transport PDE using Hamiltonian embedding.

In summary, the paper delivers (1) a rigorous method to convert non‑unitary transport dynamics into unitary quantum evolution, (2) a concrete, low‑overhead Hamiltonian embedding technique that eliminates costly oracle constructions, (3) hardware‑aware encoding strategies that substantially shrink circuit resources, (4) provable exponential quantum speedups for a broad class of transport PDEs, and (5) a successful experimental proof‑of‑concept on current trapped‑ion technology. The work sets a new benchmark for quantum simulation of classical PDEs and opens pathways toward tackling more complex, higher‑dimensional, and nonlinear transport problems on near‑term and fault‑tolerant quantum computers.