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• 11 citations

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

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

Gross, D., M. Van den Nest

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 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.

arXiv:0707.4000Jul 27, 20071 citation

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

David Groß, Maarten Van den Nest

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

Quantum Information and ComputationMar 1, 200817 citations

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/0611214Physical Review AMar 19, 200739 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.1266Quantum Information and ComputationJan 1, 201046 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.06938Journal of Physics A Mathematical and TheoreticalMar 20, 201728 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.25219Mar 27, 20260 citations