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:0807.1364 · Physical Review A

Locality and nonlocality in quantum pure-state identification problems

Yuki Ishida, T. Hashimoto, M. Horibe, A. Hayashi

Published Jul 8, 2008• 13 citations
arXivHTMLPDF

Abstract

Suppose we want to identify an input state with one of two unknown reference states, where the input state is guaranteed to be equal to one of the reference states. We assume that no classical knowledge of the reference states is given, but a certain number of copies of them are available instead. Two reference states are independently and randomly chosen from the state space in a unitary invariant way. This is called the quantum state identification problem, and the task is to optimize the mean identification success probability. In this paper, we consider the case where each reference state is pure and bipartite, and generally entangled. The question is whether the maximum mean identification success probability can be attained by means of a local operations and classical communication (LOCC) measurement scheme. Two types of identification problem are considered when a single copy of each reference state is available. We show that a LOCC scheme attains the globally achievable identification probability in the minimum-error identification problem. In the unambiguous identification problem, however, the maximal success probability by means of LOCC is shown to be less than the globally achievable identification probability.

DOI
10.1103/physreva.78.012309

Related papers

Local Quantum Pure-state Identification without Classical Knowledge

Yuki Ishida, T. Hashimoto, M. Horibe +1 more

Suppose we want to distinguish two quantum pure states. We consider the case in which no classical knowledge on the two states is given and only a pair of samples of the two states is available. This problem is called quantum pure-state identification problem. Our task is to optimize the mean identification success probability, which is averaged over an independent unitary invariant distribution of the two reference states. In this paper, the two states are assumed bipartite states which are generally entangled. The question is whether the maximum mean identification success probability can be attained by means of an LOCC (Local Operations and Classical Communication) measurement scheme. We will show that this is possible by constructing a POVM which respects the conditions of LOCC.

arXiv:0712.2906•Dec 18, 2007•0 citations

Quantum pure-state identification

A. Hayashi, M. Horibe, T. Hashimoto

We address a problem of identifying a given pure state with one of two reference pure states, when no classical knowledge on the reference states is given, but a certain number of copies of them are available. We assume the input state is guaranteed to be either one of the two reference states. This problem, which we call quantum pure state identification, is a natural generalization of the standard state discrimination problem. The two reference states are assumed to be independently distributed in a unitary invariant way in the whole state space. We give a complete solution for the averaged maximal success probability of this problem for an arbitrary number of copies of the reference states in general dimension. It is explicitly shown that the obtained mean identification probability approaches the mean discrimination probability as the number of the reference copies goes to infinity.

arXiv:quant-ph/0507237•Physical Review A•Nov 7, 2005•52 citations

Nonlocality in unambiguous pure-state identification without classical knowledge

A. Hayashi, Yuki Ishida, T. Hashimoto +1 more

For two bipartite pure states, we consider the problem of unambiguous identification without classical knowledge on the states. The optimal success probability by means of local operations and classical communication is shown to be less than the maximum attainable by the global measuring scheme.

arXiv:0801.0128•Dec 30, 2007•0 citations

Unambiguous pure-state identification without classical knowledge

A. Hayashi, M. Horibe, T. Hashimoto

We study how to unambiguously identify a given quantum pure state with one of the two reference pure states when no classical knowledge on the reference states is given but a certain number of copies of each reference quantum state are presented. By unambiguous identification, we mean that we are not allowed to make a mistake but our measurement can produce an inconclusive result. Assuming the two reference states are independently distributed over the whole pure state space in a unitary invariant way, we determine the optimal mean success probability for an arbitrary number of copies of the reference states and a general dimension of the state space. It is explicitly shown that the obtained optimal mean success probability asymptotically approaches that of the unambiguous discrimination as the number of the copies of the reference states increases.

arXiv:quant-ph/0510015•Physical Review A•Jan 20, 2006•49 citations

When Do Local Operations and Classical Communication Suffice for Two-Qubit State Discrimination?

Eric Chitambar, Runyao Duan, Min-Hsiu Hsieh

In this paper, we consider the conditions under which a given ensemble of two-qubit states can be optimally distinguished by local operations and classical communication (LOCC). We begin by completing the perfect distinguishability problem of two-qubit ensembles-both for separable operations and LOCC-by providing necessary and sufficient conditions for the perfect discrimination of one pure and one mixed state. Then, for the well-known task of minimum error discrimination, it is shown that almost all two-qubit ensembles consisting of three pure states cannot be optimally discriminated using LOCC. This is surprising considering that any two pure states can be distinguished optimally by LOCC. Special attention is given to ensembles that lack entanglement, and we prove an easy sufficient condition for when a set of three product states cannot be optimally distinguished by LOCC, thus providing new examples of the phenomenon known as non-locality without entanglement. We next consider an example of N parties who each share the same state but who are ignorant of its identity. The state is drawn from the rotationally invariant trine ensemble, and we establish a tight connection between the N-copy ensemble and Shor's lifted single-copy ensemble. For any finite N, we prove that optimal identification of the states cannot be achieved by LOCC; however, as N→∞, LOCC can indeed discriminate the states optimally. This is the first result of its kind. Finally, we turn to the task of unambiguous discrimination and derive new lower bounds on the LOCC inconclusive probability for symmetric states. When applied to the double trine ensemble, this leads to a rather different distinguishability character than when the minimum error probability is considered.

arXiv:1308.1737•IEEE Transactions on Information Theory•Jan 31, 2014•46 citations

Quantum nonlocality without entanglement and state discrimination measures

Shayeef Murshid, Tathagata Gupta, Vincent Russo +1 more

An ensemble of product states is said to exhibit “quantum nonlocality without entanglement” if it cannot be optimally discriminated using local operations and classical communication (LOCC). We show that this property can depend on the chosen discrimination measure. Specifically, we construct a family of ensembles, each consisting of six linearly independent, equally probable bipartite product states, for which LOCC fails to achieve optimal minimum-error discrimination but succeeds in achieving optimal unambiguous discrimination. We further extend our construction to multipartite systems and provide strong numerical evidence that a similar separation between local and global optima is present for minimum-error discrimination, but not for unambiguous discrimination.

arXiv:2506.20560•Quantum•Jul 23, 2026•0 citations
Suppose we want to identify an input state with one of two unknown reference states, where the input state is guaranteed to be equal to one of the reference states. We assume that no classical knowledge of the reference states is given, but a certain number of copies of them are available instead. Two reference states are independently and randomly chosen from the state space in a unitary invariant way. This is called the quantum state identification problem, and the task is to optimize the mean identification success probability. In this paper, we consider the case where each reference state is pure and bipartite, and generally entangled. The question is whether the maximum mean identification success probability can be attained by means of a local operations and classical communication (LOCC) measurement scheme. Two types of identification problem are considered when a single copy of each reference state is available. We show that a LOCC scheme attains the globally achievable identification probability in the minimum-error identification problem. In the unambiguous identification problem, however, the maximal success probability by means of LOCC is shown to be less than the globally achievable identification probability.
Suppose we want to distinguish two quantum pure states. We consider the case in which no classical knowledge on the two states is given and only a pair of samples of the two states is available. This problem is called quantum pure-state identification problem. Our task is to optimize the mean identification success probability, which is averaged over an independent unitary invariant distribution of the two reference states. In this paper, the two states are assumed bipartite states which are generally entangled. The question is whether the maximum mean identification success probability can be attained by means of an LOCC (Local Operations and Classical Communication) measurement scheme. We will show that this is possible by constructing a POVM which respects the conditions of LOCC.
We address a problem of identifying a given pure state with one of two reference pure states, when no classical knowledge on the reference states is given, but a certain number of copies of them are available. We assume the input state is guaranteed to be either one of the two reference states. This problem, which we call quantum pure state identification, is a natural generalization of the standard state discrimination problem. The two reference states are assumed to be independently distributed in a unitary invariant way in the whole state space. We give a complete solution for the averaged maximal success probability of this problem for an arbitrary number of copies of the reference states in general dimension. It is explicitly shown that the obtained mean identification probability approaches the mean discrimination probability as the number of the reference copies goes to infinity.
We study how to unambiguously identify a given quantum pure state with one of the two reference pure states when no classical knowledge on the reference states is given but a certain number of copies of each reference quantum state are presented. By unambiguous identification, we mean that we are not allowed to make a mistake but our measurement can produce an inconclusive result. Assuming the two reference states are independently distributed over the whole pure state space in a unitary invariant way, we determine the optimal mean success probability for an arbitrary number of copies of the reference states and a general dimension of the state space. It is explicitly shown that the obtained optimal mean success probability asymptotically approaches that of the unambiguous discrimination as the number of the copies of the reference states increases.
In this paper, we consider the conditions under which a given ensemble of two-qubit states can be optimally distinguished by local operations and classical communication (LOCC). We begin by completing the perfect distinguishability problem of two-qubit ensembles-both for separable operations and LOCC-by providing necessary and sufficient conditions for the perfect discrimination of one pure and one mixed state. Then, for the well-known task of minimum error discrimination, it is shown that almost all two-qubit ensembles consisting of three pure states cannot be optimally discriminated using LOCC. This is surprising considering that any two pure states can be distinguished optimally by LOCC. Special attention is given to ensembles that lack entanglement, and we prove an easy sufficient condition for when a set of three product states cannot be optimally distinguished by LOCC, thus providing new examples of the phenomenon known as non-locality without entanglement. We next consider an example of N parties who each share the same state but who are ignorant of its identity. The state is drawn from the rotationally invariant trine ensemble, and we establish a tight connection between the N-copy ensemble and Shor's lifted single-copy ensemble. For any finite N, we prove that optimal identification of the states cannot be achieved by LOCC; however, as N→∞, LOCC can indeed discriminate the states optimally. This is the first result of its kind. Finally, we turn to the task of unambiguous discrimination and derive new lower bounds on the LOCC inconclusive probability for symmetric states. When applied to the double trine ensemble, this leads to a rather different distinguishability character than when the minimum error probability is considered.
An ensemble of product states is said to exhibit “quantum nonlocality without entanglement” if it cannot be optimally discriminated using local operations and classical communication (LOCC). We show that this property can depend on the chosen discrimination measure. Specifically, we construct a family of ensembles, each consisting of six linearly independent, equally probable bipartite product states, for which LOCC fails to achieve optimal minimum-error discrimination but succeeds in achieving optimal unambiguous discrimination. We further extend our construction to multipartite systems and provide strong numerical evidence that a similar separation between local and global optima is present for minimum-error discrimination, but not for unambiguous discrimination.