2021
DOI: 10.1016/j.laa.2020.12.014
|View full text |Cite
|
Sign up to set email alerts
|

A graphical calculus for integration over random diagonal unitary matrices

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

0
27
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
6

Relationship

3
3

Authors

Journals

citations
Cited by 11 publications
(27 citation statements)
references
References 27 publications
0
27
0
Order By: Relevance
“…We shall consider three situations: the first two correspond to the equations above, with the unitary U restricted to the class of diagonal unitary matrices (diagonal matrices with arbitrary complex phases), while the third one corresponds to U being restricted to diagonal orthogonal matrices (diagonal matrices with arbitrary signs). These classes of states, called respectively LDUI, CLDUI, and LDOI, have been introduced in [14,36,52]. We provide a detailed analysis of these matrices, from various points of views: linear algebra, convexity, positivity, separability, etc.…”
Section: Introductionmentioning
confidence: 99%
See 4 more Smart Citations
“…We shall consider three situations: the first two correspond to the equations above, with the unitary U restricted to the class of diagonal unitary matrices (diagonal matrices with arbitrary complex phases), while the third one corresponds to U being restricted to diagonal orthogonal matrices (diagonal matrices with arbitrary signs). These classes of states, called respectively LDUI, CLDUI, and LDOI, have been introduced in [14,36,52]. We provide a detailed analysis of these matrices, from various points of views: linear algebra, convexity, positivity, separability, etc.…”
Section: Introductionmentioning
confidence: 99%
“…It turns out that the classes of states we investigate are still rich enough for the separability problem to be intractable [67,63,36], but the situation is simpler, since the search space for separable decompositions is smaller. We describe the separability properties of these invariant states in terms of two cones of pairs and triples of matrices, called the pairwise completely positive [36] and the triplewise completely positive [52] cone, respectively. Both these notions can be understood as extensions of the classical case of completely positive matrices [4], which is a key notion in combinatorics and optimization [1].…”
Section: Introductionmentioning
confidence: 99%
See 3 more Smart Citations