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

arXiv:quant-ph/0601150 · Physical Review Letters

Entanglement is Not Necessary for Perfect Discrimination between Unitary Operations

Runyao Duan, Yuan Feng, Mingsheng Ying

Published Mar 9, 2007• 121 citations
arXivHTMLPDF

Abstract

We show that a unitary operation (quantum circuit) secretly chosen from a finite set of unitary operations can be determined with certainty by sequentially applying only a finite amount of runs of the unknown circuit. No entanglement or joint quantum operations are required in our scheme. We further show that our scheme is optimal in the sense that the number of the runs is minimal when discriminating only two unitary operations.

DOI
10.1103/physrevlett.98.100503

Related papers

Perfect Distinguishability of Quantum Operations

Runyao Duan, Yuan Feng, Mingsheng Ying

We provide a feasible necessary and sufficient condition for when an unknown quantum operation (quantum device) secretly selected from a set of known quantum operations can be identified perfectly within a finite number of queries, and thus complete the characterization of the perfect distinguishability of quantum operations. We further design an optimal protocol which can achieve the perfect discrimination between two quantum operations by a minimal number of queries. Interestingly, we find that an optimal perfect discrimination between two isometries is always achievable without auxiliary systems or entanglement.

arXiv:0908.0119•Physical Review Letters•Nov 20, 2009•126 citations

Local entanglement is not necessary for perfect discrimination between unitary operations acting on two qudits by local operations and classical communication

Lvzhou Li, Daowen Qiu

Recently, the problem of discriminating multipartite unitary operations by local operations and classical communication (LOCC) has attracted significant attention. The latest work in the literature on this problem showed that two multipartite unitary operations can always be perfectly distinguished by LOCC when a finite number of runs are allowable. However, in these schemes, local entanglement (an entangled state held by one party) was required, which seems to imply that local entanglement is necessary for perfect discrimination between unitary operations by LOCC. In this paper, we show that a perfect discrimination between two unitary operations acting on a two-qudit system can always be achieved without exploiting any entanglement. As a result, we conclude that local entanglement is not necessary for perfect discrimination between unitary operations acting on a two-qudit system by LOCC. Our result, in general, is based on the assumption made by X. F. Zhou, Y. S. Zhang, and G. C. Guo [Phys. Rev. Lett. 99, 170401 (2007)] that for any unitary operation $U$, we can obtain its reverse transformation ${U}^{\ifmmode\dagger\else\textdagger\fi{}}$ by exchanging the input and output ports of the whole setup. Thus, we further consider whether we can avoid using this assumption, and we find that for unitary operations acting on two qubits, our result can be obtained without using this assumption. However, in higher dimension how to do that seems to be unclear.

arXiv:0706.0941•Physical Review A•Mar 24, 2008•18 citations

Local unambiguous discrimination with remaining entanglement

Yangjia Li, Runyao Duan, Mingsheng Ying

A bipartite state, which is secretly chosen from a finite set of known entangled pure states, cannot immediately be useful in standard quantum information processing tasks. To effectively make use of the entanglement contained in this unknown state, we introduce a way to locally manipulate the original quantum system: either identify the state successfully or distill some pure entanglement. Remarkably, if many copies are available, we show that any finite set of entangled pure states, whether orthogonal or not, can be locally distinguished in this way, which further implies that pure entanglement can be deterministically extracted from unknown entanglement. These results make it clear why a large class of entangled bipartite quantum operations including unitary operations and measurements that are globally distinguishable can also be locally distinguishable: They can generate pure entanglement consistently.

arXiv:0912.5163•Physical Review A•Sep 30, 2010•3 citations

Optimal simulation of a perfect entangler

Nengkun Yu, Runyao Duan, Mingsheng Ying

A $2\ensuremath{\bigotimes}2$ unitary operation is called a perfect entangler if it can generate a maximally entangled state from some unentangled input. We study the following question: How many runs of a given two-qubit entangling unitary operation are required to simulate some perfect entangler with one-qubit unitary operations as free resources? We completely solve this problem by presenting an analytical formula for the optimal number of runs of the entangling operation. Our result reveals an entanglement strength of two-qubit unitary operations.

arXiv:0907.2733•Physical Review A•Mar 29, 2010•8 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

Optimal Perfect Distinguishability between Unitaries and Quantum Operations

Cheng Zhu Lu, Jianxin Chen, Runyao Duan

We study optimal perfect distinguishability between a unitary and a general quantum operation. In 2-dimensional case we provide a simple sufficient and necessary condition for sequential perfect distinguishability and an analytical formula of optimal query time. We extend the sequential condition to general d-dimensional case. Meanwhile, we provide an upper bound and a lower bound for optimal sequential query time. In the process a new iterative method is given, the most notable innovation of which is its independence to auxiliary systems or entanglement. Following the idea, we further obtain an upper bound and a lower bound of (entanglement-assisted) q-maximal fidelities between a unitary and a quantum operation. Thus by the recursion in [1] an upper bound and a lower bound for optimal general perfect discrimination are achieved. Finally our lower bound result can be extended to the case of arbitrary two quantum operations.

arXiv:1010.2298•Oct 12, 2010•3 citations
We show that a unitary operation (quantum circuit) secretly chosen from a finite set of unitary operations can be determined with certainty by sequentially applying only a finite amount of runs of the unknown circuit. No entanglement or joint quantum operations are required in our scheme. We further show that our scheme is optimal in the sense that the number of the runs is minimal when discriminating only two unitary operations.
We provide a feasible necessary and sufficient condition for when an unknown quantum operation (quantum device) secretly selected from a set of known quantum operations can be identified perfectly within a finite number of queries, and thus complete the characterization of the perfect distinguishability of quantum operations. We further design an optimal protocol which can achieve the perfect discrimination between two quantum operations by a minimal number of queries. Interestingly, we find that an optimal perfect discrimination between two isometries is always achievable without auxiliary systems or entanglement.
Recently, the problem of discriminating multipartite unitary operations by local operations and classical communication (LOCC) has attracted significant attention. The latest work in the literature on this problem showed that two multipartite unitary operations can always be perfectly distinguished by LOCC when a finite number of runs are allowable. However, in these schemes, local entanglement (an entangled state held by one party) was required, which seems to imply that local entanglement is necessary for perfect discrimination between unitary operations by LOCC. In this paper, we show that a perfect discrimination between two unitary operations acting on a two-qudit system can always be achieved without exploiting any entanglement. As a result, we conclude that local entanglement is not necessary for perfect discrimination between unitary operations acting on a two-qudit system by LOCC. Our result, in general, is based on the assumption made by X. F. Zhou, Y. S. Zhang, and G. C. Guo [Phys. Rev. Lett. 99, 170401 (2007)] that for any unitary operation UUU, we can obtain its reverse transformation ${U}^{\ifmmode\dagger\else\textdagger\fi{}}$ by exchanging the input and output ports of the whole setup. Thus, we further consider whether we can avoid using this assumption, and we find that for unitary operations acting on two qubits, our result can be obtained without using this assumption. However, in higher dimension how to do that seems to be unclear.
A bipartite state, which is secretly chosen from a finite set of known entangled pure states, cannot immediately be useful in standard quantum information processing tasks. To effectively make use of the entanglement contained in this unknown state, we introduce a way to locally manipulate the original quantum system: either identify the state successfully or distill some pure entanglement. Remarkably, if many copies are available, we show that any finite set of entangled pure states, whether orthogonal or not, can be locally distinguished in this way, which further implies that pure entanglement can be deterministically extracted from unknown entanglement. These results make it clear why a large class of entangled bipartite quantum operations including unitary operations and measurements that are globally distinguishable can also be locally distinguishable: They can generate pure entanglement consistently.
A $2\ensuremath{\bigotimes}2$ unitary operation is called a perfect entangler if it can generate a maximally entangled state from some unentangled input. We study the following question: How many runs of a given two-qubit entangling unitary operation are required to simulate some perfect entangler with one-qubit unitary operations as free resources? We completely solve this problem by presenting an analytical formula for the optimal number of runs of the entangling operation. Our result reveals an entanglement strength of two-qubit unitary operations.
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.
We study optimal perfect distinguishability between a unitary and a general quantum operation. In 2-dimensional case we provide a simple sufficient and necessary condition for sequential perfect distinguishability and an analytical formula of optimal query time. We extend the sequential condition to general d-dimensional case. Meanwhile, we provide an upper bound and a lower bound for optimal sequential query time. In the process a new iterative method is given, the most notable innovation of which is its independence to auxiliary systems or entanglement. Following the idea, we further obtain an upper bound and a lower bound of (entanglement-assisted) q-maximal fidelities between a unitary and a quantum operation. Thus by the recursion in [1] an upper bound and a lower bound for optimal general perfect discrimination are achieved. Finally our lower bound result can be extended to the case of arbitrary two quantum operations.