Suppr超能文献

通过局部操作和经典通信实现两比特酉算子的区分

Discrimination of two-qubit unitaries via local operations and classical communication.

作者信息

Bae Joonwoo

机构信息

Department of Applied Mathematics, Hanyang University (ERICA), 55 Hanyangdaehak-ro, Ansan, Gyeonggi-do, 426-791, Korea.

出版信息

Sci Rep. 2015 Dec 15;5:18270. doi: 10.1038/srep18270.

Abstract

Distinguishability is a fundamental and operational measure generally connected to information applications. In quantum information theory, from the postulates of quantum mechanics it often has an intrinsic limitation, which then dictates and also characterises capabilities of related information tasks. In this work, we consider discrimination between bipartite two-qubit unitary transformations by local operations and classical communication (LOCC) and its relations to entangling capabilities of given unitaries. We show that a pair of entangling unitaries which do not contain local parts, if they are perfectly distinguishable by global operations, can also be perfectly distinguishable by LOCC. There also exist non-entangling unitaries, e.g. local unitaries, that are perfectly discriminated by global operations but not by LOCC. The results show that capabilities of LOCC are strictly restricted than global operations in distinguishing bipartite unitaries for a finite number of repetitions, contrast to discrimination of a pair of bipartite states and also to asymptotic discrimination of unitaries.

摘要

可区分性是一种基本的操作性度量,通常与信息应用相关联。在量子信息理论中,根据量子力学的假设,它往往存在内在局限性,进而决定并表征相关信息任务的能力。在这项工作中,我们考虑通过局部操作和经典通信(LOCC)对二分双量子比特酉变换进行区分,以及它与给定酉算子的纠缠能力之间的关系。我们表明,一对不包含局部部分的纠缠酉算子,如果它们能被全局操作完美区分,那么也能被LOCC完美区分。也存在非纠缠酉算子,例如局部酉算子,它们能被全局操作完美区分,但不能被LOCC区分。结果表明,在有限次数的重复中,对于区分二分酉算子,LOCC的能力比全局操作受到更严格的限制,这与一对二分态的区分以及酉算子的渐近区分形成对比。

https://cdn.ncbi.nlm.nih.gov/pmc/blobs/9326/4678400/204e44f47c1f/srep18270-f1.jpg

文献AI研究员

20分钟写一篇综述,助力文献阅读效率提升50倍。

立即体验

用中文搜PubMed

大模型驱动的PubMed中文搜索引擎

马上搜索

文档翻译

学术文献翻译模型,支持多种主流文档格式。

立即体验