2008
DOI: 10.1103/physrevc.77.014301
|View full text |Cite
|
Sign up to set email alerts
|

Number of spinIstates for bosons

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

1
69
0

Year Published

2009
2009
2020
2020

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 42 publications
(70 citation statements)
references
References 9 publications
1
69
0
Order By: Relevance
“…Therefore, we should not assess one as either stronger or weaker than the other criterion, but rather complementing each other. There are also nonlinear extensions of the CCNR criterion using, for instance, the local uncertainty relations or covariance matrices [10][11][12][13], and other feasible methods [14]. Nevertheless, here we will not consider such extensions.…”
Section: Introductionmentioning
confidence: 99%
“…Therefore, we should not assess one as either stronger or weaker than the other criterion, but rather complementing each other. There are also nonlinear extensions of the CCNR criterion using, for instance, the local uncertainty relations or covariance matrices [10][11][12][13], and other feasible methods [14]. Nevertheless, here we will not consider such extensions.…”
Section: Introductionmentioning
confidence: 99%
“…Similarly to (7), we denote r = (r 0,1 , · · · , r 0,d1−1 , · · · , r d1−1,0 , · · · , r d1−1,d1−1 ) t and s = (s 0,1 , · · · , s 0,d2−1 , · · · , s d2−1,0 , · · · , s d2−1,d2−1 ) t , where t stands for transpose. Set T = (t ij ), where the entries t ij are given by the coefficients t lmkn , l, m = 0, · · · , d 1 − 1, k, n = 0, · · · , d 2 − 1, (l, m), (k, n) = (0, 0), with the first two indices lm associated with the array index i, and the last two indices kn with the column index j of T .…”
Section: Separability Criteria For Bipartite Statesmentioning
confidence: 99%
“…One basic problem is to determine whether a given bipartite state is entangled or separable. Although the problem is believed to be a nondeterministic polynomial-time hard problem, there are a number of operational criteria to deal with the problem, for example, the positive partial transpose (PPT) criterion [2,3], realignment criteria [4][5][6][7][8], covariance matrix criteria [9][10][11], correlation matrix criteria [12][13][14] and so on. More recently, some more separability criteria have been proposed [15][16][17][18][19][20].…”
Section: Introductionmentioning
confidence: 99%
“…Then, for separable states, the bound (Hofmann and Takeuchi, 2003). This is a very strong entanglement criterion and its properties have been studied in detail (Gittsovich et al, 2008;Gühne et al, 2006;Zhang et al, 2008).…”
Section: Steering Criteria Based On Local Uncertainty Relationsmentioning
confidence: 99%