Boundary-driven quantum systems near the Zeno limit: steady states and long-time behavior
- URL: http://arxiv.org/abs/2512.12825v1
- Date: Sun, 14 Dec 2025 20:13:54 GMT
- Title: Boundary-driven quantum systems near the Zeno limit: steady states and long-time behavior
- Authors: Eric A. Carlen, David A. Huse, Joel L. Lebowitz,
- Abstract summary: We study composite open quantum systems with a finite-dimensional state space $mathcal H_Aotimes mathcal H_B$ governed by a Lindblad equation $'(t) = mathcal L_(t)$.<n>We show that if $mathcal D_Psharp$ is ergodic and gapped, then so is $mathcal L_$ for all large $$, and if $bar_$ denotes the unique steady state for $mathcal L_$
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: We study composite open quantum systems with a finite-dimensional state space ${\mathcal H}_A\otimes {\mathcal H}_B$ governed by a Lindblad equation $ρ'(t) = {\mathcal L}_γρ(t)$ where ${\mathcal L}_γρ= -i[H,ρ] + γ{\mathcal D} ρ$, and ${\mathcal D}$ is a dissipator ${\mathcal D}_A\otimes I$ acting non-trivially only on part $A$ of the system, which can be thought of as the boundary, and $γ$ is a parameter. It is known that the dynamics simplifies for large $γ$: after a time of order $γ^{-1}$, $ρ(t)$ is well approximated for times small compared to $γ^2$ by $π_A\otimes R(t)$ where $π_A$ is a steady state of ${\mathcal D}_A$, and $R(t)$ is a solution of $\frac{\rm d}{{\rm d}t}R(t) = {\mathcal L}_{P,γ}R(t)$ where ${\mathcal L}_{P,γ} R := -i[H_P,R] + γ^{-1} {\mathcal D}_P R$ with $H_P$ being a Hamiltonian on ${\mathcal H}_B$ and ${\mathcal D}_P$ being a Lindblad generator over ${\mathcal H}_B$. We prove this assuming only that ${\mathcal D}_A$ is ergodic and gapped. In order to better control the long time behavior, and study the steady states $\barρ_γ$, we introduce a third Lindblad generator ${\mathcal D}_P^\sharp$ that does not involve $γ$, but still closely related to ${\mathcal L}_γ$. We show that if ${\mathcal D}_P^\sharp$ is ergodic and gapped, then so is ${\mathcal L}_γ$ for all large $γ$, and if $\barρ_γ$ denotes the unique steady state for ${\mathcal L}_γ$, then $\lim_{γ\to\infty}\barρ_γ= π_A\otimes \bar R$ where $\bar R$ is the unique steady state for ${\mathcal D}_P^\sharp$. We show that there is a convergent expansion $\barρ_γ= π_A\otimes\bar R +γ^{-1} \sum_{k=0}^\infty γ^{-k} \bar n_k$ where, defining $\bar n_{-1} := π_A\otimes\bar R$, ${\mathcal D} \bar n_k = -i[H,\bar n_{k-1}]$ for all $k\geq 0$.
Related papers
- Information-Computation Tradeoffs for Noiseless Linear Regression with Oblivious Contamination [65.37519531362157]
We show that any efficient Statistical Query algorithm for this task requires VSTAT complexity at least $tildeOmega(d1/2/alpha2)$.
arXiv Detail & Related papers (2025-10-12T15:42:44Z) - Approximating the operator norm of local Hamiltonians via few quantum states [53.16156504455106]
Consider a Hermitian operator $A$ acting on a complex Hilbert space of $2n$.<n>We show that when $A$ has small degree in the Pauli expansion, or in other words, $A$ is a local $n$-qubit Hamiltonian.<n>We show that whenever $A$ is $d$-local, textiti.e., $deg(A)le d$, we have the following discretization-type inequality.
arXiv Detail & Related papers (2025-09-15T14:26:11Z) - Sharp Gap-Dependent Variance-Aware Regret Bounds for Tabular MDPs [54.28273395444243]
We show that the Monotonic Value Omega (MVP) algorithm achieves a variance-aware gap-dependent regret bound of $$tildeOleft(left(sum_Delta_h(s,a)>0 fracH2 log K land mathttVar_maxtextc$.
arXiv Detail & Related papers (2025-06-06T20:33:57Z) - Long-Time Behavior of Typical Pure States from Thermal Equilibrium Ensembles [0.0]
We consider an isolated macroscopic quantum system in a pure state $psi_tinmathcalH$ evolving unitarily in a separable Hilbert space $mathcalH$.<n>In the present work, we generalize this result from the uniform distribution to a much more general class of measures, so-called GAP measures.
arXiv Detail & Related papers (2024-12-21T15:28:58Z) - Stationary states of boundary driven quantum systems: some exact results [0.40964539027092906]
We study finite-dimensional open quantum systems whose density matrix evolves via a Lindbladian, $dotrho=-i[H,rho]+mathcal Drho$.
We show that any stationary density matrix $barrho$ on the full system which commutes with $H$ must be of the product form $barrho=hatrho_Aotimesrho_B$.
arXiv Detail & Related papers (2024-08-13T13:33:56Z) - Constrained HRT Surfaces and their Entropic Interpretation [0.0]
We study the R'enyi entropies of subregion $A$ in a fixed-area state of subregion $B$.
Our results are relevant to some of the issues associated with attempts to use standard random networks to describe time dependent geometries.
arXiv Detail & Related papers (2023-11-30T06:50:40Z) - Low-degree learning and the metric entropy of polynomials [44.99833362998488]
We prove that any (deterministic or randomized) algorithm which learns $mathscrF_nd$ with $L$-accuracy $varepsilon$ requires at least $Omega(sqrtvarepsilon)2dlog n leq log mathsfM(mathscrF_n,d,|cdot|_L,varepsilon) satisfies the two-sided estimate $$c (1-varepsilon)2dlog
arXiv Detail & Related papers (2022-03-17T23:52:08Z) - Spectral properties of sample covariance matrices arising from random
matrices with independent non identically distributed columns [50.053491972003656]
It was previously shown that the functionals $texttr(AR(z))$, for $R(z) = (frac1nXXT- zI_p)-1$ and $Ain mathcal M_p$ deterministic, have a standard deviation of order $O(|A|_* / sqrt n)$.
Here, we show that $|mathbb E[R(z)] - tilde R(z)|_F
arXiv Detail & Related papers (2021-09-06T14:21:43Z) - Linear Bandits on Uniformly Convex Sets [88.3673525964507]
Linear bandit algorithms yield $tildemathcalO(nsqrtT)$ pseudo-regret bounds on compact convex action sets.
Two types of structural assumptions lead to better pseudo-regret bounds.
arXiv Detail & Related papers (2021-03-10T07:33:03Z) - Algorithms and Hardness for Linear Algebra on Geometric Graphs [14.822517769254352]
We show that the exponential dependence on the dimension dimension $d in the celebrated fast multipole method of Greengard and Rokhlin cannot be improved.
This is the first formal limitation proven about fast multipole methods.
arXiv Detail & Related papers (2020-11-04T18:35:02Z) - The Average-Case Time Complexity of Certifying the Restricted Isometry
Property [66.65353643599899]
In compressed sensing, the restricted isometry property (RIP) on $M times N$ sensing matrices guarantees efficient reconstruction of sparse vectors.
We investigate the exact average-case time complexity of certifying the RIP property for $Mtimes N$ matrices with i.i.d. $mathcalN(0,1/M)$ entries.
arXiv Detail & Related papers (2020-05-22T16:55:01Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.