Quasi-factorization and Multiplicative Comparison of Subalgebra-Relative Entropy

December 02, 2019 Β· Declared Dead Β· πŸ› Journal of Mathematics and Physics

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

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Nicholas LaRacuente arXiv ID 1912.00983 Category quant-ph: Quantum Computing Cross-listed cs.IT Citations 13 Venue Journal of Mathematics and Physics Last Checked 5 months ago
Abstract
Purely multiplicative comparisons of quantum relative entropy are desirable but challenging to prove. We show such comparisons for relative entropies between comparable densities, including the relative entropy of a density with respect to its subalgebraic restriction. These inequalities are asymptotically tight in approaching known, tight inequalities as perturbation size approaches zero. Based on these results, we obtain a kind of inequality known as quasi-factorization or approximate tensorization of relative entropy. Quasi-factorization lower bounds the sum of a density's relative entropies to several subalgebraic restrictions in terms of its relative entropy to their intersection's subalgebraic restriction. As applications, quasi-factorization implies uncertainty-like relations, and with an iteration trick, it yields decay estimates of optimal asymptotic order on mixing processes described by finite, connected, undirected graphs.
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