arXivDaily arXiv每日学术速递 周一至周五更新
北美退伍军人节(Veterans Day),12 日无更新
arXiv 2206.09415quant-phcs.ITmath.IT
收藏

混合态压缩的强逆界

Strong Converse Bounds for Compression of Mixed States

Zahra Baghali Khanian

AI总结:

本文研究混合态可见与盲压缩的强逆界,定义新的Rényi推广量,证明可扩展态下纯化纠缠可加性,并给出一般态在超单位解码器下的强逆界。

摘要:

本文研究了混合态的可见压缩和盲压缩的强逆性质。可见压缩方案的最优速率通过纯化纠缠来刻画,而其可加性至今未知。对于可扩展态的一个变体,我们证明了纯化纠缠的可加性,并应用此结果获得了此类态在盲压缩和可见压缩下的“相当强”的逆界。即,当速率低于最优速率时,误差从0不连续地跳变到至少$\frac{1}{3\sqrt{2}}$。为处理一般态的可见压缩情形,我们定义了一个新的量$E_{α,p}(A:R)_ρ$,其中$ρ^{AR}$为二分态,$α\in (0,1)\cup (1,\infty)$,作为纯化纠缠$E_{p}(A:R)_ρ$的$α$-Rényi推广。对于$α=1$,我们定义$E_{1,p}(A:R)_ρ:=E_{p}(A:R)_ρ$。我们证明,对于任何低于正则化极限$\lim_{α\to 1^+}E_{α,p}^{\infty}(A:R)_ρ:=\lim_{α\to 1^+} \lim_{n \to \infty} \frac{E_{α,p}(A^n:R^n)_{ρ^{\otimes n}}}{n}$的速率,可见压缩的保真度指数收敛到零。此外,我们考虑一般混合态源$ρ^{AR}$的盲压缩,该源由编码器与一个不可访问的参考系统$R$共享。我们通过假设解码器是一个超单位信道,获得了该源压缩的强逆界。这立即意味着,在假设超单位解码器的情况下,混合态系综的盲压缩具有强逆性,因为这是参考系统$R$具有经典结构的一般混合态源$ρ^{AR}$的特例。

英文摘要:

In this paper, we study strong converse properties for both visible and blind compression of mixed states. The optimal rate of a visible compression scheme is obtained in terms of the entanglement of purification, whose additivity remains unknown so far. For a variation of extendible states, we prove that the entanglement of purification is additive and apply this to obtain a "pretty strong" converse bound for the blind and visible compression of such states. Namely, when the rate decreases below the optimal rate, the error exhibits a discontinuous jump from 0 to at least $\frac{1}{3\sqrt{2}}$. To deal with the visible case for general states, we define a new quantity $E_{α,p}(A:R)_ρ$ for a bipartite state $ρ^{AR}$ and $α\in (0,1)\cup (1,\infty)$ as the $α$-Rényi generalization of the entanglement of purification $E_{p}(A:R)_ρ$. For $α=1$, we define $E_{1,p}(A:R)_ρ:=E_{p}(A:R)_ρ$. We show that for any rate below the regularization $\lim_{α\to 1^+}E_{α,p}^{\infty}(A:R)_ρ:=\lim_{α\to 1^+} \lim_{n \to \infty} \frac{E_{α,p}(A^n:R^n)_{ρ^{\otimes n}}}{n}$ the fidelity for the visible compression exponentially converges to zero. Moreover, we consider blind compression of a general mixed-state source $ρ^{AR}$ shared between an encoder and an inaccessible reference system $R$. We obtain a strong converse bound for the compression of this source by assuming that the decoder is a super-unital channel. This immediately implies a strong converse for the blind compression of ensembles of mixed states, by assuming a super-unital decoder, as this is a special case of the general mixed-state source $ρ^{AR}$ where the reference system $R$ has a classical structure.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑