A graphical calculus for integration over random diagonal unitary matrices (Q2229450)

The authors present a graphical tool to compute the expectation of tensor network diagrams containing two collections of uniformly distributed unitary random vectors on a unit circle. The relevant mathematical tools, both from combinatorics and from graphical expressions for quantum networks, are briefly given in Section 3. The main result is stated in Theorem 4.8 where it is shown the the expectation can be expressed as a summation over diagrams constrained by several different rules of connections among the links replacing the random vectors. A similar statement is presented for the case of real vectors in Theorem 5.5. The remaining parts of the article exploit the applications of the two main relations to bipartite system networks concerning random unitary matrices including the analysis of twirling maps between matrix algebras. In addition, some observations for tripartite system networks are discussed in the application sections. The paper is written with heavy technicality in mathematics, hence the readers must be familiar with the concepts and the nomenclature used in combinatorics to well understand the analysis in the paper. However, the results and their derivations are well organised and straightforward. For the readers who are not familiar with combinatorics, I suggest, to begin with, the main statement in Section 4, especially with Theorem 4.8. The mathematical background in Section 3 can be used to follow the proof. In the application sections, despite the detailed discussions for the employed examples, there remain several open problems that one can investigate both mathematically and physically. For instance, the generalisation to the networks concerning multipartite matrices, the consideration of the different types of the underlying distribution, or the connection to the physical implementation of the considered networks, remain open.