Efficiently computing the Uhlmann fidelity for density matrices

Andrew J. Baldwin; Jonathan A. Jones

Efficiently computing the Uhlmann fidelity for density matrices

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2211.02623 v3 pith:HCFJWIBL submitted 2022-11-04 quant-ph

Andrew J. Baldwin , Jonathan A. Jones This is my paper

classification quant-ph

keywords computingdensityefficientlyfidelitymatricesuhlmannalternativeavailable

verification ladder T0 review T1 audit T2 compute T3 formal

0 comments

read the original 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.

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

Efficient computation of average subsystem Bures distance between fermionic Gaussian states
quant-ph 2025-08 unverdicted novelty 5.0 of 10

An efficient Bures-distance algorithm for fermionic Gaussian states shows linear average subsystem-distance growth in the integrable Ising chain, but not in quadratic SYK or random Gaussian states.

Pith tools