跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.25519 · v1

The computational complexity of bosonic Lindbladian fixed points

首次提交 2026-11-19 13:20
版本更新 2026-11-19 13:20
雷达观测 2026-11-20 19:58
arXiv ↗PDF ↗

摘要

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 RE\mathsf{RE}-hard, even for purely dissipative Lindbladians with degree-five jump operators acting on at most four modes.

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v1 · 2026-11-19 13:20 · 最新观测版本

The computational complexity of bosonic Lindbladian fixed points

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 RE\mathsf{RE}-hard, even for purely dissipative Lindbladians with degree-five jump operators acting on at most four modes.

查看此版本解读 →查看此版本原文 ↗