跳到正文
研踪PaperTrail

论文库

检索计算机领域论文,按研究方向、作者或关键词筛选。

部分采集异常
正在读取账号与研究记录…

全站更新概况

+0新增论文
+0其中 AI 相关
+0已有论文修订
+91新增 AI 导读

arXiv 最近完成扫描:2026-11-22 21:02 · 全站最近入库:2026-11-21 12:19各信源进度 →

统计口径与数据新鲜度

统计 2026-11-22 00:50 — 2026-11-23 00:50(北京时间) · 点击数字查看对应简报;AI 相关包含在新增论文内。

最近完成检查:2026-11-22 21:02最近发现新增版本:2026-11-21 12:19库内论文最新更新时间:2026-11-20 02:59

每分钟刷新已保存的数据。空检查不代表采集异常;新收录可能包含历史论文。AI 导读按新增版本计数。

29,158 已收录论文24,181 AI 相关8,992 有修订112 HF 社区发现

浏览论文库

时间范围跟随排序:版本更新、本站收录或首次发表。最新收录可能包含历史论文。部分信源异常,查看状态 →

找到 1 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-22 21:00(北京时间)
新论文 · v1arXiv:2611.25519

The computational complexity of bosonic Lindbladian fixed points

En-Jui Kuo, Arsalan Motamedi, Mohammad Hafezi, Saeed Mehraban

原文摘要

We study the computational complexity of estimating observables and sampling from stationary states, or fixed points, of bosonic Lindbladian dynamics with bounded-degree polynomial interactions. While the complexity of transient bosonic dynamics has been investigated, understanding the computational power of bosonic fixed points requires addressing subtleties of infinite-dimensional systems, including the existence, uniqueness, and convergence of stationary states. We establish a broad complexity landscape spanning universal quantum computation, efficient classical simulation, sampling hardness, and undecidability. First, we show that universal quantum computation can be embedded into observable estimation at the unique fixed point of a bosonic Lindbladian with a Hamiltonian of degree at most twelve and only linear photon loss. Moreover, this fixed point can be prepared from vacuum in polynomial time. On the classical side, we identify Gaussian regimes with incoherent pumping that admit efficient photon-number sampling and establish stability of classical approximability under sufficiently weak non-Gaussian Kerr perturbations. Conversely, for Gaussian fixed points without incoherent pumping, we establish hardness of exact sampling under constant-rate linear loss and hardness of approximate sampling at inverse-polynomial loss rates under standard boson-sampling conjectures. We also relate sampling from non-Gaussian fixed points to variants of boson sampling. Finally, we prove that deciding the existence of a stationary density operator is $\mathsf{RE}$-hard, even for purely dissipative Lindbladians with degree-five jump operators acting on at most four modes.

quant-ph · cs.CC