Abstract
Given two states and of a quantum many-body system, one may use the overlap or fidelity to quantify how similar they are. To further resolve the similarity of and in space, one can consider their reduced density matrices and on various regions of the system and compute the Uhlmann fidelity . 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 of 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 noncritical states, and quantifying convergence in tensor network simulations.
- Received 5 July 2018
DOI:https://doi.org/10.1103/PhysRevA.98.042316
©2018 American Physical Society