An efficient algorithm to recognize local Clifford equivalence of graph states

Details An efficient algorithm to recognize local Clifford equivalence of graph states An efficient algorithm to recognize local Clifford equivalence of graph states

2004-05-05

arxiv.org/abs/quant-ph/0405023v2

Phys. Rev. A 70, 034302 (2004)

Physics

Quantum Physics

3 pages. Accepted in Phys. Rev. A

Scientific paper

10.1103/PhysRevA.70.034302

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.

Affiliated with

Also associated with

No associations

Rating

An efficient algorithm to recognize local Clifford equivalence of graph states does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with An efficient algorithm to recognize local Clifford equivalence of graph states, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An efficient algorithm to recognize local Clifford equivalence of graph states will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-467653