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.
Efficiently computing the Uhlmann fidelity for density matrices
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
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.
fields
quant-ph 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Efficient computation of average subsystem Bures distance between fermionic Gaussian states
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.