Trees, Forests, and Stationary States of Quantum Lindblad Systems
Patrick Rooney, Anthony M. Bloch, Chitra Rangan

TL;DR
This paper introduces a graph-based method to characterize stationary states of quantum Lindblad systems, revealing conditions for unique end-states, symmetries, and oscillations, advancing understanding of quantum system asymptotics.
Contribution
It provides a novel graph-theoretic framework to analyze stationary states and end-states of quantum Lindblad systems, including conditions for symmetry and oscillations.
Findings
Characterization of stationary states via trees and forests on directed graphs.
Identification of conditions for unique end-states and stable oscillations.
Demonstration of the framework on typical Lindblad systems.
Abstract
In this paper, we study the stationary orbits of quantum Lindblad systems. We show that they can be characterized in terms of trees and forests on a directed graph with edge weights that depend on the Lindblad operators and the eigenbasis of the density operator. For a certain class of typical Lindblad systems, this characterization can be used to find the asymptotic end-states. There is a unique end-state for each basin of the graph (the strongly connected components with no outgoing edges). In most cases, every asymptotic end-state must be a linear combination thereof, but we prove necessary and sufficient conditions under which symmetry in the Lindblad and Hamiltonian operators hide other end-states or stable oscillations between end-states.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography · Quantum Mechanics and Applications
