In mathematics, Weingarten functions are rational functions indexed by partitions of integers that can be used to calculate integrals of products of matrix coefficients over classical groups. They were first studied by Weingarten (1978) who found their asymptotic behavior, and named by Collins (2003), who evaluated them explicitly for the unitary group.

Unitary groups

edit

Weingarten functions are used for evaluating integrals over the unitary group Ud of products of matrix coefficients.

Consider in general an integral of the form It can be shown that the integral would be zero, unless  .[1] Thus, consider only integrals of the form   where   denotes complex conjugation. Note that   where   is the conjugate transpose of  , so one can interpret the above expression as being for the   matrix element of  .

This integral is equal to where  , and   is the Weingarten function, given by   where the sum is over all partitions λ of n (Collins 2003). Here χλ is the character of Sn corresponding to the partition λ and s is the Schur polynomial of λ, so that sλ,d(1) is the dimension of the representation of Ud corresponding to λ.

The Weingarten functions are rational functions in d. They can have poles for small values of d, which cancel out in the formula above. There is an alternative inequivalent definition of Weingarten functions, where one only sums over partitions with at most d parts. This is no longer a rational function of d, but is finite for all positive integers d. The two sorts of Weingarten functions coincide for d larger than n, and either can be used in the formula for the integral.

The integrals are called the link integrals in   lattice gauge theory.[1] See [2][3] for a graphical method for evaluating these integrals, inspired by quantum string diagrams.

Examples of Weingarten functions

edit

The first few Weingarten functions  where permutations σ are denoted by their cycle shapes. For example, in  , the permutation is the trivial permutation on 0 elements. In  , the permutation is the permutation on 4 elements that preserves 2 elements, and exchanges 2 elements.

There exist computer algebra programs to produce these expressions.[4][5]

edit

 

Asymptotics

edit

Given a permutation  , there is a trivial part and a nontrivial part. The trivial part fixes elements, and the nontrivial part permutes the elements in cycles. This can be written out in the cycle notation for permutations. For example, the following permutation   has the nontrivial part  .

Given a fixed permutation   on   elements, as the size of the unitary group grows to  , we have the asymptotic formula where   are the cycles of  ,   is the length of cycle  ,   is a Catalan number, and   is the smallest number of transpositions (pairwise exchange) that   is composed of. This formula can be used to prove that the algebra of the gaussian unitary ensemble converges to the free probability algebra.[1]

Higher order expansions exist, of the form   where   is given above, and   are real numbers that depend on   but not  . The full expansion is:[1] where   is the number of weakly monotone walks on   from   to   of length  . To define weakly monotone walk, we construct the Cayley graph of  . Each directed edge is obtained by multiplying on the right by a transposition. Now, a weakly monotone walk on the Cayley graph is a path   such that  .

There exists a diagrammatic method[6] to systematically calculate the integrals over the unitary group as a power series in 1/d.

Example asymptotics

edit

Let  . It acts on   elements. It decomposes into cycles with lengths  ,  ,  .

Applying   with   cycles gives  .

The Catalan factors are   for the 3-cycle,   for the 2-cycle, and   for each 1-cycle, so the product in the leading term equals  .

Therefore the leading asymptotic term is  .

Notice that in the above calculation, the trivial part   did not matter at all. This is because   in that case. Thus in general, the asymptotic expression depends only on the nontrivial part of the permutation.

Orthogonal and symplectic groups

edit

For orthogonal and symplectic groups the Weingarten functions were evaluated by Collins & Śniady (2006). Their theory is similar to the case of the unitary group. They are parameterized by partitions such that all parts have even size.

Further reading

edit

Introductions

edit
  • Mele, Antonio Anna (2024-05-08). "Introduction to Haar Measure Tools in Quantum Information: A Beginner's Tutorial". Quantum. 8: 1340. arXiv:2307.08956. Bibcode:2024Quant...8.1340M. doi:10.22331/q-2024-05-08-1340. ISSN 2521-327X.
  • Collins, Benoit; Matsumoto, Sho; Novak, Jonathan (2022-05-01). "The Weingarten Calculus" (PDF). Notices of the American Mathematical Society. 69 (5): 1. doi:10.1090/noti2474. ISSN 0002-9920.

Historical works

edit

References

edit
  1. ^ a b c d Collins, Benoit; Matsumoto, Sho; Novak, Jonathan (2022-05-01). "The Weingarten Calculus" (PDF). Notices of the American Mathematical Society. 69 (5): 1. doi:10.1090/noti2474. ISSN 0002-9920.
  2. ^ Collins, Benoît; Nechita, Ion (2010-07-01). "Random Quantum Channels I: Graphical Calculus and the Bell State Phenomenon". Communications in Mathematical Physics. 297 (2): 345–370. arXiv:0905.2313. Bibcode:2010CMaPh.297..345C. doi:10.1007/s00220-010-1012-0. ISSN 1432-0916.
  3. ^ Ion Nechita, "Weingarten calculus and applications to Quantum Information Theory" – Annual meeting of the SFB TRR 195 Tübingen – September 2018
  4. ^ Z. Puchała and J.A. Miszczak, Symbolic integration with respect to the Haar measure on the unitary group in Mathematica., arXiv:1109.4244 (2011).
  5. ^ M. Fukuda, R. König, and I. Nechita, RTNI - A symbolic integrator for Haar-random tensor networks., arXiv:1902.08539 (2019).
  6. ^ Brouwer, P. W.; Beenakker, C. W. J. (1996). "Diagrammatic method of integration over the unitary group, with applications to quantum transport in mesoscopic systems". Journal of Mathematical Physics. 37 (10): 4904–4934. arXiv:cond-mat/9604059. Bibcode:1996JMP....37.4904B. doi:10.1063/1.531667.