An efficient algorithm to recognize local Clifford equivalence of graph states

Abstract

In [Phys. Rev. A 69, 022316 (2004)] we presented a description of the action of local Clifford operations on graph states in terms of a graph transformation rule, known in graph theory as \emph{local complementation}. It was shown that two graph states are equivalent under the local Clifford group if and only if there exists a sequence of local complementations which relates their associated graphs. In this short note we report the existence of a polynomial time algorithm, published in [Combinatorica 11 (4), 315 (1991)], which decides whether two given graphs are related by a sequence of local complementations. Hence an efficient algorithm to detect local Clifford equivalence of graph states is obtained.

3 pages. Accepted in Phys. Rev. A

References in corpus (5)

• Measurement-based quantum computation with cluster states
• Multi-party entanglement in graph states
• Graphical description of the action of local Clifford transformations on graph states
• Multiparticle entanglement purification for graph states
• Graphs, Quadratic Forms, and Quantum Codes

Cited by in corpus (40)

• Ultracold atomic gases in optical lattices: mimicking condensed matter physics and beyond
• Entanglement Detection in the Stabilizer Formalism
• Quantitative entanglement witnesses
• Multiparticle entanglement purification for two-colorable graph states
• Quantum network routing and local complementation
• Entanglement on mixed stabiliser states--I: Normal Forms and Reduction Procedures
• Local unitary versus local Clifford equivalence of stabilizer states
• Two-setting Bell Inequalities for Graph States
• Optical generation of matter qubit graph states
• Transforming graph states using single-qubit operations
• Mapping graph state orbits under local complementation
• On Self-Dual Quantum Codes, Graphs, and Boolean Functions
• Transforming graph states to Bell-pairs is NP-Complete
• Graph states and local unitary transformations beyond local Clifford operations
• Graphical description of local Gaussian operations for continuous-variable weighted graph states
• Finite set of invariants to characterize local Clifford equivalence of stabilizer states
• Limitations of nearest-neighbour quantum networks
• Direct evaluation of pure graph state entanglement
• Graph-theoretical optimization of fusion-based graph state generation
• Compilation of algorithm-specific graph states for quantum circuits
• Derandomizing quantum circuits with measurement based unitary designs
• Symmetries and entanglement of stabilizer states
• Fast graph operations in quantum computation
• An introduction to one-way quantum computing in distributed architectures
• On the local equivalence of complete bipartite and repeater graph states
• On Local Equivalence, Surface Code States and Matroids
• Multipartite entangled states with two bosonic modes and qubits
• Counting single-qubit Clifford equivalent graph states is #P-Complete
• Optimization of deterministic photonic graph state generation via local operations
• GraphiQ: Quantum circuit design for photonic graph states
• Port-based entanglement teleportation via noisy resource states
• Localizing genuine multiparty entanglement in noisy stabilizer states
• Generating graph states with a single quantum emitter and the minimum number of fusions
• Clifford Manipulations of Stabilizer States: A graphical rule book for Clifford unitaries and measurements on cluster states, and application to photonic quantum computing
• The Foliage Partition: An Easy-to-Compute LC-Invariant for Graph States
• Asymptotic teleportation schemes bridging between standard and port-based teleportation
• Minimising the number of edges in LC-equivalent graph states
• Distinguishing Graph States by the Properties of Their Marginals
• $\chi$-Colorable Graph States: Closed-Form Expressions and Quantum Orthogonal Arrays
• Automated discovery of heralded ballistic graph state generators for fusion-based photonic quantum computation