We give a quantum algorithm for Lindbladian simulation given a block encoding of the Hamiltonian $H$ and a projected unitary encoding of the stacked jump operator $B=\sum_{k=1}^m \lvert k\rangle\otimes L_k$, with normalization factors $α_H$ and $α_B$, respectively. For evolution time $t$, set $τ=(α_H+α_B^2)t$. The algorithm approximates the evolution channel to diamond-norm error $\varepsilon$ using $O\!\left(τ+\frac{\log(1/\varepsilon)}{\log\!\left(e+\log(1/\varepsilon)/τ\right)}\right)$ oracle queries, matching the query lower bound for Hamiltonian simulation. The number of additional one- and two-qubit gates is linear in the query complexity up to polylogarithmic factors. The query- and gate-complexity bounds extend to Lipschitz-continuous time-dependent Lindbladians under coherent time-indexed oracle access. Our construction uses a one-query transducer that implements a product of rational approximations to short-time evolution when supplied with a catalyst. We bound the error from omitting the catalyst by exploiting orthogonality between different sequences of Kraus labels. The gate implementation combines a compressed Kraus-label representation, which stores only the positions and values of the nonzero labels, with the rotation factorization of Chen et al.
AI Summary
The paper asks whether general Lindbladian simulation can attain the optimal joint evolution-time and precision dependence known for Hamiltonian simulation. It assumes a block encoding of $H$ with normalization $\alpha_H$ and a projected unitary encoding of the stacked jump operator $B=\sum_k|k\rangle\otimes L_k$ with normalization $\alpha_B$. Writing $\tau=(\alpha_H+\alpha_B^2)t$, it gives a channel approximation with diamond-norm error $\varepsilon$ using $O\!\left(\tau+\frac{\log(1/\varepsilon)}{\log(e+\log(1/\varepsilon)/\tau)}\right)$ oracle queries. This matches the Hamiltonian-subclass lower bound for $\tau\geq1$.
The construction discretizes evolution into rational CPTP steps with total error at most $10\tau^2/J$. A one-query transducer implements their product when supplied with an input-dependent catalyst. To avoid preparing that catalyst, the algorithm combines different transducer-reuse lengths through LCU and oblivious amplitude amplification. Tracking monotone time indices and orthogonality between Kraus-label histories yields an approximation error bounded by $\sqrt\tau(C\tau/q)^q$, with $O(q)$ queries. Compressed storage of nonzero Kraus labels and rotation factorization give additional gate complexity $O\!\left(Q[a+\ell(\log(m+1)+\ell)]\right)$, where $Q$ is the query bound and $\ell=\log(e(1+\tau)/\varepsilon)$.
The query bound extends to Lipschitz-continuous time-dependent generators under coherent time-indexed oracle access; the Lipschitz constant enters the discretization and gate bounds. Costs exclude implementing the supplied oracles, including coherent jump-operator selection and state preparation when constructing stacked access from individual encodings. Exploiting locality, small commutators, or other generator structure remains open.
Little sign of AI-generated textAI use disclosed
The main ideas underlying the work, including the central proof strategies, were generated by large language models.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
We give a quantum algorithm for Lindbladian simulation given a block encoding of the Hamiltonian H and a projected unitary encoding of the stacked jump operator B=∑k=1m∣k⟩⊗Lk, with normalization factors αH and αB, respectively. For evolution time t, set τ=(αH+αB2)t. The algorithm approximates the evolution channel to diamond-norm error ε using O(τ+log(e+log(1/ε)/τ)log(1/ε)) oracle queries, matching the query lower bound for Hamiltonian simulation. The number of additional one- and two-qubit gates is linear in the query complexity up to polylogarithmic factors. The query- and gate-complexity bounds extend to Lipschitz-continuous time-dependent Lindbladians under coherent time-indexed oracle access. Our construction uses a one-query transducer that implements a product of rational approximations to short-time evolution when supplied with a catalyst. We bound the error from omitting the catalyst by exploiting orthogonality between different sequences of Kraus labels. The gate implementation combines a compressed Kraus-label representation, which stores only the positions and values of the nonzero labels, with the rotation factorization of Chen et al.
The paper asks whether general Lindbladian simulation can attain the optimal joint evolution-time and precision dependence known for Hamiltonian simulation. It assumes a block encoding of H with normalization αH and a projected unitary encoding of the stacked jump operator B=∑k∣k⟩⊗Lk with normalization αB. Writing τ=(αH+αB2)t, it gives a channel approximation with diamond-norm error ε using O(τ+log(e+log(1/ε)/τ)log(1/ε)) oracle queries. This matches the Hamiltonian-subclass lower bound for τ≥1.
The construction discretizes evolution into rational CPTP steps with total error at most 10τ2/J. A one-query transducer implements their product when supplied with an input-dependent catalyst. To avoid preparing that catalyst, the algorithm combines different transducer-reuse lengths through LCU and oblivious amplitude amplification. Tracking monotone time indices and orthogonality between Kraus-label histories yields an approximation error bounded by τ(Cτ/q)q, with O(q) queries. Compressed storage of nonzero Kraus labels and rotation factorization give additional gate complexity O(Q[a+ℓ(log(m+1)+ℓ)]), where Q is the query bound and ℓ=log(e(1+τ)/ε).
The query bound extends to Lipschitz-continuous time-dependent generators under coherent time-indexed oracle access; the Lipschitz constant enters the discretization and gate bounds. Costs exclude implementing the supplied oracles, including coherent jump-operator selection and state preparation when constructing stacked access from individual encodings. Exploiting locality, small commutators, or other generator structure remains open.
For the problem of simulating Lindblad evolution for time t to precision ε, Hamiltonian simulation provides an additive query lower bound, informally, Ω(t+polylog(1/ε)). However, the best previously known algorithms for general Lindblad simulation achieve a multiplicative upper bound, informally, O(tpolylog(1/ε)), in query complexity. It has remained open whether this multiplicative dependence is necessary. In this paper, we close the gap in query complexity by giving an algorithm with optimal additive dependence on evolution time and precision in the block-encoding model. Our approach uses the transducer framework to reduce the query cost of composing first-order approximations to the evolution channel, together with linear combinations of reuse circuits of different lengths to suppress catalyst-removal error. We further achieve nearly optimal gate complexity in evolution time and precision through history compression and an efficient implementation of the query-free part of the transducer using operation reordering and linear combinations of unitaries, while preserving the optimal query complexity.
The query-optimal algorithm of [CGWZ26] for general time-dependent Hamiltonian simulation uses q=O(αT+log(e+log(1/ε)/(αT))log(1/ε)) queries to $\mathrm{HAM\mbox{-}T}$ within ε error for a Lipschitz-continuous time-dependent Hamiltonian H(t) on [0,T] satisfying ∥H(t)∥≤α. However, its direct circuit implementation incurs a substantially larger gate overhead. In this note, we give an implementation of the same algorithm that retains its optimal query complexity and uses O[q(a+log(1+εT(α+βT)))] one- and two-qubit gates, where a is the number of block-encoding ancilla qubits and β is the Lipschitz constant of H. The main ingredient is an exact dyadic factorization of the ordered update product in the underlying one-query transducer.
We construct a causal query compiler for time-dependent Lindblad dynamics and establish query and gate bounds under distinct input models. With coherent block encodings of the Hamiltonian and individual jump operators, a Lipschitz generator can be simulated to diamond-norm error ε using O(1+τ+log(1/ε)/log(e+log(1/ε)/τ)) controlled queries, where τ=T(αH+∑μαμ2). This bound is independent of the time-grid size and is worst-case optimal for τ≥1. Weak active entry and clean return yield a factorial history tail; combining two reuse lengths removes the auxiliary input. A three-call polar correction supplies the Lindblad cells. The compiler also characterizes the minimum oracle action of bounded adaptive Markovian protocols by quantum query complexity and the general adversary bound, up to constant factors. For finite-range dynamics on n lattice sites, efficient coherent evaluation of the local matrices and fixed local parameters give O(n(T+1)polylogX) elementary gates, where X=max{e,n(T+1)(1+Kt+B)/ε}, for piecewise Hölder generators with fixed exponent, local variation bound Kt, and at most B breakpoints per term. The jumps need not commute. This gate bound includes evaluation, arithmetic, selection, routing, and environment storage. Its proof combines a spatial decomposition on a common bath, compilation on occupied inputs, and routing on compressed records. Reusing bath storage between short segments gives depth (T+1)polylogX and space npolylogX.
We give a query-optimal algorithm for simulating a general n-qubit time-dependent Hamiltonian H(t) on [0,T], assuming that H is Lipschitz continuous and ∥H(t)∥≤α. In the standard $\mathrm{HAM\mbox{-}T}$ access model, the algorithm approximates the time-ordered propagator UH(T) to error ε using O(αT+log(e+log(1/ε)/(αT))log(1/ε)) $\mathrm{HAM\mbox{-}T}$ queries. This matches the known query lower bound for time-independent Hamiltonians, showing that time dependence incurs no asymptotic query overhead.
Our method first constructs a one-query transducer that, given an auxiliary state, implements an approximation to UH(T) and returns the state unchanged. A weighted combination of circuits that apply the transducer different numbers of times makes the error caused by omitting this state decay factorially, yielding the stated optimal precision dependence. For time-independent Hamiltonians, the same method also gives a query-optimal alternative to qubitization.
For Hamiltonian H=∑jhj, we prove asymptotically tight lower bounds on the gate and query complexities of simulating time evolution on a quantum computer. Our bounds hold for arbitrary term norms ∥hj∥, time t, and trace-distance error ε. The matching upper bound (known as composite qDRIFT) consists of high-order Trotterization of the large terms and a randomized first-order Trotterization of the small terms. Unlike prior work that chooses worst-case ∥hj∥ to encode the computation of parity or other Boolean functions in time evolution, our proof is elementary and based on a local, bounded-degree classical Hamiltonian. Our work suggests that for many physical systems (e.g., power-law interactions), gate count must scale polynomially in 1/ε, contrary to the complexity suggested by counting coherent oracle queries such as those in the block-encoding model.
We study the problem of learning arbitrary n-qubit Lindbladians, the generators of Markovian open-system dynamics, from their time evolution. We give the first known efficient algorithm that learns arbitrary Lindbladians without any structural assumptions. For an n-qubit Lindbladian of dynamical strength at most Λ, the algorithm estimates every coefficient to error ε using O(Λ2/ε2) experiments and O(Λ/ε2) total evolution time, with classical running time polynomial in n and Λ/ε. Both experimental costs match known lower bounds up to polylogarithmic factors. The algorithm identifies candidate labels through product Pauli experiments and estimates their coefficients using random stabilizer preparations and Clifford measurements. It requires no ancillas or control during the unknown evolution.
For constant k, our algorithm learns generic k-local Lindbladians of local dynamical strength at most Λloc using O(n2Λloc2/ε2) experiments and O(nΛloc/ε2) total evolution time, improving the upper bounds of prior works in terms of the dependence on n. We further improve the lower bounds of Arad, Chen, Guo, Rebentrost, and Yu (SODA 2027) using a family of 3-local Lindbladians. They already hold when the support is known, and only one Hamiltonian coefficient is requested, even for adaptive protocols with arbitrary ancillas and quantum memory. These lower bounds establish that our algorithm is optimal up to polylogarithmic factors in both experiment count and total evolution time for every fixed k≥3.