arXiv (OAI Expanded)
open access
Generalized Fidelity, the Data Processing Inequality, and Convexity
In this note, we show that the generalized Bures--Wasserstein distance induced by the generalized fidelity does not satisfy the data processing inequality in dimensions greater than two. In dimension two, although we do not settle the DPI in full generality, we derive two sufficient conditions guara
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Generalized Fidelity and the Data Processing Inequality#996578
- Hölder regularity of the top Lyapunov exponent for random matrix products with low-dimensional equator#1342031
- Martingale central limit theorems in $p$-Wasserstein distance#999080
- Pointwise Hölder continuity of Lyapunov exponents of random matrix products#1296705
- Algorithmic threshold for high-dimensional projection pursuit I: general theory#794206
Record · ID 1361470
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive