Title: Efficient algorithm to recognize the local Clifford equivalence of graph states
Authors: Van den Nest, Maarten ×
Dehaene, Jeroen
De Moor, Bart #
Issue Date: Sep-2004
Publisher: American physical soc
Series Title: Physical Review A, Atomic, Molecular and Optical Physics vol:70 issue:3 pages:034302
Abstract: In Van den Nest [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, published in A. Bouchet [Combinatorica 11, 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.
ISSN: 1050-2947
Publication status: published
KU Leuven publication type: IT
Appears in Collections:Tutorial services, Faculty of Engineering
ESAT - STADIUS, Stadius Centre for Dynamical Systems, Signal Processing and Data Analytics
× corresponding author
# (joint) last author

Files in This Item:

There are no files associated with this item.

Request a copy


All items in Lirias are protected by copyright, with all rights reserved.

© Web of science