Strong subadditivity lower bound and quantum channels

DOI10.1007/S11128-022-03419-7MaRDI QIDQ2102304OpenAlexFDO

Authors Leandro R. S. Mendes, Marcos Cesar de Oliveira

Publication date 28 November 2022

Published in Quantum Information Processing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1802.09300

zbMATH Keywords

quantum correlationquantum entanglementquantum data processingstrong subadditivity of the von Neumann entropy

Mathematics Subject Classification ID

Quantum coherence, entanglement, quantum correlations (81P40) Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Quantum channels, fidelity (81P47)

Recommendations

• Structure of states which satisfy strong subadditivity of quantum entropy with equality
• Bounds for entanglement via an extension of strong subadditivity of entropy
• A new inequality for the von Neumann entropy
• Limitation on the Amount of Accessible Information in a Quantum Channel
• A lower bound of quantum conditional mutual information

Cites work

• scientific article; zbMATH DE number 107482 (Why is no real title available?)
• Classical, quantum and total correlations
• Infinitely Many Constrained Inequalities for the von Neumann Entropy
• Locally inaccessible information as a fundamental ingredient to quantum information
• MONOTONICITY OF QUANTUM RELATIVE ENTROPY REVISITED
• Mixed-state entanglement and quantum error correction
• Quantum discord: a measure of the quantumness of correlations
• Quantum information theory
• Structure of states which satisfy strong subadditivity of quantum entropy with equality

Cited in

(7)

• Strong subadditivity for log-determinant of covariance matrices and its applications
• scientific article; zbMATH DE number 1406135 (Why is no real title available?)
• Limitation on the Amount of Accessible Information in a Quantum Channel
• A lower bound of quantum conditional mutual information
• Computable lower bounds on the entanglement cost of quantum channels
• Properties of subentropy
• A new quantum data processing inequality

This page was built for publication: Strong subadditivity lower bound and quantum channels

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2102304)