Entanglement in multipartite quantum systems in the context of graph states

Mojtaba Jafarpour, Leila Assadi

Saeed Haddadi

Ali Saif M. Hassan

This thesis is an attempt to enhance understanding of the following questions A- Given a multipartite quantum state (possibly mixed), how to find out whether it is entangled or separable? (Detection of entanglement.) B- Given an entangled state, how to decide how much entangled it is? (Measure of entanglement.), in the context of multipartite quantum states. We have explored two approaches. In the first approach, we assign a weighted graph with multipartite quantum state and address the question of separability in terms of these graphs and various operations involving them. In the second approach we use the so called Bloch representation of multipartite quantum states to establish new criteria for detection of multipartite entangled states. We further give a new measure for entanglement in $N$-qubit entangled pure state and formally extend it to cover $N$-qubit mixed states.

Christopher Vairogs, Samihr Hermes, Felix Leditzky

We study the task of localizing multipartite entanglement in pure quantum states onto a subsystem by measuring the remaining systems. To this end, we fix a multipartite entanglement measure and consider two quantities: the multipartite entanglement of assistance (MEA), defined as the entanglement measure averaged over the post-measurement states and maximized over arbitrary measurements; and the localizable multipartite entanglement (LME), defined in the same way but restricted to only local single-system measurements. Both quantities generalize previously considered bipartite entanglement localization measures. In our work we choose the n-tangle, the genuine multipartite entanglement concurrence and the concentratable entanglement (CE) as the underlying seed measure, and discuss the resulting MEA and LME quantities. First, we prove easily computable upper and lower bounds on MEA and LME and establish Lipschitz-continuity for the n-tangle and CE-based LME and MEA. Using these bounds we investigate the typical behavior of entanglement localization by deriving concentration inequalities for the MEA evaluated on Haar-random states and performing numerical studies for small tractable system sizes. We then turn our attention to protocols that transform graph states. We give a simple criterion based on a matrix equation to decided whether states with a specified n-tangle value can be obtained from a given graph state, providing no-go theorems for a broad class of such graph state transformations beyond the usual “local Clifford plus local Pauli measurement” framework. This analysis is generalized to weighted graph states, which provide a realistic error model in current experiments preparing graph state. Our entanglement localization framework certifies the near-optimality of recently discussed local-measurement protocols to transform uniformly weighted line graph states into GHZ states, even when considering arbitrary entangled measurements. Finally, we demonstrate how our MEA and LME quantities can be used to detect critical phenomena such as phase transitions in transversal field Ising models. Since entanglement localization is operationally relevant throughout quantum networking and measurement-based quantum computation, our framework of results based on the MEA and LME has the potential for broad applications in these fields.

Ri Qu, Bing-jian Shang, Juan Wang +4 more

S. Shelly Sharma, Naresh Kumar Sharma