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\iff 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 $\delta =2$ is beyond their criterion. We then further prove that $LU\iff LC$ holds for a more general class of stabilizer states of $\delta =2$. We also explicitly construct graphs representing $\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-1$ ($m\ge 4$) vertices using quantum error correcting codes which have non-Clifford transversal gates.

Revised version according to referee's comments. To appear in Physical Review A

References in corpus (1)

• Multi-party entanglement in graph states

Cited by in corpus (25)

• Qudits and high-dimensional quantum computing
• Qudit versions of the qubit "pi-over-eight" gate
• Multipartite Entanglement in Stabilizer Tensor Networks
• Subsystem stabilizer codes cannot have a universal set of transversal gates for even one encoded qudit
• Generation of arbitrary all-photonic graph states from quantum emitters
• Graph states and local unitary transformations beyond local Clifford operations
• Tripartite Entanglement in Qudit Stabilizer States and Application in Quantum Error Correction
• Graphical description of local Gaussian operations for continuous-variable weighted graph states
• Magic State Distillation from Entangled States
• Near-term $n$ to $k$ distillation protocols using graph codes
• Multipartite purification protocols: upper and optimal bounds
• Compact set of invariants characterizing graph states of up to eight qubits
• Minimal instances for toric code ground states
• Graph Picture of Linear Quantum Networks and Entanglement
• On the local equivalence of complete bipartite and repeater graph states
• Transversality versus Universality for Additive Quantum Codes
• On Local Equivalence, Surface Code States and Matroids
• Minimum Degree up to Local Complementation: Bounds, Parameterized Complexity, and Exact Algorithms
• Hamiltonian-based graph-state ansatz for variational quantum algorithms
• The Min-Entropy of Classical-Quantum Combs for Measurement-Based Applications
• Learning quantum graph states with product measurements
• Stabilizer configuration interaction: Finding molecular subspaces with error detection properties
• The Study of Entangled States in Quantum Computation and Quantum Information Science
• Covering a Graph with Minimal Local Sets
• Automorphisms of stabilizer codes