2000 character limit reached
Unification of multi-qubit polygamy inequalities (1204.0293v1)
Published 2 Apr 2012 in quant-ph
Abstract: We establish a unified view of polygamy of multi-qubit entanglement. We first introduce a two-parameter generalization of entanglement of assistance namely unified entanglement of assistance for bipartite quantum states, and provide an analytic lowerbound in two-qubit systems. We show a broad class of polygamy inequalities of multi-qubit entanglement in terms of unified entanglement of assistance that encapsulates all known multi-qubit polygamy inequalities as special cases. We further show that this class of polygamy inequalities can be improved into tighter inequalities for three-qubit systems.
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.