PreprintCC BY 4.0arXiv
Near-optimal quantum simulation of lattice Lindbladian dynamics
Abstract
We consider the problem of simulating dynamics under geometrically local Lindbladians acting on a lattice of qudits. We present an algorithm to approximate the time evolution under these Lindbladians for evolution time t and on N qudits to diamond norm error ε using geometrically local circuits of depth O(t polylog(Nt/ε)). Our results thus achieve a performance comparable to that of the Haah-Hastings-Kothari-Low (HHKL) algorithm for lattice Hamiltonian simulation.
Related
- Query-Optimal and Gate-Efficient Lindbladian Simulation
- Lattice Lindbladian simulation by patching and merging
- Optimal Tolerant Testing of Lindbladian Dissipation
- Optimal Linear Combination of Hamiltonian Simulation for Dissipative Dynamics
- Fast Random Compilers for Time-Dependent and Time-Independent Lindbladian Simulation
BibTeX
@misc{trivedi2026nearoptimal,
title = {{Near-optimal quantum simulation of lattice Lindbladian dynamics}},
author = {Rahul Trivedi and Xiehang Yu and Daniel Malz},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.36203},
eprint = {2609.36203},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.36203},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Near-optimal quantum simulation of lattice Lindbladian dynamics
AU - Rahul Trivedi
AU - Xiehang Yu
AU - Daniel Malz
PY - 2026
DA - 2026/09/28
PB - arXiv
DO - 10.48550/arxiv.2609.36203
UR - https://arxiv.org/abs/2609.36203
AB - We consider the problem of simulating dynamics under geometrically local Lindbladians acting on a lattice of qudits. We present an algorithm to approximate the time evolution under these Lindbladians for evolution time t and on N qudits to diamond norm error ε using geometrically local circuits of depth O(t polylog(Nt/ε)). Our results thus achieve a performance comparable to that of the Haah-Hastings-Kothari-Low (HHKL) algorithm for lattice Hamiltonian simulation.
ER -