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

Optimal verification of two-qubit pure states

Kun Wang, Masahito Hayashi

Published Sep 10, 2019• 61 citations
arXivHTMLPDF

Abstract

In a recent work [Pallister, Linden, and Montanaro, Phys. Rev. Lett. 120, 170502 (2018)], Pallister et al. proposed an optimal strategy to verify nonmaximally entangled two-qubit pure states under the constraint that the accessible measurements are locally projective and nonadaptive. Their good result leads naturally to the following question: What is the optimal strategy among general local operations and classical communication (LOCC) measurements? In this paper, we answer this problem completely for two-qubit pure states. To be specific, we give the optimal strategy for each of the following available classes of measurements: (i) local operations and one-way classical communication (one-way LOCC) measurements; (ii) local operations and two-way classical communication (two-way LOCC) measurements; and (iii) separable measurements. Surprisingly, our results reveal that for the two-qubit pure state verification problem two-way LOCC measurements remarkably outperform one-way LOCC measurements and have the same power as the separable measurements.

DOI
10.1103/physreva.100.032315

Related papers

Optimal verification of general bipartite pure states

Xiao‐Dong Yu, Jiangwei Shang, Otfried Gühne

Abstract The efficient and reliable verification of quantum states plays a crucial role in various quantum information processing tasks. We consider the task of verifying entangled states using one-way and two-way classical communication and completely characterize the optimal strategies via convex optimization. We solve these optimization problems using both analytical and numerical methods, and the optimal strategies can be constructed for any bipartite pure state. Compared with the nonadaptive approach, our adaptive strategies significantly improve the efficiency of quantum state verification. Moreover, these strategies are experimentally feasible, as only few local projective measurements are required.

arXiv:1901.09856•npj Quantum Information•Dec 6, 2019•55 citations

Revisiting the optimal detection of quantum information

Eric Chitambar, Min-Hsiu Hsieh

In 1991, Peres and Wootters wrote a seminal paper on the nonlocal processing of quantum information [Phys. Rev. Lett. 66, 1119 (1991)]. We return to their classic problem and solve it in various contexts. Specifically, for discriminating the ``double trine'' ensemble with minimum error, we prove that global operations are more powerful than local operations with classical communication (LOCC). Even stronger, there exists a finite gap between the optimal LOCC probability and that obtainable by separable operations (SEP). Additionally we prove that a two-way, adaptive LOCC strategy can always beat a one-way protocol. Our results demonstrate ``nonlocality without entanglement'' in two-qubit pure states.

arXiv:1304.1555•Physical Review A•Aug 27, 2013•57 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

Locality and nonlocality in quantum pure-state identification problems

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

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.

arXiv:0807.1364•Physical Review A•Jul 8, 2008•13 citations

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

Experimental discrimination of two-qubit orthogonal states via local operations and classical communication

Xiaoqian Zhang, Maolin Luo, Guifang Yu +1 more

Quantum nonlocality, a form of nonclassicality, serves as a crucial resource in quantum information processing. Nonlocality in quantum systems is exemplified by the perfect discrimination of orthogonal quantum states through single joint measurements, which is unattainable using local operations and classical communication (LOCC). Bandyopadhyay [S. Bandyopadhyay, Phys. Rev. Lett. 106, 210402 (2011)] established that, with LOCC alone, at most $N\ensuremath{-}1$ copies of $N$ orthogonal quantum states are required for perfect discrimination. Here, we present the experimental verification of orthogonal quantum state discrimination employing LOCC. Our results demonstrate that up to three copies suffice for the perfect distinction of four orthogonal two-qubit states via LOCC. The verified method of perfectly distinguishing orthogonal quantum state sets offers potential applications in quantum information processes, including quantum secret sharing and quantum teleportation.

Physical Review A•Sep 22, 2023•1 citation
In a recent work [Pallister, Linden, and Montanaro, Phys. Rev. Lett. 120, 170502 (2018)], Pallister et al. proposed an optimal strategy to verify nonmaximally entangled two-qubit pure states under the constraint that the accessible measurements are locally projective and nonadaptive. Their good result leads naturally to the following question: What is the optimal strategy among general local operations and classical communication (LOCC) measurements? In this paper, we answer this problem completely for two-qubit pure states. To be specific, we give the optimal strategy for each of the following available classes of measurements: (i) local operations and one-way classical communication (one-way LOCC) measurements; (ii) local operations and two-way classical communication (two-way LOCC) measurements; and (iii) separable measurements. Surprisingly, our results reveal that for the two-qubit pure state verification problem two-way LOCC measurements remarkably outperform one-way LOCC measurements and have the same power as the separable measurements.
Abstract The efficient and reliable verification of quantum states plays a crucial role in various quantum information processing tasks. We consider the task of verifying entangled states using one-way and two-way classical communication and completely characterize the optimal strategies via convex optimization. We solve these optimization problems using both analytical and numerical methods, and the optimal strategies can be constructed for any bipartite pure state. Compared with the nonadaptive approach, our adaptive strategies significantly improve the efficiency of quantum state verification. Moreover, these strategies are experimentally feasible, as only few local projective measurements are required.
In 1991, Peres and Wootters wrote a seminal paper on the nonlocal processing of quantum information [Phys. Rev. Lett. 66, 1119 (1991)]. We return to their classic problem and solve it in various contexts. Specifically, for discriminating the ``double trine'' ensemble with minimum error, we prove that global operations are more powerful than local operations with classical communication (LOCC). Even stronger, there exists a finite gap between the optimal LOCC probability and that obtainable by separable operations (SEP). Additionally we prove that a two-way, adaptive LOCC strategy can always beat a one-way protocol. Our results demonstrate ``nonlocality without entanglement'' in two-qubit pure states.
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.
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.
Quantum nonlocality, a form of nonclassicality, serves as a crucial resource in quantum information processing. Nonlocality in quantum systems is exemplified by the perfect discrimination of orthogonal quantum states through single joint measurements, which is unattainable using local operations and classical communication (LOCC). Bandyopadhyay [S. Bandyopadhyay, Phys. Rev. Lett. 106, 210402 (2011)] established that, with LOCC alone, at most $N\ensuremath{-}1$ copies of NNN orthogonal quantum states are required for perfect discrimination. Here, we present the experimental verification of orthogonal quantum state discrimination employing LOCC. Our results demonstrate that up to three copies suffice for the perfect distinction of four orthogonal two-qubit states via LOCC. The verified method of perfectly distinguishing orthogonal quantum state sets offers potential applications in quantum information processes, including quantum secret sharing and quantum teleportation.