Efficiently computing the Uhlmann fidelity for density matrices
Quantum Physics
2023-01-27 v3
Abstract
We consider the problem of efficiently computing the Uhlmann fidelity in the case when explicit density matrix descriptions are available. We derive an alternative formula which is simpler to evaluate numerically, saving a factor of 10 in time for large matrices.
Cite
@article{arxiv.2211.02623,
title = {Efficiently computing the Uhlmann fidelity for density matrices},
author = {Andrew J. Baldwin and Jonathan A. Jones},
journal= {arXiv preprint arXiv:2211.02623},
year = {2023}
}
Comments
Phys. Rev A (in press). 3 pages, no figures. Slightly revised following comments from reviewers and others