Skip to content
DraconiticResearch
Search Sources API
197,768 studies31 sourcesUpdated 6 min ago
PreprintarXiv licencearXiv

Constant-time equilibration of observables under rapid Lindbladian dynamics

Abstract

Markovian open-system dynamics have widespread applications throughout quantum information science, including algorithmic state preparation. Their convergence is commonly quantified using the worst case global trace distance between the evolving and stationary states. However, this criterion can be unnecessarily stringent when only physically relevant observables are of interest. Here we introduce and study observable-specific mixing times. We prove that, for quasi-local, rapidly mixing Lindbladians, sums of geometrically local observables equilibrate in a time independent of system size, in contrast to the logarithmic dependence of global state mixing. This separation reduces the runtime of dissipative quantum algorithms, including quantum Gibbs samplers, for estimating quantities such as the Gibbs state energy and local order parameters, yielding an overall scaling that is linear in system size. Complementing this quantum result, we develop a quantum-inspired classical algorithm for estimating the same quantities. Its runtime is likewise linear in system size, but scaling exponentially in 𝒪(log(1/ε)D), where D denotes the spatial dimension of the lattice. We further analyse non-interacting Lindbladians over qudits, fermions, and bosons, demonstrating that locality of observables is not always necessary for a qualitatively faster mixing. Small-scale simulations of quantum Gibbs samplers reveal no large hidden constants in our asymptotic analysis and show that the theoretical predictions closely capture the finite-size dynamics.

Related

  1. Discriminating Lindbladian Dynamics
    Robert Salzmann, Ludovico Lami, Martin B. Plenio +1
    arXivPreprintCC BY 4.0Full textMathematical physicsQuantum physics & quantum informationarXiv
  2. Glauber Dynamics for Sampling Colorings: Rapid Mixing above (1+1/e)Δ via Hidden Hard-Core Models
    Xiongxin Yang
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsProbabilityarXiv
  3. Improved rapid phase ordering for Ising dynamics on random regular graphs
    Zhangsong Li, Allan Sly
    arXivPreprintarXiv licenceFull textMathematical physicsProbabilityarXiv
  4. Cosm: orchestrated collective dynamics give rise to rapid computational search at the solution frontier
    Kenneth M. Zick, Nikhil Shukla, Alexander Marakov
    arXivPreprintarXiv licenceFull textOptimisation & controlComputational physicsarXiv
  5. An entropic barrier to equilibration in the discrete nonlinear Schrödinger equation: Rigorous bounds for the microcanonical Brownian motion
    Claudio Arezzo, Antonello Scardicchio
    arXivPreprintCC BY 4.0Full textMathematical physicsProbabilityarXiv
BibTeX
@misc{smid2026constanttime,
  title = {{Constant-time equilibration of observables under rapid Lindbladian dynamics}},
  author = {Štěpán Šmíd and Richard Meister and Mario Berta and Roberto Bondesan},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2608.28451},
  eprint = {2608.28451},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2608.28451},
}
RIS
TY  - UNPB
TI  - Constant-time equilibration of observables under rapid Lindbladian dynamics
AU  - Štěpán Šmíd
AU  - Richard Meister
AU  - Mario Berta
AU  - Roberto Bondesan
PY  - 2026
DA  - 2026/10/05
PB  - arXiv
DO  - 10.48550/arxiv.2608.28451
UR  - https://arxiv.org/abs/2608.28451
AB  - Markovian open-system dynamics have widespread applications throughout quantum information science, including algorithmic state preparation. Their convergence is commonly quantified using the worst case global trace distance between the evolving and stationary states. However, this criterion can be unnecessarily stringent when only physically relevant observables are of interest. Here we introduce and study observable-specific mixing times. We prove that, for quasi-local, rapidly mixing Lindbladians, sums of geometrically local observables equilibrate in a time independent of system size, in contrast to the logarithmic dependence of global state mixing. This separation reduces the runtime of dissipative quantum algorithms, including quantum Gibbs samplers, for estimating quantities such as the Gibbs state energy and local order parameters, yielding an overall scaling that is linear in system size. Complementing this quantum result, we develop a quantum-inspired classical algorithm for estimating the same quantities. Its runtime is likewise linear in system size, but scaling exponentially in 𝒪(log(1/ε)^D), where D denotes the spatial dimension of the lattice. We further analyse non-interacting Lindbladians over qudits, fermions, and bosons, demonstrating that locality of observables is not always necessary for a qualitatively faster mixing. Small-scale simulations of quantum Gibbs samplers reveal no large hidden constants in our asymptotic analysis and show that the theoretical predictions closely capture the finite-size dynamics.
ER  -