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.

Phys. Rev A (in press). 3 pages, no figures. Slightly revised following comments from reviewers and others

References in corpus (1)

• Alternative fidelity measure for quantum states

Cited by in corpus (9)

• Controlling NMR spin systems for quantum computation
• Instrumental distortions in quantum optimal control
• Efficient witnessing and testing of magic in mixed quantum states
• Efficient factored gradient descent algorithm for quantum state tomography
• Multivariate Fidelities
• Efficient fidelity estimation: Alternative derivation and related applications
• A new fidelity of quantum channel evolution and its geometric interpretation
• Subsystem fidelity in two-dimensional conformal field theories
• Efficient computation of average subsystem Bures distance between fermionic Gaussian states