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

Physica Scripta

Local discrimination of lattice states via complete graph

Qianqian Liu, Ying‐Hui Yang, Pei-Ying Chen, Xiaoli Wang

Published Sep 20, 2023• 2 citations
Publisher

Abstract

Abstract In this paper, we use graph theory to study the distinguishability of lattice states under local operations and classical communication (LOCC) in C p 2 ⨂ C p 2 . Firstly, we present that for the basis of lattice unitary matrices, there are (p 2 + 1)(p + 1) distinct maximal commuting sets in p 2-dimensional system. Secondly, for any set  of lattice states, we can obtain a graph G which consists of some k-complete subgraphs. Using the graph G, we show that the set  can be distinguished by one-way LOCC if n ( p + 1 ) − ∑ k = 1 p + 1 s k ( k − 1 ) < ( p 2 + 1 ) ( p + 1 ) , where n is the number of vertices of a graph G and s k is the number of k-complete subgraphs. Moreover, we also proved that this conclusion is necessary and sufficient in C 2 2 ⨂ C 2 2 . For C p 2 ⨂ C p 2 system, our result can cover the results in (2015, Phys. Rev. A 92, 042 320); (2020, Sci. China-Phys. Mech. Astron. 63, 280 312).

DOI
10.1088/1402-4896/acfbc1

Related papers

Local discrimination of generalized Bell states via commutativity

Mao-Sheng Li, Fei Shi, Yan-Ling Wang

We study the distinguishability of generalized Bell states under local operations and classical communication. We introduce the concept of a maximally commutative set (MCS), a subset of generalized Pauli matrices whose elements are mutually commutative, and there is no other generalized Pauli matrix that commutes with all the elements of this set. We find that MCS can be considered a detector for the local distinguishability of a set $\mathcal{S}$ of generalized Bell states. In fact, we get an efficient criterion. That is, if the difference set $\mathrm{\ensuremath{\Delta}}\mathcal{S}$ of $\mathcal{S}$ is disjoint with or completely contained in some MCS, then the set $\mathcal{S}$ is locally distinguishable. Furthermore, we give a useful characterization of MCS for arbitrary dimensions, which provides great convenience for detecting the local discrimination of generalized Bell states. Our method can be generalized to more general settings which contain the lattice qudit basis. The results of Fan [Phys. Rev. Lett. 92, 177905 (2004)], Tian et al. [Phys. Rev. A 92, 042320 (2015)], and a recent work Yuan et al. [arXiv:2109.07390] can be deduced as special cases of our result.

arXiv:2111.11275•Physical Review A•Mar 30, 2022•9 citations

Local discrimination of qudit lattice states via commutativity

Guojing Tian, Sixia Yu, Fei Gao +2 more

Qudit lattice states, as the generalization of qubit lattice states, are the maximally entangled states determined by qudit lattice unitaries in a ${p}^{r}\ensuremath{\bigotimes}{p}^{r}$ quantum system with $p$ being a prime and $r$ being an integer. Based on the partitions of qudit lattice unitaries into commuting sets, we present a sufficient condition for local discrimination of qudit lattice states, in which the commutativity plays an efficient role. It turns out that any set of $l$ qudit lattice states with $2\ensuremath{\le}l\ensuremath{\le}{p}^{r}$, including $k\ensuremath{\le}l$ mutually commuting qudit lattice unitaries and satisfying $l(l\ensuremath{-}1)\ensuremath{-}(k+1)(k\ensuremath{-}2)\ensuremath{\le}2{p}^{r}$, can be locally distinguished, not only extending Fan's result [H. Fan, Phys. Rev. Lett. 92, 177905 (2004)] to the prime power quantum system but also involving the local discrimination of a larger number of maximally entangled states.

Physical Review A•Oct 19, 2015•23 citations

Detectors for local discrimination of sets of generalized Bell states

Caihong Wang, Jiangtao Yuan, Ying‐Hui Yang +3 more

A fundamental problem in quantum information processing is the discrimination among a set of orthogonal quantum states of a composite system under local operations and classical communication (LOCC). Corresponding to the LOCC indistinguishable sets of four ququad-ququad orthogonal maximally entangled states constructed by Yu et al. [Phys. Rev. Lett. 109, 020506 (2012)], the maximum commutative sets were introduced as detectors for the local distinguishability of the set of generalized Bell states (GBSs) for which the detectors are sufficient to determine the LOCC distinguishability. In this work, we show how to determine all the detectors for a given GBS set. We also construct several four-GBS sets without detectors, most of which are one-way LOCC indistinguishable and only one of which is one-way LOCC distinguishable, indicating that the detectors are not necessary for LOCC distinguishability. Furthermore, we show that for four-GBS sets in the quantum system ${\mathbb{C}}^{6}\ensuremath{\bigotimes}{\mathbb{C}}^{6}$, the detectors are almost necessary for one-way LOCC distinguishability, except for one set in the sense of local unitary equivalence. The problem of one-way LOCC discrimination of four-GBS sets in ${\mathbb{C}}^{6}\ensuremath{\bigotimes}{\mathbb{C}}^{6}$ is completely resolved.

arXiv:2504.11747•Physical Review A•Apr 4, 2025•3 citations

Graph Structures for Local Distinguishability of Quantum Product States

Sooyeong Kim, David W. Kribs, Michael Nathanson +2 more

We consider the problem of distinguishing sets of quantum product states with local operations and classical communication (LOCC). Recent work has used graph theory to identify sets of product states distinguishable with one-way LOCC. We extend these efforts to full two-way LOCC, with the first significant analysis of the set of graphs corresponding to bipartite product states that can be distinguished with two-way protocols after finitely many steps. We derive basic closure properties of the set of distinguishable graphs and identify some classes of graphs that guarantee local distinguishability and some graphs that do not. We also include several examples and forward-looking comments.

quant-pharXiv:2606.26558•Jun 26, 2026•0 citations

Novel method for one-way local distinguishability of generalized Bell states in arbitrary dimension

Ying‐Hui Yang, Rang-Yang Yan, Xiaoli Wang +2 more

Abstract In this paper the local distinguishability of generalized Bell states in arbitrary dimension is investigated. We firstly study the decomposition of a basis which consists of d 2 number of generalized Pauli matrices. We discover that this basis is equal to the union of D number of different sets, where D = 2 ϕ ( d ) ∑ t ∈ Z d gcd ( t , d ) = 1 ∑ i = 2 ⌊ d t ⌋ ϕ ( i ) + 1 and ϕ is Euler ϕ -function. Then we define the generator of the matrices in this decomposition, and exhibit an algorithm to calculate generators of a given set of matrices. This algorithm shows that generators of a given set can be calculated simply and efficiently. Secondly, we show that a set L of GBSs can be distinguished by one-way LOCC if the cardinality of G L is less than Dϕ ( d ), where G L is a set of generators of all the elements in difference set of a set L of GBSs. The previous results in [2004 Phys. Rev. Lett. 92 177905; 2019 Phys. Rev. A 99 022307; 2021 Quantum Inf. Process. 20 52] can be covered by our result. Finally, for the uncovered cases in [2021 Quantum Inf. Process. 20 52], we give a new result to partly solve that problem.

Journal of Physics A Mathematical and Theoretical•Nov 11, 2021•5 citations

Constructions of locally distinguishable sets of maximally entangled states which require two-way LOCC

Jiangtao Yuan, Ying‐Hui Yang, Caihong Wang

Abstract Most of known locally distinguishable sets of maximally entangled states (MESs) can be perfectly distinguished with one-way local operations and classical communication (1-LOCC), and there are not many known locally distinguishable sets which require two-way LOCC (2-LOCC). Recently some such sets of MESs have been built, that is, they can be locally distinguished only with 2-LOCC. In this work, we show that there exist a lot of locally distinguishable MESs which require 2-LOCC (denote such sets by 2-LOCC sets). Firstly generalized Bell states are employed to construct lots of 1-LOCC indistinguishable sets of MESs in the quantum systems C a + ( a + 1 ) r ⊗ C a + ( a + 1 ) r and C a + ( a + 2 ) r ⊗ C a + ( a + 2 ) r . Then we build a lot of 2-LOCC sets by using Weyl commutation relation and two constructive methods. Especially, it is shown that there are at least 8 and 105 2-LOCC sets in quantum systems C 10 ⊗ C 10 and C 19 ⊗ C 19 respectively.

Journal of Physics A Mathematical and Theoretical•Oct 23, 2020•10 citations
Abstract In this paper, we use graph theory to study the distinguishability of lattice states under local operations and classical communication (LOCC) in C p 2 ⨂ C p 2 . Firstly, we present that for the basis of lattice unitary matrices, there are (p 2 + 1)(p + 1) distinct maximal commuting sets in p 2-dimensional system. Secondly, for any set  of lattice states, we can obtain a graph G which consists of some k-complete subgraphs. Using the graph G, we show that the set  can be distinguished by one-way LOCC if n ( p + 1 ) − ∑ k = 1 p + 1 s k ( k − 1 ) < ( p 2 + 1 ) ( p + 1 ) , where n is the number of vertices of a graph G and s k is the number of k-complete subgraphs. Moreover, we also proved that this conclusion is necessary and sufficient in C 2 2 ⨂ C 2 2 . For C p 2 ⨂ C p 2 system, our result can cover the results in (2015, Phys. Rev. A 92, 042 320); (2020, Sci. China-Phys. Mech. Astron. 63, 280 312).
We study the distinguishability of generalized Bell states under local operations and classical communication. We introduce the concept of a maximally commutative set (MCS), a subset of generalized Pauli matrices whose elements are mutually commutative, and there is no other generalized Pauli matrix that commutes with all the elements of this set. We find that MCS can be considered a detector for the local distinguishability of a set S\mathcal{S}S of generalized Bell states. In fact, we get an efficient criterion. That is, if the difference set $\mathrm{\ensuremath{\Delta}}\mathcal{S}$ of S\mathcal{S}S is disjoint with or completely contained in some MCS, then the set S\mathcal{S}S is locally distinguishable. Furthermore, we give a useful characterization of MCS for arbitrary dimensions, which provides great convenience for detecting the local discrimination of generalized Bell states. Our method can be generalized to more general settings which contain the lattice qudit basis. The results of Fan [Phys. Rev. Lett. 92, 177905 (2004)], Tian et al. [Phys. Rev. A 92, 042320 (2015)], and a recent work Yuan et al. [arXiv:2109.07390] can be deduced as special cases of our result.
Qudit lattice states, as the generalization of qubit lattice states, are the maximally entangled states determined by qudit lattice unitaries in a ${p}^{r}\ensuremath{\bigotimes}{p}^{r}$ quantum system with ppp being a prime and rrr being an integer. Based on the partitions of qudit lattice unitaries into commuting sets, we present a sufficient condition for local discrimination of qudit lattice states, in which the commutativity plays an efficient role. It turns out that any set of lll qudit lattice states with $2\ensuremath{\le}l\ensuremath{\le}{p}^{r}$, including $k\ensuremath{\le}l$ mutually commuting qudit lattice unitaries and satisfying $l(l\ensuremath{-}1)\ensuremath{-}(k+1)(k\ensuremath{-}2)\ensuremath{\le}2{p}^{r}$, can be locally distinguished, not only extending Fan's result [H. Fan, Phys. Rev. Lett. 92, 177905 (2004)] to the prime power quantum system but also involving the local discrimination of a larger number of maximally entangled states.
A fundamental problem in quantum information processing is the discrimination among a set of orthogonal quantum states of a composite system under local operations and classical communication (LOCC). Corresponding to the LOCC indistinguishable sets of four ququad-ququad orthogonal maximally entangled states constructed by Yu et al. [Phys. Rev. Lett. 109, 020506 (2012)], the maximum commutative sets were introduced as detectors for the local distinguishability of the set of generalized Bell states (GBSs) for which the detectors are sufficient to determine the LOCC distinguishability. In this work, we show how to determine all the detectors for a given GBS set. We also construct several four-GBS sets without detectors, most of which are one-way LOCC indistinguishable and only one of which is one-way LOCC distinguishable, indicating that the detectors are not necessary for LOCC distinguishability. Furthermore, we show that for four-GBS sets in the quantum system ${\mathbb{C}}^{6}\ensuremath{\bigotimes}{\mathbb{C}}^{6}$, the detectors are almost necessary for one-way LOCC distinguishability, except for one set in the sense of local unitary equivalence. The problem of one-way LOCC discrimination of four-GBS sets in ${\mathbb{C}}^{6}\ensuremath{\bigotimes}{\mathbb{C}}^{6}$ is completely resolved.
We consider the problem of distinguishing sets of quantum product states with local operations and classical communication (LOCC). Recent work has used graph theory to identify sets of product states distinguishable with one-way LOCC. We extend these efforts to full two-way LOCC, with the first significant analysis of the set of graphs corresponding to bipartite product states that can be distinguished with two-way protocols after finitely many steps. We derive basic closure properties of the set of distinguishable graphs and identify some classes of graphs that guarantee local distinguishability and some graphs that do not. We also include several examples and forward-looking comments.
Abstract In this paper the local distinguishability of generalized Bell states in arbitrary dimension is investigated. We firstly study the decomposition of a basis which consists of d 2 number of generalized Pauli matrices. We discover that this basis is equal to the union of D number of different sets, where D = 2 ϕ ( d ) ∑ t ∈ Z d gcd ( t , d ) = 1 ∑ i = 2 ⌊ d t ⌋ ϕ ( i ) + 1 and ϕ is Euler ϕ -function. Then we define the generator of the matrices in this decomposition, and exhibit an algorithm to calculate generators of a given set of matrices. This algorithm shows that generators of a given set can be calculated simply and efficiently. Secondly, we show that a set L of GBSs can be distinguished by one-way LOCC if the cardinality of G L is less than Dϕ ( d ), where G L is a set of generators of all the elements in difference set of a set L of GBSs. The previous results in [2004 Phys. Rev. Lett. 92 177905; 2019 Phys. Rev. A 99 022307; 2021 Quantum Inf. Process. 20 52] can be covered by our result. Finally, for the uncovered cases in [2021 Quantum Inf. Process. 20 52], we give a new result to partly solve that problem.
Abstract Most of known locally distinguishable sets of maximally entangled states (MESs) can be perfectly distinguished with one-way local operations and classical communication (1-LOCC), and there are not many known locally distinguishable sets which require two-way LOCC (2-LOCC). Recently some such sets of MESs have been built, that is, they can be locally distinguished only with 2-LOCC. In this work, we show that there exist a lot of locally distinguishable MESs which require 2-LOCC (denote such sets by 2-LOCC sets). Firstly generalized Bell states are employed to construct lots of 1-LOCC indistinguishable sets of MESs in the quantum systems C a + ( a + 1 ) r ⊗ C a + ( a + 1 ) r and C a + ( a + 2 ) r ⊗ C a + ( a + 2 ) r . Then we build a lot of 2-LOCC sets by using Weyl commutation relation and two constructive methods. Especially, it is shown that there are at least 8 and 105 2-LOCC sets in quantum systems C 10 ⊗ C 10 and C 19 ⊗ C 19 respectively.