Complexity of mixed Gaussian states from Fisher information geometry
Giuseppe Di Giulio, Erik Tonni
TL;DR
This work develops a geometric framework to quantify circuit complexity for mixed bosonic Gaussian states in harmonic lattices using the Fisher-Rao distance on covariance matrices. By exploiting Williamson's decomposition, it defines and analyzes spectrum and basis complexities, purification paths, and bounds, all without introducing ancillae. The formalism yields closed expressions for pure, thermal, coherent, and one-mode cases, and it is instantiated in harmonic chains where analytic and numerical results illustrate the behavior of complexity, mutual complexity, and subregion variants. The approach connects to entanglement structure through entanglement-hamiltonian paths and provides a bridge to related concepts in holography and Gaussian channels, highlighting both strengths and limitations of purification-based methods.
Abstract
We study the circuit complexity for mixed bosonic Gaussian states in harmonic lattices in any number of dimensions. By employing the Fisher information geometry for the covariance matrices, we consider the optimal circuit connecting two states with vanishing first moments, whose length is identified with the complexity to create a target state from a reference state through the optimal circuit. Explicit proposals to quantify the spectrum complexity and the basis complexity are discussed. The purification of the mixed states is also analysed. In the special case of harmonic chains on the circle or on the infinite line, we report numerical results for thermal states and reduced density matrices.
