English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Many determinantal inequalities for positive definite block matrices are consequences of general entropy inequalities, specialized to Gaussian distributed vectors with prescribed covariances. In particular, strong subadditivity (SSA) yields ln det VAC+ln det VBC-ln det VABC-ln det VC &#x2265; 0 for all 3 &#x00D7; 3 block matrices VABC, where subscripts identify principal submatrices. We shall refer to the above-mentioned inequality as SSA of log-det entropy. In this paper, we develop further insights on the properties of the above-mentioned inequality and its applications to classical and quantum information theory. In the first part of this paper, we show how to find known and new necessary and sufficient conditions under which saturation with equality occurs. Subsequently, we discuss the role of the classical transpose channel (also known as Petz recovery map) in this problem and find its action explicitly. We then prove some extensions of the saturation theorem, by finding faithful lower bounds on a log-det conditional mutual information. In the second part, we focus on quantum Gaussian states, whose covariance matrices are not only positive but obey additional constraints due to the uncertainty relation. For Gaussian states, the log-det entropy is equivalent to the Re&#x0301;nyi entropy of order 2. We provide a strengthening of log-det SSA for quantum covariance matrices that involves the so-called Gaussian Re&#x0301;nyi-2 entanglement of formation, a well-behaved entanglement measure defined via a Gaussian convex roof construction. We then employ this result to define a log-det entropy equivalent of the squashed entanglement measure, which is remarkably shown to coincide with the Gaussian Re&#x0301;nyi-2 entanglement of formation. This allows us to establish useful properties of such measure(s), such as monogamy, faithfulness, and additivity on Gaussian states.

From Log-Determinant Inequalities to Gaussian Entanglement via Recoverability Theory