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/0212020 · Physical Review A

Construction of extremal local positive-operator-valued measures under symmetry

S. Virmani, Martin Bodo Plenio

Published Jun 25, 2003• 20 citations
arXivHTMLPDF

Abstract

We study the local implementation of positive-operator-valued measures (POVMs) when we require only the faithful reproduction of the statistics of the measurement outcomes for all initial states. We first demonstrate that any POVM with separable elements can be implemented by a separable superoperator, and develop techniques for calculating the extreme points of POVMs under a certain class of constraint that includes separability and positive partial transposition. As examples we consider measurements that are invariant under various symmetry groups (Werner, isotropic, Bell diagonal, local orthogonal), and demonstrate that in these cases separability of the POVM elements is equivalent to implementability via local operations and classical communication (LOCC). We also calculate the extrema of these classes of measurement under the groups that we consider, and give explicit LOCC protocols for attaining them. These protocols are hence optimal methods for locally discriminating between states of these symmetries. One of many interesting consequences is that the best way to locally discriminate Bell-diagonal mixed states is to perform a two-outcome POVM using local von Neumann projections. This is true regardless of the cost function, the number of states being discriminated, or the prior probabilities. Our results give the first cases of local mixed-state discrimination that can be analyzed quantitatively in full, and may have application to other problems such as demonstrations of nonlocality, experimental entanglement witnesses, and perhaps even entanglement distillation.

DOI
10.1103/physreva.67.062308

Related papers

Realizing a 2-D Positive Operator-Valued Measure by Local Operations and Classical Communication

Kenji Nakahira, Tsuyoshi Sasaki Usuda

We study the realization of a 2-D positive operator-valued measure (POVM) by local operations and classical communication (LOCC). We derive that any POVM on a 2-D Hilbert space in which each party's space is finite dimensional can be realized by one-way LOCC. This implies that any optimal discrimination of quantum states spanning such a 2-D Hilbert space is possible by one-way LOCC, regardless of the optimality criterion used and how entangled the states are.

arXiv:1501.06222•IEEE Transactions on Information Theory•Apr 4, 2016•3 citations

Distinguishability of Quantum States by Positive Operator-Valued Measures With Positive Partial Transpose

Nengkun Yu, Runyao Duan, Mingsheng Ying

We study the distinguishability of bipartite quantum states by positive operator-valued measures with positive partial transpose (PPT POVMs). The contributions of this paper include: 1) we give a negative answer to an open problem of showing a limitation of a previous known method for detecting nondistinguishability; 2) we show that a maximally entangled state and its orthogonal complement, no matter how many copies are supplied, cannot be distinguished by the PPT POVMs, even unambiguously. This result is much stronger than the previous known ones; and 3) we study the entanglement cost of distinguishing quantum states. It is proved that √{2/3}|00〉+√{1/3}|11〉 is sufficient and necessary for distinguishing three Bell states by the PPT POVMs. An upper bound of entanglement cost of distinguishing a d ⊗ d pure state and its orthogonal complement is obtained for separable operations. Based on this bound, we are able to construct two orthogonal quantum states, which cannot be distinguished unambiguously by separable POVMs, but finite copies would make them perfectly distinguishable by local operations and classical communication. We further observe that a two-qubit maximally entangled state is always enough for distinguishing a d ⊗ d pure state and its orthogonal complement by the PPT POVMs, no matter the value of d. In sharp contrast, an entangled state with Schmidt number at least d is always needed for distinguishing such two states by separable POVMs. As an application, we show that the entanglement cost of distinguishing a d ⊗ d maximally entangled state and its orthogonal complement must be a maximally entangled state for d=2, which implies that teleportation is optimal, and in general, it could be chosen as O(logd/d).

arXiv:1209.4222•IEEE Transactions on Information Theory•Feb 24, 2014•71 citations

Distinguishability of locally diagonal orthogonally invariant quantum states

Nathaniel Johnston, Vincent Russo

We study the distinguishability of quantum states under local operations with classical communication (LOCC), separable, and positive-partial-transpose (PPT) measurements, focusing on locally diagonal orthogonally invariant (LDOI) states -- those invariant under local diagonal orthogonal twirling. This class includes many important families such as Werner states, isotropic states, X-states, and Dicke states. We show that optimal PPT and separable measurements for distinguishing LDOI states can always be taken to be LDOI, and the LOCC supremum can be approached by LDOI LOCC POVMs, enabling a dimensional reduction from $n^4$ to $O(n^2)$ in the associated optimization problems. We establish efficiently computable bounds on the distinguishability of orthonormal LDOI bases and prove that for a broad class of such bases -- including all two-qubit cases -- the LOCC supremum equals the PPT and separable optima. More generally, we show the gap between PPT and LOCC distinguishability is at most $(n-2)/(2n^2)$ for local dimension $n$.

quant-pharXiv:2604.12808•Apr 15, 2026•0 citations

Quantum State Local Distinguishability via Convex Optimization

Alessandro Cosentino

Entanglement and nonlocality play a fundamental role in quantum computing. To understand the interplay between these phenomena, researchers have considered the model of local operations and classical communication, or LOCC for short, which is a restricted subset of all possible operations that can be performed on a multipartite quantum system. The task of distinguishing states from a set that is known a priori to all parties is one of the most basic problems among those used to test the power of LOCC protocols, and it has direct applications to quantum data hiding, secret sharing and quantum channel capacity. The focus of this thesis is on state distinguishability problems for classes of quantum operations that are more powerful than LOCC, yet more restricted than global operations, namely the classes of separable and positive-partial-transpose (PPT) measurements. We \nbuild a framework based on convex optimization (on cone programming, in particular) to study such problems. Compared to previous approaches to the problem, the method described in this thesis provides precise numerical bounds and quantitative analytic results. By combining the duality theory of cone programming with the channel-state duality, we also establish a novel connection between the state distinguishability problem and the study of positive linear maps, which is a topic of independent interest in quantum information theory. \n \nWe apply our framework to several questions that were left open in previous works regarding the distinguishability of maximally entangled states and unextendable product sets. First, we exhibit small sets of orthogonal maximally entangled states in that are not perfectly distinguishable by LOCC. As a consequence of this, we show a gap between the power of PPT and separable measurements for the task of distinguishing sets consisting only of maximally entangled states. Furthermore, we prove tight bounds on the entanglement cost that is necessary to distinguish any sets of Bell states, thus showing that quantum teleportation is optimal for this task. Finally, we provide an easily checkable characterization of when an unextendable product set is perfectly discriminated by separable measurements, along with the first known example of an unextendable product set that cannot be perfectly discriminated by separable measurements.

•Aug 24, 2015•0 citations

Remote interactions on two distributed quantum systems: nonlocal unambiguous quantum-state discrimination

Libing Chen, Jin Rui-Bo, Haiping Lu

Remote quantum-state discrimination is a critical step for the implementation of quantum communication network and distributed quantum computation. We present a protocol for remotely implementing the unambiguous discrimination between nonorthogonal states using quantum entanglements, local operations, and classical communications. This protocol consists of a remote generalized measurement described by a positive operator valued measurement (POVM). We explicitly construct the required remote POVM. The remote POVM can be realized by performing a nonlocal controlled-rotation operation on two spatially separated qubits, one is an ancillary qubit and the other is the qubit which is encoded by two nonorthogonal states to be distinguished, and a conventional local Von Neumann orthogonal measurement on the ancilla. The particular pair of states that can be remotely and unambiguously distinguished is specified by the state of the ancilla. The probability of successful discrimination is not optimal for all admissible pairs. However, for some subset it can be very close to an optimal value in an ordinary local POVM.

Chinese Physics B•Mar 1, 2008•3 citations

Implementation of group-covariant positive operator valued measures by orthogonal measurements

Thomas Decker, Dominik Janzing, Martin Rötteler

We consider group-covariant positive operator valued measures (POVMs) on a finite dimensional quantum system. Following Neumark’s theorem a POVM can be implemented by an orthogonal measurement on a larger system. Accordingly, our goal is to find a quantum circuit implementation of a given group-covariant POVM which uses the symmetry of the POVM. Based on representation theory of the symmetry group we develop a general approach for the implementation of group-covariant POVMs which consist of rank-one operators. The construction relies on a method to decompose matrices that intertwine two representations of a finite group. We give several examples for which the resulting quantum circuits are efficient. In particular, we obtain efficient quantum circuits for a class of POVMs generated by Weyl–Heisenberg groups. These circuits allow to implement an approximative simultaneous measurement of the position and crystal momentum of a particle moving on a cyclic chain.

arXiv:quant-ph/0407054•Journal of Mathematical Physics•Dec 24, 2004•20 citations
We study the local implementation of positive-operator-valued measures (POVMs) when we require only the faithful reproduction of the statistics of the measurement outcomes for all initial states. We first demonstrate that any POVM with separable elements can be implemented by a separable superoperator, and develop techniques for calculating the extreme points of POVMs under a certain class of constraint that includes separability and positive partial transposition. As examples we consider measurements that are invariant under various symmetry groups (Werner, isotropic, Bell diagonal, local orthogonal), and demonstrate that in these cases separability of the POVM elements is equivalent to implementability via local operations and classical communication (LOCC). We also calculate the extrema of these classes of measurement under the groups that we consider, and give explicit LOCC protocols for attaining them. These protocols are hence optimal methods for locally discriminating between states of these symmetries. One of many interesting consequences is that the best way to locally discriminate Bell-diagonal mixed states is to perform a two-outcome POVM using local von Neumann projections. This is true regardless of the cost function, the number of states being discriminated, or the prior probabilities. Our results give the first cases of local mixed-state discrimination that can be analyzed quantitatively in full, and may have application to other problems such as demonstrations of nonlocality, experimental entanglement witnesses, and perhaps even entanglement distillation.
We study the distinguishability of bipartite quantum states by positive operator-valued measures with positive partial transpose (PPT POVMs). The contributions of this paper include: 1) we give a negative answer to an open problem of showing a limitation of a previous known method for detecting nondistinguishability; 2) we show that a maximally entangled state and its orthogonal complement, no matter how many copies are supplied, cannot be distinguished by the PPT POVMs, even unambiguously. This result is much stronger than the previous known ones; and 3) we study the entanglement cost of distinguishing quantum states. It is proved that √{2/3}|00〉+√{1/3}|11〉 is sufficient and necessary for distinguishing three Bell states by the PPT POVMs. An upper bound of entanglement cost of distinguishing a d ⊗ d pure state and its orthogonal complement is obtained for separable operations. Based on this bound, we are able to construct two orthogonal quantum states, which cannot be distinguished unambiguously by separable POVMs, but finite copies would make them perfectly distinguishable by local operations and classical communication. We further observe that a two-qubit maximally entangled state is always enough for distinguishing a d ⊗ d pure state and its orthogonal complement by the PPT POVMs, no matter the value of d. In sharp contrast, an entangled state with Schmidt number at least d is always needed for distinguishing such two states by separable POVMs. As an application, we show that the entanglement cost of distinguishing a d ⊗ d maximally entangled state and its orthogonal complement must be a maximally entangled state for d=2, which implies that teleportation is optimal, and in general, it could be chosen as O(logd/d).
We study the distinguishability of quantum states under local operations with classical communication (LOCC), separable, and positive-partial-transpose (PPT) measurements, focusing on locally diagonal orthogonally invariant (LDOI) states -- those invariant under local diagonal orthogonal twirling. This class includes many important families such as Werner states, isotropic states, X-states, and Dicke states. We show that optimal PPT and separable measurements for distinguishing LDOI states can always be taken to be LDOI, and the LOCC supremum can be approached by LDOI LOCC POVMs, enabling a dimensional reduction from n4n^4n4 to O(n2)O(n^2)O(n2) in the associated optimization problems. We establish efficiently computable bounds on the distinguishability of orthonormal LDOI bases and prove that for a broad class of such bases -- including all two-qubit cases -- the LOCC supremum equals the PPT and separable optima. More generally, we show the gap between PPT and LOCC distinguishability is at most (n−2)/(2n2)(n-2)/(2n^2)(n−2)/(2n2) for local dimension nnn.
Entanglement and nonlocality play a fundamental role in quantum computing. To understand the interplay between these phenomena, researchers have considered the model of local operations and classical communication, or LOCC for short, which is a restricted subset of all possible operations that can be performed on a multipartite quantum system. The task of distinguishing states from a set that is known a priori to all parties is one of the most basic problems among those used to test the power of LOCC protocols, and it has direct applications to quantum data hiding, secret sharing and quantum channel capacity. The focus of this thesis is on state distinguishability problems for classes of quantum operations that are more powerful than LOCC, yet more restricted than global operations, namely the classes of separable and positive-partial-transpose (PPT) measurements. We \nbuild a framework based on convex optimization (on cone programming, in particular) to study such problems. Compared to previous approaches to the problem, the method described in this thesis provides precise numerical bounds and quantitative analytic results. By combining the duality theory of cone programming with the channel-state duality, we also establish a novel connection between the state distinguishability problem and the study of positive linear maps, which is a topic of independent interest in quantum information theory. \n \nWe apply our framework to several questions that were left open in previous works regarding the distinguishability of maximally entangled states and unextendable product sets. First, we exhibit small sets of orthogonal maximally entangled states in that are not perfectly distinguishable by LOCC. As a consequence of this, we show a gap between the power of PPT and separable measurements for the task of distinguishing sets consisting only of maximally entangled states. Furthermore, we prove tight bounds on the entanglement cost that is necessary to distinguish any sets of Bell states, thus showing that quantum teleportation is optimal for this task. Finally, we provide an easily checkable characterization of when an unextendable product set is perfectly discriminated by separable measurements, along with the first known example of an unextendable product set that cannot be perfectly discriminated by separable measurements.
Remote quantum-state discrimination is a critical step for the implementation of quantum communication network and distributed quantum computation. We present a protocol for remotely implementing the unambiguous discrimination between nonorthogonal states using quantum entanglements, local operations, and classical communications. This protocol consists of a remote generalized measurement described by a positive operator valued measurement (POVM). We explicitly construct the required remote POVM. The remote POVM can be realized by performing a nonlocal controlled-rotation operation on two spatially separated qubits, one is an ancillary qubit and the other is the qubit which is encoded by two nonorthogonal states to be distinguished, and a conventional local Von Neumann orthogonal measurement on the ancilla. The particular pair of states that can be remotely and unambiguously distinguished is specified by the state of the ancilla. The probability of successful discrimination is not optimal for all admissible pairs. However, for some subset it can be very close to an optimal value in an ordinary local POVM.
We consider group-covariant positive operator valued measures (POVMs) on a finite dimensional quantum system. Following Neumark’s theorem a POVM can be implemented by an orthogonal measurement on a larger system. Accordingly, our goal is to find a quantum circuit implementation of a given group-covariant POVM which uses the symmetry of the POVM. Based on representation theory of the symmetry group we develop a general approach for the implementation of group-covariant POVMs which consist of rank-one operators. The construction relies on a method to decompose matrices that intertwine two representations of a finite group. We give several examples for which the resulting quantum circuits are efficient. In particular, we obtain efficient quantum circuits for a class of POVMs generated by Weyl–Heisenberg groups. These circuits allow to implement an approximative simultaneous measurement of the position and crystal momentum of a particle moving on a cyclic chain.