Paper detail

Randomized Graph States and their Entanglement Properties

We introduce a class of mixed multiqubit states, that corresponds to a randomized version of graph states. Such states arise when a graph state is prepared with noisy or imperfect controlled-Z gates. We study the entanglement features of these states by investigating both bipartite and genuine multipartite entanglement. Bipartite entanglement is studied via the concepts of connectedness and persistency, which are related to measurement based quantum computation. The presence of multipartite entanglement is instead revealed by the use of witness operators which are subsequently adapted to study nonlocal properties through the violation of suitable Bell inequalities. We also present results on the entanglement detection of particular randomized graph states, by deriving explicit thresholds for entanglement and nonlocality in terms of the noise parameter that characterizes the controlled-Z gates exploited for their generation. Finally, we propose a method to further improve the detection of genuine multipartite entanglement in this class of states.