2018
DOI: 10.1088/1367-2630/aac3be
|View full text |Cite
|
Sign up to set email alerts
|

Entanglement polygon inequality in qubit systems

Abstract: We prove a set of tight entanglement inequalities for arbitrary N-qubit pure states. By focusing on all bi-partite marginal entanglements between each single qubit and its remaining partners, we show that the inequalities provide an upper bound for each marginal entanglement, while the known monogamy relation establishes the lower bound. The restrictions and sharing properties associated with the inequalities are further analyzed with a geometric polytope approach, and examples of three-qubit GHZ-class and W-c… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
35
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 33 publications
(35 citation statements)
references
References 31 publications
0
35
0
Order By: Relevance
“…Those three bipartite entanglements were found not completely independent by Qian et al [27]. In their work, the entanglement polygon inequality states that one entanglement cannot exceed the sum of the other two,…”
Section: Introductionmentioning
confidence: 88%
See 2 more Smart Citations
“…Those three bipartite entanglements were found not completely independent by Qian et al [27]. In their work, the entanglement polygon inequality states that one entanglement cannot exceed the sum of the other two,…”
Section: Introductionmentioning
confidence: 88%
“…Proof. We consider two types of bipartite entanglement, the squared concurrence C 2 and the normalized Schmidt weight Y [27]. Their relation is given by…”
Section: Appendix: Proof Of Theoremmentioning
confidence: 99%
See 1 more Smart Citation
“…[28]. The triangle concurrence for three-qubit state is constitute from the following triangle relation [28,39,40]:…”
Section: Genuine Entanglement Measurementioning
confidence: 99%
“…The traditional monogamy inequality (2) provides a lower bound for "one-to-group" entanglement, such "one-to-group" entanglements are also named quantum marginal entanglements [32]. There is another kind of entanglement distribution relation giving an upper bound for quantum marginal entanglements as the following polygon inequality [33]:…”
Section: Introductionmentioning
confidence: 99%