arXiv:2610.05362
Shallow Quantum Circuits for Geometrically Local Lindblad Dynamics
Zheyu Shen, Yusen Wu, Xiao Yuan, Yukun Zhang
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\ge1$ and diamond-norm error at most $ε$, it has depth $O(T\operatorname{polylog}(nT/ε))$ and gate count $O(nT\operatorname{polylog}(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/\log\log n)$, showing that global accuracy can require increasing depth as the lattice grows.
AI Summary
The paper asks whether geometrically local Lindblad evolution can be simulated with gate count nearly proportional to space–time volume and depth nearly proportional to time, extending HHKL beyond unitary dynamics. It considers time-independent, finite-range generators on constant-dimensional lattices, specified by explicit local matrices, with arbitrary noncommuting jumps and bounded local strength. For $n$ sites, normalized time $a=\lambda T$, and diamond-norm error $\varepsilon$, the construction uses $O(n(1+a)\operatorname{polylog}X)$ gates and $O((1+a)\operatorname{polylog}X)$ nearest-neighbour depth, where $X=\max\{2,n(1+a)/\varepsilon\}$. Explicit conservative logarithmic exponents are $16D+4$ for gates and depth and $6D$ for auxiliary density. All auxiliary and routing positions are counted on a same-dimensional lattice refinement. The spatial decomposition retains a shared collision environment, allowing reversible overlap corrections despite irreversible reduced dynamics. Vacuum-projected cancellations establish locality uniformly in the collision mesh. Exponential occupation bounds control correlated intermediate bath states, including inverse preimages, enabling compact coherent bath records. Transducer simulation, polynomial filtering, and binary-address interval evaluation implement local factors without executing every microscopic collision. Complementary time-independent, purely dissipative transport examples require $\Omega(n\lambda T)$ expected gates and $\Omega(\lambda T)$ depth before diameter saturation. At fixed normalized time and sufficiently small fixed error, depth can require $\Omega(\log n/\log\log n)$; this bound assumes local classical communication. The guarantees use fresh auxiliaries between segments and polylogarithmic auxiliary density. Time-dependent generators and non-Markovian environments are not covered. The paper also notes concurrent work obtaining the same leading gate-count and depth scaling.
The proofs and manuscript were developed through multiple rounds of interaction between the authors and GPT-5.6 and GPT-6, which assisted with calculations, proof development, and writing.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 57 pages, 4 figures