Kavli Affiliate: Andrew Baldwin | Summary: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. | Search Query: arXiv Query: search_query=au:”Baldwin Andrew J.”&id_list=&start=0&max_results=10Read More