Locally accessible information: How much can the parties gain by cooperating?
英文摘要:
We investigate measurements of bipartite ensembles restricted to local operations and classical communication and find a universal Holevo-like upper bound on the locally accessible information. We analyze our bound and exhibit a class of states which saturate it. Finally, we link the bound to the problem of quantification of the nonlocality of the operations necessary to extract locally unaccessible information.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。