Efficiently computing the Uhlmann fidelity for density matrices
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.
Main Authors: | , |
---|---|
Format: | Journal article |
Language: | English |
Published: |
American Physical Society
2023
|