Efficiently computing the Uhlmann fidelity for density matrices
Andrew J. Baldwin, Jonathan A. Jones
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.
Topics & Concepts
FidelityMatrix (chemical analysis)Computer scienceApplied mathematicsFactor (programming language)Mathematical optimizationMathematicsAlgorithmTelecommunicationsProgramming languageMaterials scienceComposite materialMatrix Theory and AlgorithmsTensor decomposition and applicationsBlind Source Separation Techniques