A Unified Approach to Quantum Contraction and Correlation Coefficients

May 21, 2025 Β· Declared Dead Β· πŸ› arXiv.org

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Ian George, Marco Tomamichel arXiv ID 2505.15281 Category quant-ph: Quantum Computing Cross-listed cs.IT Citations 2 Venue arXiv.org Last Checked 5 months ago
Abstract
In classical information theory, the maximal correlation and $Ο‡^{2}$-contraction coefficient establish limits on distributed and sequential processing. Two distinct quantum maximal correlation coefficients have been proposed, but they do not extend all the classical results. Building on work of Petz, we use the family of non-commutative $L^{2}(p)$ spaces that extend the data processing inequality for variance to quantum theory to extend the classical results to quantum theory. We introduce families of quantum maximal correlation coefficients and identify quantum $Ο‡^{2}$-divergences as non-commutative generalizations of the variance of the likelihood ratio. We establish a family of maximal correlation coefficients that must all be ordered on a single copy level for an arbitrary number of copies of one state to be able to be converted to a single copy of another target state under local operations. We prove the equivalent characterizations of perfect classical correlation extraction via local operations in quantum theory. We clarify the relationship between maximal correlation and $Ο‡^{2}$-contraction coefficients by proving they are the same operator norms evaluated on distinct maps. Then we establish new equivalent conditions to the saturation of the data processing inequality for $Ο‡^{2}$-divergences. This implies previous saturation results for the $Ο‡^{2}$ and sandwiched RΓ©nyi divergences. Finally, we establish the quantum maximal correlation coefficients and $Ο‡^{2}$-contraction coefficients are often efficiently computable. This results in a generic method for efficiently computing mixing times of time-homogeneous quantum Markov chains with a unique full rank fixed point.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Quantum Computing

Died the same way β€” πŸ‘» Ghosted