Processing math: 100%
We use cookies to improve your experience with our site.

Indexed in:

SCIE, EI, Scopus, INSPEC, DBLP, CSCD, etc.

Submission System
(Author / Reviewer / Editor)
Peng-Hui Yao, Ze-Kun Ye. On Optimal Local Discrimination Algorithm of Two-Qubit Unitary Operations[J]. Journal of Computer Science and Technology. DOI: 10.1007/s11390-025-4120-1
Citation: Peng-Hui Yao, Ze-Kun Ye. On Optimal Local Discrimination Algorithm of Two-Qubit Unitary Operations[J]. Journal of Computer Science and Technology. DOI: 10.1007/s11390-025-4120-1

On Optimal Local Discrimination Algorithm of Two-Qubit Unitary Operations

Funds: This work is supported by National Natural Science Foundation of China under Grant No. 62332009, 12347104, 61972191, and Innovation Program for Quantum Science and Technology under Grant No. 2021ZD0302901.
More Information
  • Received Date: January 11, 2024
  • Revised Date: November 23, 2024
  • Accepted Date: January 18, 2025
  • 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 is still 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.

Catalog

    Article views (70) PDF downloads (6) Cited by()
    Related

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return