Efficiently computing the Uhlmann fidelity for density matrices

Andrew J. Baldwin and Jonathan A. Jones
Phys. Rev. A 107, 012427 – Published 26 January 2023

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.

  • Received 14 November 2022
  • Accepted 11 January 2023

DOI:https://doi.org/10.1103/PhysRevA.107.012427

©2023 American Physical Society

Physics Subject Headings (PhySH)

Quantum Information, Science & Technology

Authors & Affiliations

Andrew J. Baldwin*

  • Chemistry Research Laboratory, University of Oxford, Mansfield Road, Oxford OX1 3TA, United Kingdom and Kavli Institute for Nanoscience Discovery, University of Oxford, Oxford OX1 3QU, United Kingdom

Jonathan A. Jones

  • Clarendon Laboratory, University of Oxford, Parks Road, Oxford OX1 3PU, United Kingdom

  • *andrew.baldwin@chem.ox.ac.uk
  • jonathan.jones@physics.ox.ac.uk

Article Text (Subscription Required)

Click to Expand

References (Subscription Required)

Click to Expand
Issue

Vol. 107, Iss. 1 — January 2023

Reuse & Permissions
Access Options
Author publication services for translation and copyediting assistance advertisement

Authorization Required


×
×

Images

×

Sign up to receive regular email alerts from Physical Review A

Log In

Cancel
×

Search


Article Lookup

Paste a citation or DOI

Enter a citation
×