Scholarlink

<p>It has been known that two different bipartite unitary operations are perfectly distinguishable by local operations and classical communication (LOCC) when a finite number of queries is allowed. However, it has been a longstanding open problem to determine the optimal number of queries needed to distinguish bipartite unitary operations perfectly by LOCC since 2007. In this paper, we show that if two two-qubit unitary operations are perfectly distinguishable using <i>T</i> queries, they are also perfectly distinguishable in the LOCC scenario using [6π<i>T</i>] queries. As a result, LOCC operations are as powerful as global operations when using constant times the number of queries for the perfect discrimination of two-qubit unitary operations.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

On Optimal Local Discrimination Algorithm of Two-Qubit Unitary Operations

  • 期刊论文

  • 发表日期：

    2025年7月1日

查看全文
  • Peng-Hui Yao,
  • Ze-Kun Ye

摘要

It has been known that two different bipartite unitary operations are perfectly distinguishable by local operations and classical communication (LOCC) when a finite number of queries is allowed. However, it has been a longstanding open problem to determine the optimal number of queries needed to distinguish bipartite unitary operations perfectly by LOCC since 2007. In this paper, we show that if two two-qubit unitary operations are perfectly distinguishable using T queries, they are also perfectly distinguishable in the LOCC scenario using [6πT] queries. As a result, LOCC operations are as powerful as global operations when using constant times the number of queries for the perfect discrimination of two-qubit unitary operations.