Christopher Ye

Query-optimal quantum simulation of Lindblad evolution

For the problem of simulating Lindblad evolution for time $t$ to precision $\epsilon$, Hamiltonian simulation provides an additive query lower bound, informally, $\Omega(t + \mathrm{polylog}(1/\epsilon))$. However, the best previously known algorithms for general Lindblad simulation achieve a multiplicative upper bound...