Graph-Theoretic Analysis of $n$-Replica Time Evolution in the Brownian Gaussian Unitary Ensemble

In this paper, we investigate the $n$-replica time evolution operator $\mathcal{U}_n(t)\equiv e^{\mathcal{L}_nt} $ for the Brownian Gaussian Unitary Ensemble (BGUE) using a graph-theoretic approach. We examine the moments of the generating operator $\mathcal{L}_n$, which governs the Euclidean time evolution within an auxiliary $D^{2n}$-dimensional Hilbert space, where $D$ represents the dimension of the Hilbert space for the original system. Explicit representations for the cases of $n = 2$ and $n = 3$ are derived, emphasizing the role of graph categorization in simplifying calculations. Furthermore, we present a general approach to streamline the calculation of time evolution for arbitrary $n$, supported by a detailed example of $n = 4$. Our results demonstrate that the $n$-replica framework not only facilitates the evaluation of various observables but also provides valuable insights into the relationship between Brownian disordered systems and quantum information theory.

💡 Research Summary

The paper develops a graph‑theoretic framework for the n‑replica time‑evolution operator of the Brownian Gaussian Unitary Ensemble (BGUE). Starting from the stochastic Hamiltonian H_{ij}(t)=η_{ij}(t) with independent complex Gaussian white noise, the authors consider the averaged replicated unitary U^{⊗n}⊗U^{*⊗n} and define the Euclidean evolution 𝒰ₙ(t)=e^{𝓛ₙt}. The generator 𝓛ₙ consists of two families of elementary operators: P_{i\bar j}, which connect a contour i with its dual \bar j, and X_{ij}, X_{\bar i\bar j}, which exchange indices. These operators are naturally represented as edges in a graph.

A compact notation is introduced: any graph is written as F = Q_{p=1}^c a_i \bar b_i c