paper

Complexity of mixed Gaussian states from Fisher information geometry

arXiv:2006.00921 · doi:10.1007/JHEP12(2020)101

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.

arXiv comment107 pages, 12 figures. v2; various improvements, published version

References in corpus (86)

Cited by in corpus (28)