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:0707.4000 · Quantum Information and Computation

The LU-LC conjecture, diagonal local operations and quadratic forms over GF(2)

D. Gross, M. Van den Nest

Published Mar 1, 2008• 34 citations
arXivHTMLPDF

Abstract

We report progress on the LU-LC conjecture---an open problem in the context of entanglement in stabilizer states (or graph states). This conjecture states that every two stabilizer states which are related by a local unitary operation, must also be related by a local operation within the Clifford group. The contribution of this paper is a reduction of the LU-LC conjecture to a simpler problem---which, however, remains to date unsolved. As our main result, we show that, if the LU-LC conjecture could be proved for the restricted case of \emph{diagonal} local unitary operations, then the conjecture is correct in its totality. Furthermore, the reduced version of the problem, involving such diagonal local operations, is mapped to questions regarding quadratic forms over the finite field GF(2). Finally, we prove that correctness of the LU-LC conjecture for stabilizer states implies a similar result for the more general case of stabilizer codes.

DOI
10.26421/qic8.3-4-3

Related papers

Local unitary versus local Clifford equivalence of stabilizer and graph states

Bei Zeng, Hyeyoun Chung, Andrew W. Cross +1 more

The equivalence of stabilizer states under local transformations is of fundamental interest in understanding properties and uses of entanglement. Two stabilizer states are equivalent under the usual stochastic local operations and classical communication criterion if and only if they are equivalent under local unitary (LU) operations. More surprisingly, under certain conditions, two LU-equivalent stabilizer states are also equivalent under local Clifford (LC) operations, as was shown by Van den Nest et al. [Phys. Rev. A 71, 062323 (2005)]. Here, we broaden the class of stabilizer states for which LU equivalence implies LC equivalence $(\mathrm{LU}\ensuremath{\Leftrightarrow}\mathrm{LC})$ to include all stabilizer states represented by graphs with cycles of length neither 3 nor 4. To compare our result with Van den Nest et al.'s, we show that any stabilizer state of distance $\ensuremath{\delta}=2$ is beyond their criterion. We then further prove that $\mathrm{LU}\ensuremath{\Leftrightarrow}\mathrm{LC}$ holds for a more general class of stabilizer states of $\ensuremath{\delta}=2$. We also explicitly construct graphs representing $\ensuremath{\delta}>2$ stabilizer states which are beyond their criterion: we identify all 58 graphs with up to 11 vertices and construct graphs with ${2}^{m}\ensuremath{-}1$ $(m\ensuremath{\geqslant}4)$ vertices using quantum error-correcting codes which have non-Clifford transversal gates.

arXiv:quant-ph/0611214•Physical Review A•Mar 19, 2007•53 citations

The LU-LC conjecture is false

Zhengfeng Ji, J.-X. Chen, Zhaohui Wei +1 more

The LU-LC conjecture is an important open problem concerning the structure of entanglement of states described in the stabilizer formalism. It states that two local unitary equivalent stabilizer states are also local Clifford equivalent. If this conjecture were true, the local equivalence of stabilizer states would be extremely easy to characterize. Unfortunately, however, based on the recent progress made by Gross and Van den Nest, we find that the conjecture is false.

arXiv:0709.1266•Quantum Information and Computation•Jan 1, 2010•77 citations

Graph states and local unitary transformations beyond local Clifford operations

Nikoloz Tsimakuridze, Otfried Gühne

Abstract Graph states are quantum states that can be described by a stabilizer formalism and play an important role in quantum information processing. We consider the action of local unitary operations on graph states and hypergraph states. We focus on non-Clifford operations and find for certain transformations a graphical description in terms of weighted hypergraphs. This leads to the indentification of hypergraph states that are locally equivalent to graph states. Moreover, we present a systematic way to construct pairs of graph states which are equivalent under local unitary operations, but not equivalent under local Clifford operations. This generates counterexamples to a conjecture known as LU-LC conjecture. So far, the only counterexamples to this conjecture were found by random search. Our method reproduces the smallest known counterexample as a special case and provides a physical interpretation.

arXiv:1611.06938•Journal of Physics A Mathematical and Theoretical•Mar 20, 2017•38 citations

Local equivalence, surface-code states, and matroids

Pradeep Kiran Sarvepalli, Robert Raussendorf

Recently, Ji et al. disproved the local-unitary--local Clifford (LU-LC) conjecture and showed that the local unitary (LU) and local Clifford (LC) equivalence classes of the stabilizer states are not always the same. Despite the fact that this settles the LU-LC conjecture, a sufficient condition for stabilizer states that violate the LU-LC conjecture is not known. In this paper, we investigate further the properties of stabilizer states with respect to local equivalence. Our first result shows that there exist infinitely many stabilizer states that violate the LU-LC conjecture. In particular, we show that for all numbers of qubits $n\ensuremath{\geqslant}28$, there exist distance-two stabilizer states which are counterexamples to the LU-LC conjecture. We prove that, for all odd $n\ensuremath{\geqslant}195$, there exist stabilizer states with distance greater than two that are LU equivalent but not LC equivalent. Two important classes of stabilizer states that are of great interest in quantum computation are the cluster states and stabilizer states of the surface codes. We show that, under some minimal restrictions, both these classes of states preclude any counterexamples. In this context, we also show that the associated surface codes do not have any encoded non-Clifford transversal gates. We characterize the Calderbank-Shor-Steane (CSS) surface-code states in terms of a class of minor closed binary matroids. In addition to making a connection to an important open problem in binary matroid theory, this characterization does in some cases provide an efficient test for CSS states that are not counterexamples.

arXiv:0911.1571•Physical Review A•Aug 5, 2010•14 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.

quant-pharXiv:2511.22271•Nov 28, 2025•4 citations

The 27-qubit Counterexample to the LU-LC Conjecture is Minimal

Nathan Claudet

It was once conjectured that two graph states are local unitary (LU) equivalent if and only if they are local Clifford (LC) equivalent. This so-called LU-LC conjecture was disproved in 2007, as a pair of 27-qubit graph states that are LU-equivalent, but not LC-equivalent, was discovered. We prove that this counterexample to the LU-LC conjecture is minimal. In other words, for graph states on up to 26 qubits, the notions of LU-equivalence and LC-equivalence coincide. This result is obtained by studying the structure of 2-local complementation, a special case of the recently introduced r-local complementation, and a generalization of the well-known local complementation. We make use of a connection with triorthogonal codes and Reed-Muller codes.

quant-pharXiv:2603.25219•Mar 27, 2026•4 citations
We report progress on the LU-LC conjecture---an open problem in the context of entanglement in stabilizer states (or graph states). This conjecture states that every two stabilizer states which are related by a local unitary operation, must also be related by a local operation within the Clifford group. The contribution of this paper is a reduction of the LU-LC conjecture to a simpler problem---which, however, remains to date unsolved. As our main result, we show that, if the LU-LC conjecture could be proved for the restricted case of \emph{diagonal} local unitary operations, then the conjecture is correct in its totality. Furthermore, the reduced version of the problem, involving such diagonal local operations, is mapped to questions regarding quadratic forms over the finite field GF(2). Finally, we prove that correctness of the LU-LC conjecture for stabilizer states implies a similar result for the more general case of stabilizer codes.
The equivalence of stabilizer states under local transformations is of fundamental interest in understanding properties and uses of entanglement. Two stabilizer states are equivalent under the usual stochastic local operations and classical communication criterion if and only if they are equivalent under local unitary (LU) operations. More surprisingly, under certain conditions, two LU-equivalent stabilizer states are also equivalent under local Clifford (LC) operations, as was shown by Van den Nest et al. [Phys. Rev. A 71, 062323 (2005)]. Here, we broaden the class of stabilizer states for which LU equivalence implies LC equivalence $(\mathrm{LU}\ensuremath{\Leftrightarrow}\mathrm{LC})$ to include all stabilizer states represented by graphs with cycles of length neither 3 nor 4. To compare our result with Van den Nest et al.'s, we show that any stabilizer state of distance $\ensuremath{\delta}=2$ is beyond their criterion. We then further prove that $\mathrm{LU}\ensuremath{\Leftrightarrow}\mathrm{LC}$ holds for a more general class of stabilizer states of $\ensuremath{\delta}=2$. We also explicitly construct graphs representing $\ensuremath{\delta}>2$ stabilizer states which are beyond their criterion: we identify all 58 graphs with up to 11 vertices and construct graphs with ${2}^{m}\ensuremath{-}1$ $(m\ensuremath{\geqslant}4)$ vertices using quantum error-correcting codes which have non-Clifford transversal gates.
Abstract Graph states are quantum states that can be described by a stabilizer formalism and play an important role in quantum information processing. We consider the action of local unitary operations on graph states and hypergraph states. We focus on non-Clifford operations and find for certain transformations a graphical description in terms of weighted hypergraphs. This leads to the indentification of hypergraph states that are locally equivalent to graph states. Moreover, we present a systematic way to construct pairs of graph states which are equivalent under local unitary operations, but not equivalent under local Clifford operations. This generates counterexamples to a conjecture known as LU-LC conjecture. So far, the only counterexamples to this conjecture were found by random search. Our method reproduces the smallest known counterexample as a special case and provides a physical interpretation.
Recently, Ji et al. disproved the local-unitary--local Clifford (LU-LC) conjecture and showed that the local unitary (LU) and local Clifford (LC) equivalence classes of the stabilizer states are not always the same. Despite the fact that this settles the LU-LC conjecture, a sufficient condition for stabilizer states that violate the LU-LC conjecture is not known. In this paper, we investigate further the properties of stabilizer states with respect to local equivalence. Our first result shows that there exist infinitely many stabilizer states that violate the LU-LC conjecture. In particular, we show that for all numbers of qubits $n\ensuremath{\geqslant}28$, there exist distance-two stabilizer states which are counterexamples to the LU-LC conjecture. We prove that, for all odd $n\ensuremath{\geqslant}195$, there exist stabilizer states with distance greater than two that are LU equivalent but not LC equivalent. Two important classes of stabilizer states that are of great interest in quantum computation are the cluster states and stabilizer states of the surface codes. We show that, under some minimal restrictions, both these classes of states preclude any counterexamples. In this context, we also show that the associated surface codes do not have any encoded non-Clifford transversal gates. We characterize the Calderbank-Shor-Steane (CSS) surface-code states in terms of a class of minor closed binary matroids. In addition to making a connection to an important open problem in binary matroid theory, this characterization does in some cases provide an efficient test for CSS states that are not counterexamples.
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.
It was once conjectured that two graph states are local unitary (LU) equivalent if and only if they are local Clifford (LC) equivalent. This so-called LU-LC conjecture was disproved in 2007, as a pair of 27-qubit graph states that are LU-equivalent, but not LC-equivalent, was discovered. We prove that this counterexample to the LU-LC conjecture is minimal. In other words, for graph states on up to 26 qubits, the notions of LU-equivalence and LC-equivalence coincide. This result is obtained by studying the structure of 2-local complementation, a special case of the recently introduced r-local complementation, and a generalization of the well-known local complementation. We make use of a connection with triorthogonal codes and Reed-Muller codes.