Speaker
Tristan Kraft
Description
We consider graph states under party-local Clifford transformations (PLC). Such transformations arise e.g. in quantum networks where shared entanglement between spatially close nodes complements local operations. Bravyi et al solved PLC equivalence of graph states for 3 parties via the introduction of an entanglement generating set (EGS), a finite set of states into a collection of which every graph state decomposes uniquely under PLC. We show that EGS is infinite for $\ge 3$ parties and that finding states in the EGS is equivalent to the classification of tuples of alternating matrices. Moreover, we generalize the notion of local complementation, which describes the action of local Clifford transformations on graph states.
Authors
Barbara Kraus
Matthias Englbrecht
(University of Innsbruck)
Tristan Kraft
