Skip to content
aiqbench takeQuantum Computing

aiqbench analysis

This research presents a near-optimal algorithm for simulating lattice Lindbladian dynamics, achieving circuit depths comparable to existing methods for Hamiltonian simulation. By handling geometrically local interactions on qudit lattices, the work advances the theoretical limits of quantum simulation for open systems.
Source coveringarXiv
What this isA model's reading of the article and related coverage, written for aiqbench. Not the publisher's words.

Near-optimal quantum simulation of lattice Lindbladian dynamics

arXiv1 min read

arXiv:2609.36203v1 Announce Type: new 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 $\varepsilon$ using geometrically local circuits of depth $O(t \ \polylog(Nt/\varepsilon))$. Our results thus achieve a performance comparable to that of the Haah-Hastings-Kothari-Low (HHKL) algorithm for lattice Hamiltonian simulation.

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 $\varepsilon$ using geometrically local circuits of depth $O(t \ \polylog(Nt/\varepsilon))$. Our results thus achieve a performance comparable to that of the Haah-Hastings-Kothari-Low (HHKL) algorithm for lattice Hamiltonian simulation.

arXiv:2609.36203 [quant-ph]

(or arXiv:2609.36203v1 [quant-ph] for this version)

https://doi.org/10.48550/arXiv.2609.36203 Focus to learn more arXiv-issued DOI via DataCite (pending registration)

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Full text under the publisher's open licence · 160 words

Related coverage