Uhlmann fidelities from tensor networks

Abstract

Given two states $|\psi ⟩$ and $|\varphi ⟩$ of a quantum many-body system, one may use the overlap or fidelity $|⟨\psi |\varphi ⟩|$ to quantify how similar they are. To further resolve the similarity of $|\psi ⟩$ and $|\varphi ⟩$ in space, one can consider their reduced density matrices $\rho$ and $\sigma$ on various regions of the system, and compute the Uhlmann fidelity $F(\rho ,\sigma )=\mathrm{Tr}\sqrt{\sqrt{\rho }\sigma \sqrt{\rho }}$. In this paper, we show how computing such subsystem fidelities can be done efficiently in many cases when the two states are represented as tensor networks. Formulated using Uhlmann's theorem, such subsystem fidelities appear as natural quantities to extract for certain subsystems for Matrix Product States and Tree Tensor Networks, and evaluating them is algorithmically simple and computationally affordable. We demonstrate the usefulness of evaluating subsystem fidelities with three example applications: studying local quenches, comparing critical and non-critical states, and quantifying convergence in tensor network simulations.

9+3 pages, many figures; v2 matches the journal version, with some new content