Shallow Quantum Circuits for Geometrically Local Lindblad Dynamics
Abstract
Open-system dynamics govern decoherence, transport, and engineered dissipation in quantum many-body systems. We propose a quantum algorithm for simulating time-independent, finite-range Lindblad dynamics with bounded local strength on a constant-dimensional lattice of n sites, allowing noncommuting jump operators. For time T≥1 and diamond-norm error at most ε, it has depth O(Tpolylog(nT/ε)) and gate count O(nTpolylog(nT/ε)). These results extend the HHKL spatial decomposition to open systems. The main obstacle is that the reversible overlap corrections used for unitary dynamics have no direct analogue for dissipative channels. We overcome this by retaining the environment in a shared unitary dilation, keeping information lost from the system coherently available and making the spatial corrections reversible. We prove exponential occupation bounds for the environmental states generated by the decomposition, allowing compact representation and coherent simulation of local factors on the inputs that arise. The construction reduces each short-time evolution to a constant number of parallel layers on regions of logarithmic diameter, using nearest-neighbour gates and polylogarithmic auxiliary density. We also prove unconditional worst-case lower bounds using time-independent, purely dissipative processes that transport quantum information. For circuits with local quantum and classical communication, the lower bounds are Ω(nT) for the expected gate count and Ω(T) for depth on time scales up to the lattice diameter. They match the upper bounds' leading time and volume dependence up to polylogarithmic factors. At fixed time and sufficiently small fixed error, we further prove a depth lower bound of Ω(log n/loglog n), showing that global accuracy can require increasing depth as the lattice grows.
Related
- Polynomial-time additive-error estimation of output probabilities for shallow quantum circuits
- Classical Pre-Training of Large Shallow Parametrized Quantum Circuits through Pauli Propagation and deployment on Quantum Hardware
- Experimentally Testable Quantum Advantage in Shallow Circuits
- Shadow Quantum Singular Value Transformation with Shallow Quantum Circuits
- Distilling Datasets into Shallow Circuits for Quantum Machine Learning
BibTeX
@misc{shen2026shallow,
title = {{Shallow Quantum Circuits for Geometrically Local Lindblad Dynamics}},
author = {Zheyu Shen and Yusen Wu and Xiao Yuan and Yukun Zhang},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.05362},
eprint = {2610.05362},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.05362},
}
RIS
TY - UNPB
TI - Shallow Quantum Circuits for Geometrically Local Lindblad Dynamics
AU - Zheyu Shen
AU - Yusen Wu
AU - Xiao Yuan
AU - Yukun Zhang
PY - 2026
DA - 2026/10/04
PB - arXiv
DO - 10.48550/arxiv.2610.05362
UR - https://arxiv.org/abs/2610.05362
AB - Open-system dynamics govern decoherence, transport, and engineered dissipation in quantum many-body systems. We propose a quantum algorithm for simulating time-independent, finite-range Lindblad dynamics with bounded local strength on a constant-dimensional lattice of n sites, allowing noncommuting jump operators. For time T≥1 and diamond-norm error at most ε, it has depth O(Tpolylog(nT/ε)) and gate count O(nTpolylog(nT/ε)). These results extend the HHKL spatial decomposition to open systems. The main obstacle is that the reversible overlap corrections used for unitary dynamics have no direct analogue for dissipative channels. We overcome this by retaining the environment in a shared unitary dilation, keeping information lost from the system coherently available and making the spatial corrections reversible. We prove exponential occupation bounds for the environmental states generated by the decomposition, allowing compact representation and coherent simulation of local factors on the inputs that arise. The construction reduces each short-time evolution to a constant number of parallel layers on regions of logarithmic diameter, using nearest-neighbour gates and polylogarithmic auxiliary density. We also prove unconditional worst-case lower bounds using time-independent, purely dissipative processes that transport quantum information. For circuits with local quantum and classical communication, the lower bounds are Ω(nT) for the expected gate count and Ω(T) for depth on time scales up to the lattice diameter. They match the upper bounds' leading time and volume dependence up to polylogarithmic factors. At fixed time and sufficiently small fixed error, we further prove a depth lower bound of Ω(log n/loglog n), showing that global accuracy can require increasing depth as the lattice grows.
ER -