可降解和抗降解通道的计算可扩展性
Computational distinguishability of degradable and antidegradable channels
摘要：
如果存在将通道的输出状态映射到环境状态的第二通道，则通道是可降解的。这些通道满足输出状态比环境包含更多关于输入的信息的属性。信道的补充类是抗退化信道，其允许将环境状态映射到信道的输出状态的信道。在本文中，我们表明，区分两个通道的计算问题仍然PSPACE完全时，限制到这些类别的通道。这是使用一个建设的Curiminal，Ruskai，和史密斯嵌入任何通道到一个可降解的通道，和相关的建设的情况下，抗降解通道。
英文摘要：
A channel is degradable if there exists a second channel that maps the output state of the channel to the environment state. These channels satisfy the property that the output state contains more information about the input than the environment does. A complementary class of channels is the antidegradable channels, which admit channels that map the environment state to the output state of the channel. In this paper we show that the computational problem of distinguishing two channels remains PSPACE-complete when restricted to these classes of channels. This is shown using a construction of Cubitt, Ruskai, and Smith that embeds any channel into a degradable channel, and a related construction for the case of antidegradable channels.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
