Graph States Under the Action of Local Clifford Group in Non-Binary Case

Abstract

Graph states are well-entangled quantum states that are defined based on a graph. Of course, if two graphs are isomorphic their associated states are the same. Also, we know local operations do not change the entanglement of quantum states. Therefore, graph states that are either isomorphic or equivalent under the local Clifford group have the same properties. In this paper, we first establish a bound on the number of graph states which are neither isomorphic nor equivalent under the action of local Clifford group. Also, we study graph states in non-binary case. We translate the action of local Clifford group, as well as measurement of Pauli operators, into transformations on their associated graphs. Finally, we present an efficient algorithm to verify whether two graph states, in non-binary case, are locally equivalent or not.

10 pages, 2 figures, corrected various minor errors and added references

Cited by in corpus (16)

• Noise Thresholds for Higher Dimensional Systems using the Discrete Wigner Function
• Absolutely Maximally Entangled Qudit Graph States
• Device-independent detection of genuine multipartite entanglement for all pure states
• Codeword stabilized quantum codes: algorithm and structure
• Universal quantum computing using $({\mathbb{Z}}_d{)}^3$ symmetry-protected topologically ordered states
• Transformations of Stabilizer States in Quantum Networks
• The Capacity of Classical Summation over a Quantum MAC with Arbitrarily Distributed Inputs and Entanglements
• Shor-Laflamme distributions of graph states and noise robustness of entanglement
• Scheme for constructing graphs associated with stabilizer quantum codes
• An Efficient Algorithm to Recognize Locally Equivalent Graphs in Non-Binary Case
• The Foliage Partition: An Easy-to-Compute LC-Invariant for Graph States
• Enumerating the Classes of Local Equivalency in Graphs
• Small quantum networks in the qudit stabilizer formalism
• $\chi$-Colorable Graph States: Closed-Form Expressions and Quantum Orthogonal Arrays
• Separable Operations, Graph Codes and the Location of Quantum Information
• Access structure in graphs in high dimension and application to secret sharing