A new algorithm has achieved optimal query complexity for the quantum simulation of Lindblad evolution, a fundamental process in the dynamics of open quantum systems. This breakthrough resolves an open question regarding the necessity of a multiplicative dependence on evolution time in previous algorithms. The proposed method offers optimal additive dependence on both evolution time and required precision, closing the gap between theoretical lower bounds and the capabilities of existing algorithms.

Lindblad evolution describes how a quantum system interacts with its environment, leading to decoherence and dissipation. Accurately simulating these processes is crucial for the development of quantum computing and the understanding of complex quantum phenomena. Until now, the best algorithms for Lindblad simulation exhibited a multiplicative dependence on evolution time (approximately O(t polylog(1/ε))), whereas theoretical lower bounds suggested that an additive dependence (approximately Ω(t + polylog(1/ε))) should be possible. This work demonstrates that this additive dependence is achievable within the block-encoding model.

The algorithm employs the transducer framework to reduce the query cost of composing first-order approximations to the evolution channel. Furthermore, it uses linear combinations of reuse circuits of different lengths to suppress catalyst-removal error. Although the additional gate complexity of this new method is higher than that of existing algorithms, its achievement of optimal query complexity is significant, as it identifies the fundamental amount of oracle access necessary and points the way for future improvements in gate complexity.