SearcharxivSearch

arXiv · 2512.12825

Boundary-driven quantum systems near the Zeno limit: steady states and long-time behavior

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 $\rho'(t) = {\mathcal L}_\gamma \rho(t)$ where ${\mathcal L}_\gamma\rho = -i[H,\rho] + \gamma {\mathcal D} \rho$, 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 $\gamma$ is a parameter. It is known that the dynamics simplifies for large $\gamma$: after a time of order $\gamma^{-1}$, $\rho(t)$ is well approximated for times small compared to $\gamma^2$ by $\pi_A\otimes R(t)$ where $\pi_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,\gamma}R(t)$ where ${\mathcal L}_{P,\gamma} R := -i[H_P,R] + \gamma^{-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\rho_\gamma$, we introduce a third Lindblad generator ${\mathcal D}_P^\sharp$ that does not involve $\gamma$, but still closely related to ${\mathcal L}_\gamma$. We show that if ${\mathcal D}_P^\sharp$ is ergodic and gapped, then so is ${\mathcal L}_\gamma$ for all large $\gamma$, and if $\bar\rho_\gamma$ denotes the unique steady state for ${\mathcal L}_\gamma$, then $\lim_{\gamma\to\infty}\bar\rho_\gamma = \pi_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\rho_\gamma = \pi_A\otimes\bar R +\gamma^{-1} \sum_{k=0}^\infty \gamma^{-k} \bar n_k$ where, defining $\bar n_{-1} := \pi_A\otimes\bar R$, ${\mathcal D} \bar n_k = -i[H,\bar n_{k-1}]$ for all $k\geq 0$.

Explore related subjects

Keep this discovery

BibTeXRIS

Eric A. Carlen, David A. Huse, Joel L. Lebowitz. 2025-12-14. Boundary-driven quantum systems near the Zeno limit: steady states and long-time behavior. https://arxiv.org/abs/2512.12825

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Probing the Error-Mitigation Threshold with Matrix Product States

Quantum error mitigation relies on accurate noise characterization, but mismatches between the actual and characterized noise can be amplified and drive a sharp threshold between successful and failed mitigation. In random circuits, this threshold maps onto a random-field Ising transition, but previous exact numerics were limited to small one-dimensional and all-to-all systems, leaving explicit two-dimensional architectures unresolved. We develop a fixed-bond-dimension matrix-product-state method for the replicated transfer dynamics that extends threshold calculations beyond exact propagation while retaining the finite-size signatures of the transition. At system sizes beyond previous exact studies, we recover the predicted absence of a threshold for quenched disorder in 1D, obtain a sharper annealed all-to-all critical point, and resolve architecture-dependent finite-depth thresholds in 2D square and heavy-hex circuits. These results establish replicated tensor-network dynamics as a practical tool for probing error-mitigation thresholds in large and higher-dimensional noisy circuits.

quant-ph

Low-cost algorithm-to-execution framework for surface-code quantum computing

The execution of useful quantum algorithms on fault-tolerant processors requires more than a mapping from logical gates to encoded operations: the spatial organization, non-Clifford resource supply, and execution schedule must also be determined while keeping physical overhead within practical limits. Although the theoretical hierarchy from logical circuits to fault-tolerant operations is well established, these implementation choices are often specified and optimized separately. Here we develop a low-cost algorithm-to-execution framework for surface-code quantum computing. From hierarchical algorithm descriptions, it constructs dependency-preserving logical schedules and an executable workload capturing logical interactions, operation parallelism, and time-resolved non-Clifford demand, thereby linking logical computation to surface-code organization, resource-state preparation, and fault-tolerant execution in a traceable workflow. We apply the framework to twenty benchmark circuits across seven algorithm families and a hierarchically composed application-scale elliptic-curve discrete-logarithm workload. Physical costs vary substantially even for circuits with similar logical resource counts. Under our direct-rotation calibration, non-Clifford implementation selection reduces space-time volume by up to 241.5 times versus an all-synthesis baseline for the QAOA amplitude-amplification workload. Circuit-specific surface-code layouts reduce routed-latency estimates for all twenty benchmarks; thirteen also reduce space-time volume because communication savings outweigh added spatial overhead. These results show that low-cost fault-tolerant execution depends on computation scheduling and organization, not aggregate logical resource counts alone.

quant-ph

Sample-optimal learning of stabilizer states

It is well-known that learning a pure $n$-qubit stabilizer state $|\psi\rangle$ both requires, and can be accomplished with, access to a number of copies of $|\psi\rangle$ linear in $n$. However, the precise constant coefficient of this scaling does not appear to have been determined. Here we prove that $L_\delta(n)$, the smallest number of copies from which a quantum procedure can identify any stabilizer state with failure probability at most $0<\delta<1/8$, satisfies $n+\lceil\log_2(1/\delta)\rceil-3\leq L_\delta(n)\leq n+\left\lceil\log_2(1/\delta)\right\rceil+4$. We present a polynomial-time quantum learning algorithm that saturates this bound, achieving a constant factor improvement in sample-complexity over previously known approaches. As an immediate corollary, we obtain via the Choi-Jamiolkowski isomorphism an algorithm for learning an unknown $n$-qubit Clifford unitary from $2n+\left\lceil\log_2(1/\delta)\right\rceil+4$ queries, the $n$-dependence of which we show to be optimal. Our proof technique, which involves Fourier analysis on the abelian group $\mathbb{Z}_4^n \times \mathbb{F}_2^{n(n-1)/2}$, seems to be qualitatively different to previous approaches to stabilizer state learning, and may be of some independent interest; in particular, it admits natural generalisations to further problems in quantum learning theory.

quant-ph