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

Entanglement-assisted state discrimination and entanglement preservation

Özenç Güngör, S. Turgut

Published Sep 28, 2016• 19 citations
arXivHTMLPDF

Abstract

In this paper, the following scenario is considered: there are two qubits possessed by two parties at different locations. Qubits have been prepared in one of a maximum of four, mutually-orthogonal, entangled states and the parties wish to distinguish between the states by using local operations and classical communication. Although in general it is not possible to distinguish between four arbitrary states, the parties can spend some preshared entanglement to achieve perfect discrimination between four qubit states and can also preserve the entanglement of the states after discrimination. This is shown by employing the theory of majorization and the connections between entanglement transformations and state discrimination protocols.

DOI
10.1103/physreva.94.032330

Related papers

Unbounded entanglement-sustaining sequential local quantum state discrimination

Debarupa Saha, Priya Ghosh, Kornikar Sen +2 more

Two pure orthogonal quantum states can be perfectly distinguished by sequential local action of multiple pairs of parties. However, this process typically leads to the complete dissolution of entanglement in the states being discriminated. We propose a protocol that allows an arbitrary number of pairs of parties to distinguish between any two orthogonal, entangled, two-qubit pure states using local quantum operations and classical communication, with a success probability greater than that of random guessing, while ensuring that at each step, the individual ensemble states retain a finite amount of entanglement. Our protocol employs the minimum-error state discrimination approach. For demonstrating the retention of entanglement in the ensemble states at each step, we use logarithmic negativity as well as the concept of entanglement witnessing. For a large family of sets of the two states, the success probability of discrimination can be as close as required to unity, while sustaining a finite amount of entanglement in each step.

arXiv:2506.06466•Physical Review A•Jun 12, 2026•0 citations

TRADE-OFFS IN DISTINGUISHING TWO-QUBIT STATE PREPARATIONS USING ONE-WAY LOCC

Alvin Gonzales

Quantum state discrimination is a fundamental problem in quantum information science. We investigate the optimal distinguishability of orthogonal two-qubit (bipartite) quantum states. The scenario consists of three parties: Alice, Bob, and Charlie. Charlie prepares one of two orthogonal states and sends one qubit to Alice and the other to Bob. Their goal is to correctly identify which state Charlie sent. In most state discrimination scenarios, it is assumed that Alice and Bob can freely communicate with one another so as to collectively agree on the best guess. In this research, we consider a more restricted setting where only one-way classical communication is possible from Alice to Bob. Under this setting, we study two figures of merit (i) Alice's optimal probability, $P$, of identifying the state , and (ii) Alice's optimal probability, $P^\perp$, of identifying the state along with helping Bob identify the state perfectly. We show that in general $P\neq P^\perp$ and we prove a theorem for when $P=P^\perp$. We also found that the maximum of $P-P^\perp$ can arbitrarily approach $1/2$.

•Jan 1, 2017•0 citations

Locally distinguish orthogonal quantum states with entanglement resources

Zhichao Zhang

It is known that many sets of orthogonal quantum states, which cannot be distinguished perfectly by local operations and classical communication (LOCC), have been constructed. However, these discussions have left the following open question: How many entanglement resources are necessary and/or sufficient for this task to be possible with LOCC? In this paper, we present a local discrimination protocol which uses entanglement more efficiently than teleportation to distinguish one class of orthogonal product states in 3⊗3⊗3. Then, we generalize it for 3⊗3⊗...⊗3 quantum systems which has 3n parties. For the open question, our results offer rather general insight into why entanglement is useful for such tasks, and present a better understanding of the relationship between entanglement and nonlocality.

IEEE International Conference on Signal, Information and Data Processing (ICSIDP)•Dec 1, 2019•0 citations

Entanglement and perfect discrimination of a class of multiqubit states by local operations and classical communication

Somshubhro Bandyopadhyay

It is shown that while entanglement ensures difficulty in discriminating a set of mutually orthogonal states perfectly by local operations and classical communication (LOCC), entanglement content does not. In particular, for a class of entangled multiqubit states, the maximum number of perfectly LOCC distinguishable orthogonal states is shown to be independent of the average entanglement of the states, and the spatial configuration with respect to which LOCC operations may be carried out. It is also pointed out that for this class, the makeup of an ensemble, that is whether it consists only of entangled states or not, determines the maximum number of perfectly distinguishable states.

Physical Review A•Feb 25, 2010•17 citations

Entanglement-Assisted Discrimination of Nonlocal Sets of Orthogonal States

Ziying Hou, Huaqi Zhou, Limin Gao

Entanglement-assisted discrimination of orthogonal quantum states exhibiting quantum nonlocality is a frontier topic in quantum information theory. In this paper, we investigate the role of multipartite entanglement and develop resource-efficient LOCC discrimination protocols for nonlocal sets of orthogonal states, including multipartite orthogonal product-state sets and entangled-state sets with different nonlocal features. By incorporating controlled-NOT (CNOT) operations into the discrimination procedure, we construct protocols for genuinely nonlocal GHZ bases in four- and five-qubit systems that require only a single EPR pair. For the same target sets, we compare different entanglement-assisted schemes and identify those with lower entanglement consumption. We further observe that, on average, protocols avoiding teleportation consume fewer resources than teleportation-based approaches. In addition, when higher-partite GHZ-type resources (with $n>3$) are available among suitable subsystems, they can in some cases reduce the overall entanglement cost. Our results highlight the operational significance of multipartite entanglement and provide practical protocols for the local discrimination of orthogonal state sets exhibiting quantum nonlocality.

quant-pharXiv:2603.12535•Mar 16, 2026•0 citations

On entanglement and perfect LOCC discrimination of a class of multiqubit states

Somshubhro Bandyopadhyay

It is shown that while entanglement remains a significant factor in discriminating a set of mutually orthogonal entangled states perfectly by local operations and classical communication (LOCC), entanglement content is not. In particular, for a class of entangled multi-qubit states, the maximum number of perfectly LOCC distinguishable orthogonal states is shown to be independent of the average entanglement of the states, and the spatial configuration with respect to which LOCC operations may be carried out. It is also pointed out that the make-up of an ensemble, that is, whether it consists only of entangled states or is a mix of both entangled and product states, determines the maximum number of perfectly distinguishable states.

arXiv:0907.1754•Jul 10, 2009•0 citations
In this paper, the following scenario is considered: there are two qubits possessed by two parties at different locations. Qubits have been prepared in one of a maximum of four, mutually-orthogonal, entangled states and the parties wish to distinguish between the states by using local operations and classical communication. Although in general it is not possible to distinguish between four arbitrary states, the parties can spend some preshared entanglement to achieve perfect discrimination between four qubit states and can also preserve the entanglement of the states after discrimination. This is shown by employing the theory of majorization and the connections between entanglement transformations and state discrimination protocols.
Two pure orthogonal quantum states can be perfectly distinguished by sequential local action of multiple pairs of parties. However, this process typically leads to the complete dissolution of entanglement in the states being discriminated. We propose a protocol that allows an arbitrary number of pairs of parties to distinguish between any two orthogonal, entangled, two-qubit pure states using local quantum operations and classical communication, with a success probability greater than that of random guessing, while ensuring that at each step, the individual ensemble states retain a finite amount of entanglement. Our protocol employs the minimum-error state discrimination approach. For demonstrating the retention of entanglement in the ensemble states at each step, we use logarithmic negativity as well as the concept of entanglement witnessing. For a large family of sets of the two states, the success probability of discrimination can be as close as required to unity, while sustaining a finite amount of entanglement in each step.
Quantum state discrimination is a fundamental problem in quantum information science. We investigate the optimal distinguishability of orthogonal two-qubit (bipartite) quantum states. The scenario consists of three parties: Alice, Bob, and Charlie. Charlie prepares one of two orthogonal states and sends one qubit to Alice and the other to Bob. Their goal is to correctly identify which state Charlie sent. In most state discrimination scenarios, it is assumed that Alice and Bob can freely communicate with one another so as to collectively agree on the best guess. In this research, we consider a more restricted setting where only one-way classical communication is possible from Alice to Bob. Under this setting, we study two figures of merit (i) Alice's optimal probability, PPP, of identifying the state , and (ii) Alice's optimal probability, P⊥P^\perpP⊥, of identifying the state along with helping Bob identify the state perfectly. We show that in general P≠P⊥P\neq P^\perpP=P⊥ and we prove a theorem for when P=P⊥P=P^\perpP=P⊥. We also found that the maximum of P−P⊥P-P^\perpP−P⊥ can arbitrarily approach 1/21/21/2.
It is known that many sets of orthogonal quantum states, which cannot be distinguished perfectly by local operations and classical communication (LOCC), have been constructed. However, these discussions have left the following open question: How many entanglement resources are necessary and/or sufficient for this task to be possible with LOCC? In this paper, we present a local discrimination protocol which uses entanglement more efficiently than teleportation to distinguish one class of orthogonal product states in 3⊗3⊗3. Then, we generalize it for 3⊗3⊗...⊗3 quantum systems which has 3n parties. For the open question, our results offer rather general insight into why entanglement is useful for such tasks, and present a better understanding of the relationship between entanglement and nonlocality.
It is shown that while entanglement ensures difficulty in discriminating a set of mutually orthogonal states perfectly by local operations and classical communication (LOCC), entanglement content does not. In particular, for a class of entangled multiqubit states, the maximum number of perfectly LOCC distinguishable orthogonal states is shown to be independent of the average entanglement of the states, and the spatial configuration with respect to which LOCC operations may be carried out. It is also pointed out that for this class, the makeup of an ensemble, that is whether it consists only of entangled states or not, determines the maximum number of perfectly distinguishable states.
Entanglement-assisted discrimination of orthogonal quantum states exhibiting quantum nonlocality is a frontier topic in quantum information theory. In this paper, we investigate the role of multipartite entanglement and develop resource-efficient LOCC discrimination protocols for nonlocal sets of orthogonal states, including multipartite orthogonal product-state sets and entangled-state sets with different nonlocal features. By incorporating controlled-NOT (CNOT) operations into the discrimination procedure, we construct protocols for genuinely nonlocal GHZ bases in four- and five-qubit systems that require only a single EPR pair. For the same target sets, we compare different entanglement-assisted schemes and identify those with lower entanglement consumption. We further observe that, on average, protocols avoiding teleportation consume fewer resources than teleportation-based approaches. In addition, when higher-partite GHZ-type resources (with n>3n>3n>3) are available among suitable subsystems, they can in some cases reduce the overall entanglement cost. Our results highlight the operational significance of multipartite entanglement and provide practical protocols for the local discrimination of orthogonal state sets exhibiting quantum nonlocality.
It is shown that while entanglement remains a significant factor in discriminating a set of mutually orthogonal entangled states perfectly by local operations and classical communication (LOCC), entanglement content is not. In particular, for a class of entangled multi-qubit states, the maximum number of perfectly LOCC distinguishable orthogonal states is shown to be independent of the average entanglement of the states, and the spatial configuration with respect to which LOCC operations may be carried out. It is also pointed out that the make-up of an ensemble, that is, whether it consists only of entangled states or is a mix of both entangled and product states, determines the maximum number of perfectly distinguishable states.