Local unitary versus local Clifford equivalence of stabilizer and graph states

Abstract

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. \textbf{A71}, 062323]. Here, we broaden the class of stabilizer states for which LU equivalence implies LC equivalence ($LU\Leftrightarrow LC$) to include all stabilizer states represented by graphs with neither cycles of length 3 nor 4. To compare our result with Van den Nest et al.'s, we show that any stabilizer state of distance $δ=2$ is beyond their criterion. We then further prove that $LU\Leftrightarrow LC$ holds for a more general class of stabilizer states of $δ=2$. We also explicitly construct graphs representing $δ>2$ stabilizer states which are beyond their criterion: we identify all 58 graphs with up to 11 vertices and construct graphs with $2^m-1$ ($m\geq 4$) vertices using quantum error correcting codes which have non-Clifford transversal gates.