The Signal
Menczel and Brandner Set a New Test for Driven Quantum Relaxation
Paul Menczel and Kay Brandner derive sufficient algebraic conditions for open quantum systems to lose dependence on their initial states. For periodic driving, their criterion requires a connectivity condition at one instant and continuity
Quantum.world Team · Written with AI · fact-checked ·
Earlier tests for whether periodically driven quantum systems forget their starting states came with a qualification: a key criterion had been proved only for systems whose steady state is proportional to the identity. In a paper submitted to arXiv on October 21, Paul Menczel of RIKEN and Kay Brandner of the University of Nottingham establish a sufficient relaxation criterion for a broader class of periodically driven systems, without that restriction.
The result concerns finite-dimensional systems described by Gorini-Kossakowski-Sudarshan-Lindblad (GKSL) master equations, a standard framework for Markovian open-system dynamics. Menczel and Brandner write: “For periodically driven systems, we obtain a new criterion involving a similar algebraic condition and a local continuity requirement on the time-dependent GKSL generator.”
The gap in periodic-drive criteria
Complete relaxation means that the system’s long-term state no longer depends on its initial state. For a time-independent generator, that endpoint is a unique stationary state; under periodic driving, it is a unique limit cycle that repeats with the drive. The paper addresses when a system is guaranteed to reach that endpoint, not how quickly it gets there.
Earlier work had offered an easily checked criterion for periodic driving, based on whether the Lindblad operators connect the system’s states. But the proof applied only to unital GKSL equations, whose stationary state is proportional to the identity. Menczel and Brandner’s theorem supplies a proof for periodically driven generators under a different stated condition, and shows that the earlier criterion follows as a special case.
One instant, plus continuity
The new periodic criterion tests the Lindblad operators at one instant in each cycle. At that instant, the algebra generated by those operators must be the full matrix algebra on the system’s Hilbert space. The generator must also remain continuous over a nonzero interval immediately after that instant.
If both conditions hold, the dynamics are completely relaxing: states from any initial conditions converge to the same periodic limit cycle. The theorem does not require the condition to hold throughout the drive. It is a sufficient test, however, not a claim that every system that relaxes must satisfy it.
What the algebraic test checks
In plain terms, the algebraic condition asks whether combinations and products of the Lindblad operators can span all operators on the system. The authors also recover three previously derived criteria for autonomous, or time-independent, GKSL dynamics. One states that if the Lindblad operators generate the full matrix algebra, the system converges to a unique stationary state for any initial state.
Another autonomous condition also includes an effective Hamiltonian in the algebraic test. The paper distinguishes these time-independent results from the periodic theorem: the Hamiltonian-assisted condition does not extend to driven dynamics in the same way. A counterexample in the paper shows that satisfying that broader algebraic test at each instant can still leave the long-time periodic state dependent on the starting state.
A different test for nonperiodic driving
For generators that change over time without repeating periodically, the authors do not derive a comparable algebraic test stated directly in terms of the generator. Instead, they give a sufficient criterion using the dynamical map, which describes how states evolve between two times. It requires a sequence of disjoint time intervals on which the maps repeatedly bring different input states into overlapping outcomes strongly enough to meet a specified cumulative condition.
The paper also translates its periodic result to classical master equations for modulated Markov jump processes. There, the algebraic condition becomes a concrete graph test: at the tested instant, transitions with nonzero rates must connect every pair of states through a sequence of allowed jumps, with the generator continuous over a neighboring interval.