arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1402.0602quant-ph
收藏

可解释信息与信息权力的严格界限

Tight Bounds on the Accessible Information and the Informational Power

Michele Dall'Arno, Francesco Buscemi, Masanao Ozawa

摘要:

可访问的信息量化了可以从量子态的系综中提取的经典信息的量。类似地,信息能力量化了可以通过量子测量提取的经典信息的数量。对于这两个数量,我们提供的上限和下限,只依赖于系统的尺寸,我们证明了他们的紧密性。在对称信息完全(SIC)的合奏和测量的情况下,提供更强的界限,并证明其紧密性的量子比特和qutrits。从我们的上界,我们注意到,也许令人惊讶的是,由SIC合奏或测量产生的统计数据在任意维度,虽然最佳的层析成像的目的,实际上从来没有包含超过一个比特的信息,其余的是由完全随机的位。另一方面,从我们的下界,我们得到了一个明确的策略击败所谓的“漂亮的好”的SIC合奏和测量的情况下提取的互信息。

英文摘要:

The accessible information quantifies the amount of classical information that can be extracted from an ensemble of quantum states. Analogously, the informational power quantifies the amount of classical information that can be extracted by a quantum measurement. For both quantities, we provide upper and lower bounds that depend only on the dimension of the system, and we prove their tightness. In the case of symmetric informationally complete (SIC) ensembles and measurements, stronger bounds are provided and their tightness proved for qubits and qutrits. From our upper bounds, we notice, perhaps surprisingly, that the statistics generated by SIC ensembles or measurements in arbitrary dimension, though optimal for tomographic purposes, in fact never contains more than just one bit of information, the rest being constituted by completely random bits. On the other hand, from our lower bounds, we obtain an explicit strategy beating the so-called "pretty-good" one for the extraction of mutual information in the case of SIC ensembles and measurements.

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

↑