Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Chinese Physics Letters

Experimental Realization of Perfect Discrimination for Two Unitary Operations

Jian-Jun Liu, Zhi Hong

Published Oct 1, 2008• 1 citation
Publisher

Abstract

We experimentally demonstrate perfect discrimination between two unitary operations by using the sequential scheme proposed by Duan et al.[Phys. Rev. Lett. 98 (2007) 100503] Also, we show how to understand the scheme and to calculate the parameters for two-dimensional operations in the picture of the Bloch sphere.
DOI
10.1088/0256-307x/25/10/039

Related papers

Experimental Realization of Perfect Discrimination for Two Unitary Operations

刘建军, 洪治

我们试验性地证明在由使用顺序的计划的二单一的操作之间的完美的辨别由 Duan 等求婚了[Phys。加快。Lett。98 (2007 ) 100503 ] 也，我们显示出怎么理解计划并且在 Bloch 范围的图画为二维的操作计算参数。[从作者抽象]

Chinese Physics Letters•Jan 1, 2008•0 citations

Linear optical implementation of perfect discrimination between single-bit unitary operations

Pei Zhang, Liang Peng, Zhiwei Wang +4 more

Discrimination of unitary operations is a fundamental task of quantum information. Assisted by linear optical elements, we experimentally demonstrate perfect discrimination between single-bit unitary operations using the sequential scheme which is proved by Duan et al ( Phys. Rev. Lett. 2007 98 100503). We also make a comparison with another perfect discrimination scheme called the parallel scheme. The complexity and resource consumed are analysed.

arXiv:0801.3493•Journal of Physics B Atomic Molecular and Optical Physics•Sep 10, 2008•11 citations

Publisher’s Note: Entanglement is Not Necessary for Perfect Discrimination between Unitary Operations [Phys. Rev. Lett.PRLTAO0031-900798, 100503 (2007)]

Runyao Duan, Yuan Feng, Mingsheng Ying

Received 12 March 2007DOI:https://doi.org/10.1103/PhysRevLett.98.129901©2007 American Physical Society

Physical Review Letters•Mar 19, 2007•4 citations

Minimal number of runs and the sequential scheme for local discrimination between special unitary operations

Tian-Qing Cao, Ying‐Hui Yang, Zhichao Zhang +3 more

It has been shown that any two different multipartite unitary operations are perfectly distinguishable by local operations and classical communication with a finite number of runs. Meanwhile, two open questions were left. One is how to determine the minimal number of runs needed for the local discrimination, and the other is whether a perfect local discrimination can be achieved by merely a sequential scheme. In this paper, we answer the two questions for some unitary operations U1 and U2 with locally unitary equivalent to a diagonal unitary matrix in a product basis. Specifically, we give the minimal number of runs needed for the local discrimination, which is the same with that needed for the global discrimination. In this sense, the local operation works the same with the global one. Moreover, when adding the local property to U1 or U2, we present that the perfect local discrimination can be also realized by merely a sequential scheme with the minimal number of runs. Both results contribute to saving the resources used for the discrimination.

Scientific Reports•May 25, 2016•7 citations

Sequential scheme for locally discriminating bipartite unitary operations without inverses

Lvzhou Li

Local distinguishability of bipartite unitary operations has recently received much attention. A nontrivial and interesting question concerning this subject is whether there is a sequential scheme for locally discriminating between two bipartite unitary operations, because a sequential scheme usually represents the most economic strategy for discrimination. An affirmative answer to this question was given in the literature, however with two limitations: (i) the unitary operations to be discriminated were limited to act on $d\ensuremath{\bigotimes}d$, i.e., a two-qudit system, and (ii) the inverses of the unitary operations were assumed to be accessible, although this assumption may be unrealizable in experiment. In this paper, we improve the result by removing the two limitations. Specifically, we show that any two bipartite unitary operations acting on ${d}_{A}\ensuremath{\bigotimes}{d}_{B}$ can be locally discriminated by a sequential scheme, without using the inverses of the unitary operations. Therefore, this paper enhances the applicability and feasibility of the sequential scheme for locally discriminating unitary operations.

arXiv:1708.00971•Physical Review A•Aug 3, 2017•5 citations

Determination of locally perfect discrimination for two-qubit unitary operations

Tian-Qing Cao, Fei Gao, Ying‐Hui Yang +2 more

Quantum Information Processing•Nov 12, 2015•8 citations
It has been shown that any two different multipartite unitary operations are perfectly distinguishable by local operations and classical communication with a finite number of runs. Meanwhile, two open questions were left. One is how to determine the minimal number of runs needed for the local discrimination, and the other is whether a perfect local discrimination can be achieved by merely a sequential scheme. In this paper, we answer the two questions for some unitary operations U1 and U2 with locally unitary equivalent to a diagonal unitary matrix in a product basis. Specifically, we give the minimal number of runs needed for the local discrimination, which is the same with that needed for the global discrimination. In this sense, the local operation works the same with the global one. Moreover, when adding the local property to U1 or U2, we present that the perfect local discrimination can be also realized by merely a sequential scheme with the minimal number of runs. Both results contribute to saving the resources used for the discrimination.
Local distinguishability of bipartite unitary operations has recently received much attention. A nontrivial and interesting question concerning this subject is whether there is a sequential scheme for locally discriminating between two bipartite unitary operations, because a sequential scheme usually represents the most economic strategy for discrimination. An affirmative answer to this question was given in the literature, however with two limitations: (i) the unitary operations to be discriminated were limited to act on $d\ensuremath{\bigotimes}d$, i.e., a two-qudit system, and (ii) the inverses of the unitary operations were assumed to be accessible, although this assumption may be unrealizable in experiment. In this paper, we improve the result by removing the two limitations. Specifically, we show that any two bipartite unitary operations acting on ${d}_{A}\ensuremath{\bigotimes}{d}_{B}$ can be locally discriminated by a sequential scheme, without using the inverses of the unitary operations. Therefore, this paper enhances the applicability and feasibility of the sequential scheme for locally discriminating unitary operations.