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: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
arXivHTMLPDF

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

Necessary and sufficient conditions for local unitary equivalence of multiqubit states

Ana María Guerra Martins

We derive the necessary and sufficient conditions for the local unitary (LU) equivalence of two general (pure or mixed) $n$-qubit states and determine the local unitary operators connecting them. Almost all relevant information is contained in the one-qubit reduced matrices of the multiqubit states under investigation. Our technique relies on identifying ab initio all local symmetries and the corresponding local cyclic unitary operators. To derive the above conditions we use the reference forms of the multiqubit states whose definition requires the diagonalization of the one-qubit reduced matrices. Based on those conditions, we propose a straightforward protocol to decide whether or not two $n$-qubit states are LU equivalent.

arXiv:1408.3840•Physical Review A•Apr 8, 2015•18 citations

Local unitary equivalence and entanglement of multipartite pure states

Barbara Kraus

The necessary and sufficient conditions for the equivalence of arbitrary $n$-qubit pure quantum states under local unitary (LU) operations derived in [B. Kraus, Phys. Rev. Lett. 104, 020504 (2010)] are used to determine the different LU-equivalence classes of up to five-qubit states. Due to this classification new parameters characterizing multipartite entanglement are found and their physical interpretation is given. Moreover, the method is used to derive examples of two $n$-qubit states (with $n>2$ arbitrary) which have the properties that all the entropies of any subsystem coincide; however, the states are neither LU equivalent nor can be mapped into each other by general local operations and classical communication.

arXiv:1005.5295•Physical Review A•Sep 30, 2010•89 citations

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.

quant-pharXiv:2609.22902•Sep 22, 2026•0 citations

Local Unitary Equivalence of Multipartite Pure States

Barbara Kraus

Necessary and sufficient conditions for the equivalence of arbitrary n-qubit pure quantum states under local unitary (LU) operations are derived. First, an easily computable standard form for multipartite states is introduced. Two generic states are shown to be LU equivalent iff their standard forms coincide. The LU-equivalence problem for nongeneric states is solved by presenting a systematic method to determine the LU operators (if they exist) which interconvert the two states.

arXiv:0909.5152•Physical Review Letters•Jan 14, 2010•143 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.

quant-pharXiv:2609.21558•Sep 21, 2026•1 citation

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.

quant-pharXiv:2610.00527•Oct 2, 2026•0 citations
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.
We derive the necessary and sufficient conditions for the local unitary (LU) equivalence of two general (pure or mixed) nnn-qubit states and determine the local unitary operators connecting them. Almost all relevant information is contained in the one-qubit reduced matrices of the multiqubit states under investigation. Our technique relies on identifying ab initio all local symmetries and the corresponding local cyclic unitary operators. To derive the above conditions we use the reference forms of the multiqubit states whose definition requires the diagonalization of the one-qubit reduced matrices. Based on those conditions, we propose a straightforward protocol to decide whether or not two nnn-qubit states are LU equivalent.
The necessary and sufficient conditions for the equivalence of arbitrary nnn-qubit pure quantum states under local unitary (LU) operations derived in [B. Kraus, Phys. Rev. Lett. 104, 020504 (2010)] are used to determine the different LU-equivalence classes of up to five-qubit states. Due to this classification new parameters characterizing multipartite entanglement are found and their physical interpretation is given. Moreover, the method is used to derive examples of two nnn-qubit states (with n>2n>2n>2 arbitrary) which have the properties that all the entropies of any subsystem coincide; however, the states are neither LU equivalent nor can be mapped into each other by general local operations and classical communication.
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 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-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 nnn labelled vertices in O~(n6.38)\widetilde O(n^{6.38})O(n6.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 O~(n5)\widetilde O(n^5)O(n5) 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.