arXiv:2504.02212 · Physical Review Research

Decidabilities of local unitary equivalence for entanglement witnesses and states

Yi Shen, Lin Chen

Published Aug 29, 2025• 0 citations

Abstract

The problem of determining whether two states are equivalent by local unitary (LU) operations is important for quantum information processing. In this paper, we propose an alternative perspective to study this problem by comparing the decidabilities of LU equivalence (also known as LU decidabilities for short) between entanglement witnesses and states. We introduce a relation between sets of Hermitian operators in terms of the LU decidability. Then, we compare the LU decidability for the set of entanglement witnesses to the LU decidabilities for several sets of states. By comparison, we establish a hierarchy of these sets in terms of LU decidabilities. Moreover, we realize that the simultaneous LU (SLU) equivalence between tuples of mutually orthogonal projectors is crucial to LU equivalent operators. We reveal by examples that for two tuples of projectors, the partial SLU equivalence cannot ensure the overall SLU equivalence. Generally, we present a necessary and sufficient condition such that two tuples of states are SLU equivalent.

DOI: 10.1103/bzfp-wxbt

Related papers

Characterizing local unitary equivalence of multipartite states by local unitary Bargmann invariants

Yi Shen, Lin Chen, Shao-Ming Fei

quant-pharXiv:2609.22902Sep 22, 20260 citations

Quantum states with the same entanglement and local unitary equivalence

Julio I. de Vicente

quant-pharXiv:2609.21558Sep 21, 20260 citations

Local Unitary Equivalence of Quantum States Based on the Tensor Decompositions of Unitary Matrices

Jing Wang, Xiaoqi Liu, Li Xu +3 more

EntropyJul 29, 20234 citations

Polynomial-time local-unitary equivalence of graph states

Yuxuan Zhang

quant-pharXiv:2610.00527Oct 2, 20260 citations

Local Equivalences of Graph States

Nathan Claudet

quant-pharXiv:2511.22271Nov 28, 20250 citations

Local unitary classification of sets of generalized Bell states in $\mathbb{C}^{d}\otimes \mathbb{C}^{d}$

Caihong Wang, Jiangtao Yuan, Mao-Sheng Li +2 more

arXiv:2503.23073EPJ Quantum TechnologyJul 28, 20251 citation

arXiv:2504.02212 · Physical Review Research

Decidabilities of local unitary equivalence for entanglement witnesses and states

Yi Shen, Lin Chen

Published Aug 29, 2025• 0 citations

arXiv HTML PDF

Abstract

DOI: 10.1103/bzfp-wxbt

Related papers

Characterizing local unitary equivalence of multipartite states by local unitary Bargmann invariants

Yi Shen, Lin Chen, Shao-Ming Fei

Local unitary (LU) equivalent states are crucial for understanding the structure of quantum entanglement. We investigate the LU equivalence based on the LU Bargmann invariants (LUBIs). We consider for which states the LUBIs are sufficient to ensure the LU equivalence. We focus on a class of multipartite states with complete local commutativity, called CLC states. We first show that for multipartite CLC states, all the LUBIs are sufficient to ensure the local permutation equivalence, if their single-party marginals are diagonal and non-degenerate. By virtue of the fact that the CLC property remains unchanged under local operations, we verify that the LUBIs are also sufficient to ensure the LU equivalence of multipartite CLC states whose single-party marginals are non-degenerate. Furthermore, when the single-party marginals are degenerate, we propose concrete examples of two-qudit and three-qubit systems, showing that there are states which share all the LUBIs but are not LU equivalent.Local unitary (LU) equivalent states are crucial for understanding the structure of quantum entanglement. We investigate the LU equivalence based on the LU Bargmann invariants (LUBIs). We consider for which states the LUBIs are sufficient to ensure the LU equivalence. We focus on a class of multipartite states with complete local commutativity, called CLC states. We first show that for multipartite CLC states, all the LUBIs are sufficient to ensure the local permutation equivalence, if their single-party marginals are diagonal and non-degenerate. By virtue of the fact that the CLC property remains unchanged under local operations, we verify that the LUBIs are also sufficient to ensure the LU equivalence of multipartite CLC states whose single-party marginals are non-degenerate. Furthermore, when the single-party marginals are degenerate, we propose concrete examples of two-qudit and three-qubit systems, showing that there are states which share all the LUBIs but are not LU equivalent.

quant-pharXiv:2609.22902Sep 22, 20260 citations

Quantum states with the same entanglement and local unitary equivalence

Julio I. de Vicente

Local operations assisted by classical communication (LOCC) play a fundamental role in the resource-theoretic formulation of entanglement theory inducing an operationally meaningful ordering in the set of entangled states. The particular class within LOCC of local unitary (LU) transformations is obviously closed under inversion. Thus, LU-equivalent states are interconvertible by LOCC and have therefore the same entanglement. For this reason LU-equivalence has been thoroughly studied in the context of entanglement theory. However, as I note here with a simple example, the converse is not true: there exist entangled states that are interconvertible by LOCC but which are not LU-equivalent. This motivates studying under which conditions LOCC interconvertibility is characterized by LU-equivalence. I provide a sufficient condition for this to hold. When one considers multipartite states with full entanglement dimensionality (as quantified by the Schmidt number vector) LOCC interconvertibility can only hold under LU-equivalence.Local operations assisted by classical communication (LOCC) play a fundamental role in the resource-theoretic formulation of entanglement theory inducing an operationally meaningful ordering in the set of entangled states. The particular class within LOCC of local unitary (LU) transformations is obviously closed under inversion. Thus, LU-equivalent states are interconvertible by LOCC and have therefore the same entanglement. For this reason LU-equivalence has been thoroughly studied in the context of entanglement theory. However, as I note here with a simple example, the converse is not true: there exist entangled states that are interconvertible by LOCC but which are not LU-equivalent. This motivates studying under which conditions LOCC interconvertibility is characterized by LU-equivalence. I provide a sufficient condition for this to hold. When one considers multipartite states with full entanglement dimensionality (as quantified by the Schmidt number vector) LOCC interconvertibility can only hold under LU-equivalence.

quant-pharXiv:2609.21558Sep 21, 20260 citations

Local Unitary Equivalence of Quantum States Based on the Tensor Decompositions of Unitary Matrices

Jing Wang, Xiaoqi Liu, Li Xu +3 more

Since two quantum states that are local unitary (LU) equivalent have the same amount of entanglement, it is meaningful to find a practical method to determine the LU equivalence of given quantum states. In this paper, we present a valid process to find the unitary tensor product decomposition for an arbitrary unitary matrix. Then, by using this process, the conditions for determining the local unitary equivalence of quantum states are obtained. A numerical verification is carried out, which shows the practicability of our protocol. We also present a property of LU invariants by using the universality of quantum gates which can be used to construct the complete set of LU invariants.Since two quantum states that are local unitary (LU) equivalent have the same amount of entanglement, it is meaningful to find a practical method to determine the LU equivalence of given quantum states. In this paper, we present a valid process to find the unitary tensor product decomposition for an arbitrary unitary matrix. Then, by using this process, the conditions for determining the local unitary equivalence of quantum states are obtained. A numerical verification is carried out, which shows the practicability of our protocol. We also present a property of LU invariants by using the universality of quantum gates which can be used to construct the complete set of LU invariants.

EntropyJul 29, 20234 citations

Polynomial-time local-unitary equivalence of graph states

Yuxuan Zhang

Local-unitary (LU) equivalence asks whether two quantum states differ only by independent changes of basis on their qubits. For graph states, whether this relation can be decided in polynomial time has remained open for over a decade. We give a deterministic algorithm that decides LU equivalence for graphs on $n$ labelled vertices in $\widetilde O(n^{6.38})$ bit operations and constructs exact single-qubit unitaries whenever the states are equivalent. Building on Claudet and Perdrix's quasipolynomial algorithm, we replace the enumeration of vertex subsets by a compact system of constraints generated from pairs and triples. The remaining graph transformation is found by solving linear equations over the binary field. These new steps cost $\widetilde O(n^5)$ bit operations; the inherited graph preprocessing sets the overall bound. We also count the local-Clifford (LC) classes of graph states within any LU class: their number is a power of two, computable within the same bound. For any given graph state, this decides whether single-qubit Clifford gates reach every graph state in its LU class, and supplies a counterexample when they do not. The method also decides LU equivalence of stabilizer codes encoding one logical qubit.Local-unitary (LU) equivalence asks whether two quantum states differ only by independent changes of basis on their qubits. For graph states, whether this relation can be decided in polynomial time has remained open for over a decade. We give a deterministic algorithm that decides LU equivalence for graphs on $n$ labelled vertices in $\widetilde O(n^{6.38})$ bit operations and constructs exact single-qubit unitaries whenever the states are equivalent. Building on Claudet and Perdrix's quasipolynomial algorithm, we replace the enumeration of vertex subsets by a compact system of constraints generated from pairs and triples. The remaining graph transformation is found by solving linear equations over the binary field. These new steps cost $\widetilde O(n^5)$ bit operations; the inherited graph preprocessing sets the overall bound. We also count the local-Clifford (LC) classes of graph states within any LU class: their number is a power of two, computable within the same bound. For any given graph state, this decides whether single-qubit Clifford gates reach every graph state in its LU class, and supplies a counterexample when they do not. The method also decides LU equivalence of stabilizer codes encoding one logical qubit.

quant-pharXiv:2610.00527Oct 2, 20260 citations

Local Equivalences of Graph States

Nathan Claudet

Graph states form a large family of quantum states that are in one-to-one correspondence with mathematical graphs. Graph states are used in many applications, such as measurement-based quantum computation, as multipartite entangled resources. It is thus crucial to understand when two such states have the same entanglement, i.e. when they can be transformed into each other using only local operations. In this case, we say that the graph states are LU-equivalent (local unitary). If the local operations are restricted to the so-called Clifford group, we say that the graph states are LC-equivalent (local Clifford). Interestingly, a simple graph rule called local complementation fully captures LC-equivalence, in the sense that two graph states are LC-equivalent if and only if the underlying graphs are related by a sequence of local complementations. While it was once conjectured that two LU-equivalent graph states are always LC-equivalent, counterexamples do exist and local complementation fails to fully capture the entanglement of graph states. We introduce in this thesis a generalization of local complementation that does fully capture LU-equivalence. Using this characterization, we prove the existence of an infinite strict hierarchy of local equivalences between LC- and LU-equivalence. This also leads to the design of a quasi-polynomial algorithm for deciding whether two graph states are LU-equivalent, and to a proof that two LU-equivalent graph states are LC-equivalent if they are defined on at most 19 qubits. Furthermore, we study graph states that are universal in the sense that any smaller graph state, defined on any small enough set of qubits, can be induced using only local operations. We provide bounds and an optimal, probabilistic construction.Graph states form a large family of quantum states that are in one-to-one correspondence with mathematical graphs. Graph states are used in many applications, such as measurement-based quantum computation, as multipartite entangled resources. It is thus crucial to understand when two such states have the same entanglement, i.e. when they can be transformed into each other using only local operations. In this case, we say that the graph states are LU-equivalent (local unitary). If the local operations are restricted to the so-called Clifford group, we say that the graph states are LC-equivalent (local Clifford). Interestingly, a simple graph rule called local complementation fully captures LC-equivalence, in the sense that two graph states are LC-equivalent if and only if the underlying graphs are related by a sequence of local complementations. While it was once conjectured that two LU-equivalent graph states are always LC-equivalent, counterexamples do exist and local complementation fails to fully capture the entanglement of graph states. We introduce in this thesis a generalization of local complementation that does fully capture LU-equivalence. Using this characterization, we prove the existence of an infinite strict hierarchy of local equivalences between LC- and LU-equivalence. This also leads to the design of a quasi-polynomial algorithm for deciding whether two graph states are LU-equivalent, and to a proof that two LU-equivalent graph states are LC-equivalent if they are defined on at most 19 qubits. Furthermore, we study graph states that are universal in the sense that any smaller graph state, defined on any small enough set of qubits, can be induced using only local operations. We provide bounds and an optimal, probabilistic construction.

quant-pharXiv:2511.22271Nov 28, 20250 citations

Local unitary classification of sets of generalized Bell states in $\mathbb{C}^{d}\otimes \mathbb{C}^{d}$ Local unitary classification of sets of generalized Bell states in $\mathbb{C}^{d}\otimes \mathbb{C}^{d}$

Caihong Wang, Jiangtao Yuan, Mao-Sheng Li +2 more

Two sets of quantum entangled states that are equivalent under local unitary transformations may exhibit identical effectiveness and versatility in various quantum information processing tasks. Consequently, classification under local unitary transformations has become a fundamental issue in the theory of quantum entanglement. The primary objective of this work is to establish a practical LU-classification for all sets of $l\ (\geq 2)$ generalized Bell states (GBSs), high-dimensional generalizations of Bell states, in a bipartite system $\mathbb{C}^{d}\otimes \mathbb{C}^{d}$ with $d\geq 3$ . Based on this classification, we determine the minimal cardinality of indistinguishable GBS sets in $\mathbb{C}^{6}\otimes \mathbb{C}^{6}$ under one-way local operations and classical communication (one-way LOCC). We first propose two classification methods based on LU-equivalence for all sets of l GBSs (l-GBS sets). We then establish LU-classification for all 2-GBS, 3-GBS, 4-GBS and 5-GBS sets in $\mathbb{C}^{6}\otimes \mathbb{C}^{6}$ . Since LU-equivalent sets share identical local distinguishability, it suffices to examine representative GBS sets from equivalent classes. Notably, we identify a one-way LOCC indistinguishable 4-GBS set among these representatives, thereby resolving the case of $d = 6$ for the problem of determining the minimum cardinality of one-way LOCC indistinguishable GBS sets in (Yuan et al. in Quantum Inf Process. 18:145, 2019) or (Zhang et al. in Phys Rev A 91:012329, 2015).Two sets of quantum entangled states that are equivalent under local unitary transformations may exhibit identical effectiveness and versatility in various quantum information processing tasks. Consequently, classification under local unitary transformations has become a fundamental issue in the theory of quantum entanglement. The primary objective of this work is to establish a practical LU-classification for all sets of $l\ (\geq 2)$ generalized Bell states (GBSs), high-dimensional generalizations of Bell states, in a bipartite system $\mathbb{C}^{d}\otimes \mathbb{C}^{d}$ with $d\geq 3$ . Based on this classification, we determine the minimal cardinality of indistinguishable GBS sets in $\mathbb{C}^{6}\otimes \mathbb{C}^{6}$ under one-way local operations and classical communication (one-way LOCC). We first propose two classification methods based on LU-equivalence for all sets of l GBSs (l-GBS sets). We then establish LU-classification for all 2-GBS, 3-GBS, 4-GBS and 5-GBS sets in $\mathbb{C}^{6}\otimes \mathbb{C}^{6}$ . Since LU-equivalent sets share identical local distinguishability, it suffices to examine representative GBS sets from equivalent classes. Notably, we identify a one-way LOCC indistinguishable 4-GBS set among these representatives, thereby resolving the case of $d = 6$ for the problem of determining the minimum cardinality of one-way LOCC indistinguishable GBS sets in (Yuan et al. in Quantum Inf Process. 18:145, 2019) or (Zhang et al. in Phys Rev A 91:012329, 2015).

arXiv:2503.23073EPJ Quantum TechnologyJul 28, 20251 citation

n

labelled vertices in

\widetilde O(n^{6.38})

bit operations and constructs exact single-qubit unitaries whenever the states are equivalent. Building on Claudet and Perdrix's quasipolynomial algorithm, we replace the enumeration of vertex subsets by a compact system of constraints generated from pairs and triples. The remaining graph transformation is found by solving linear equations over the binary field. These new steps cost

\widetilde O(n^5)

bit operations; the inherited graph preprocessing sets the overall bound. We also count the local-Clifford (LC) classes of graph states within any LU class: their number is a power of two, computable within the same bound. For any given graph state, this decides whether single-qubit Clifford gates reach every graph state in its LU class, and supplies a counterexample when they do not. The method also decides LU equivalence of stabilizer codes encoding one logical qubit.

Local unitary classification of sets of generalized Bell states in

\mathbb{C}^{d}\otimes \mathbb{C}^{d}

l\ (\geq 2)

generalized Bell states (GBSs), high-dimensional generalizations of Bell states, in a bipartite system

\mathbb{C}^{d}\otimes \mathbb{C}^{d}

with

d\geq 3

. Based on this classification, we determine the minimal cardinality of indistinguishable GBS sets in

\mathbb{C}^{6}\otimes \mathbb{C}^{6}

under one-way local operations and classical communication (one-way LOCC). We first propose two classification methods based on LU-equivalence for all sets of l GBSs (l-GBS sets). We then establish LU-classification for all 2-GBS, 3-GBS, 4-GBS and 5-GBS sets in

\mathbb{C}^{6}\otimes \mathbb{C}^{6}

. Since LU-equivalent sets share identical local distinguishability, it suffices to examine representative GBS sets from equivalent classes. Notably, we identify a one-way LOCC indistinguishable 4-GBS set among these representatives, thereby resolving the case of

d = 6

for the problem of determining the minimum cardinality of one-way LOCC indistinguishable GBS sets in (Yuan et al. in Quantum Inf Process. 18:145, 2019) or (Zhang et al. in Phys Rev A 91:012329, 2015).