Efficient algorithm to recognize the local Clifford equivalence of graph states

@article{Nest2004EfficientAT,
  title={Efficient algorithm to recognize the local Clifford equivalence of graph states},
  author={Maarten Van den Nest and Jeroen Dehaene and Bart De Moor},
  journal={Physical Review A},
  year={2004},
  volume={70},
  pages={034302}
}
In Van den Nest et al. [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 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 Brief Report we report the existence of a polynomial time algorithm… 
Graph states and local unitary transformations beyond local Clifford operations
TLDR
This work focuses on non-Clifford operations and finds for certain transformations a graphical description in terms of weighted hypergraphs that leads to the indentification of hypergraph states that are locally equivalent to graph states.
Local equivalence of complete bipartite and repeater graph states
Classifying locally equivalent graph states, and stabilizer states more broadly, is a significant problem in the theories of quantum information and multipartite entanglement. A special focus is
Algorithmic approaches to graph states under the action of local Clifford groups
Graph states are quantum states (quantum codes) in qn-dimensional space (Cq)®n = Cq S ·... C (q being a power of some prime number) which can be described by graphs with edges labeled from the field
The complexity of the vertex-minor problem
Counting single-qubit Clifford equivalent graph states is #P-Complete
TLDR
This paper considers the computational complexity of, given a graph state |G>, counting the number of graph states, single-qubit Clifford equivalent to |G>.
Local unitary versus local Clifford equivalence of stabilizer states
We study the relation between local unitary (LU) equivalence and local Clifford (LC) equivalence of stabilizer states. We introduce a large subclass of stabilizer states, such that every two LU
Mapping graph state orbits under local complementation
TLDR
This work finds direct links between the connectivity of certain orbits with the entanglement properties of their component graph states, and observes the correlations between graph-theoretical orbit properties, with Schmidt measure and preparation complexity and suggest potential applications.
Local Equivalence of Surface Code States
TLDR
This paper shows that surface code states do not contain any counterexamples to the recently disproved LU-LC conjecture, and shows that these states can be characterized as a class of minor closed binary matroids.
Invariants of the local Clifford group
We study the algebra of complex polynomials which remain invariant under the action of the local Clifford group under conjugation. Within this algebra, we consider the linear spaces of homogeneous
Finite set of invariants to characterize local Clifford equivalence of stabilizer states
The classification of stabilizer states under local Clifford (LC) equivalence is of particular importance in quantum error-correction and measurement-based quantum computation. Two stabilizer states
...
...

References

SHOWING 1-10 OF 10 REFERENCES
Graphical description of the action of local Clifford transformations on graph states
We translate the action of local Clifford operations on graph states into transformations on their associated graphs, i.e., we provide transformation rules, stated in purely graph theoretical terms,
An efficient algorithm to recognize locally equivalent graphs
TLDR
This paper associates a system of equations with unknowns inGF(2) to any pair of graphs {F, F′}, so that F is locally equivalent to F′ if and only if the system has a solution.
Recognizing locally equivalent graphs
Multiparty entanglement in graph states
TLDR
This work characterize and quantify the genuine multiparticle entanglement of such graph states in terms of the Schmidt measure, to which it provides upper and lower bounds in graph theoretical terms.
Multiparticle entanglement purification for graph states.
We introduce a class of multiparticle entanglement purification protocols that allow us to distill a large class of entangled states. These include cluster states, Greenberger-Horne-Zeilinger states,
Measurement-based quantum computation on cluster states
We give a detailed account of the one-way quantum computer, a scheme of quantum computation that consists entirely of one-qubit measurements on a particular class of entangled states, the cluster
Stabilizer Codes and Quantum Error Correction
TLDR
An overview of the field of quantum error correction and the formalism of stabilizer codes is given and a number of known codes are discussed, the capacity of a quantum channel, bounds on quantum codes, and fault-tolerant quantum computation are discussed.
Graphs, quadratic forms, and quantum codes
TLDR
It is shown that any stabilizer code over a finite field is equivalent to a graphical quantum code and the technique used in the proof establishes a new connection between quantum codes and quadratic forms.
Quantum Computation and Quantum Information
TLDR
This chapter discusses quantum information theory, public-key cryptography and the RSA cryptosystem, and the proof of Lieb's theorem.
Stabilizer codes can be realized as graph codes
We establish the connection between a recent new construction technique for quantum error correcting codes, based on graphs, and the so-called stabilizer codes: Each stabilizer code can be realized