Efficiently computing the Uhlmann fidelity for density matrices
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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.