Linked e-resources
Details
Table of Contents
Intro; Acknowledgements; Contents; 1 Introduction; 1.1 Classical Markov Chains; 1.1.1 Robustness of Classical Markov Chains; 1.2 Quantum Markov Chains; 1.2.1 Robustness of Quantum Markov Chains; 1.3 Outline; References; 2 Preliminaries; 2.1 Notation; 2.2 Schatten Norms; 2.3 Functions on Hermitian Operators; 2.4 Quantum Channels; 2.5 Entropy Measures; 2.5.1 Fidelity; 2.5.2 Relative Entropy; 2.5.3 Measured Relative Entropy; 2.5.4 Rényi Relative Entropy; 2.6 Background and Further Reading; References; 3 Tools for Non-commuting Operators; 3.1 Pinching; 3.1.1 Spectral Pinching.
3.1.2 Smooth Spectral Pinching3.1.3 Asymptotic Spectral Pinching; 3.2 Complex Interpolation Theory; 3.3 Background and Further Reading; References; 4 Multivariate Trace Inequalities; 4.1 Motivation; 4.2 Multivariate Araki-Lieb-Thirring Inequality; 4.3 Multivariate Golden-Thompson Inequality; 4.4 Multivariate Logarithmic Trace Inequality; 4.5 Background and Further Reading; References; 5 Approximate Quantum Markov Chains; 5.1 Quantum Markov Chains; 5.2 Sufficient Criterion for Approximate Recoverability; 5.2.1 Approximate Markov Chains are not Necessarily Close to Markov Chains.
3.1.2 Smooth Spectral Pinching3.1.3 Asymptotic Spectral Pinching; 3.2 Complex Interpolation Theory; 3.3 Background and Further Reading; References; 4 Multivariate Trace Inequalities; 4.1 Motivation; 4.2 Multivariate Araki-Lieb-Thirring Inequality; 4.3 Multivariate Golden-Thompson Inequality; 4.4 Multivariate Logarithmic Trace Inequality; 4.5 Background and Further Reading; References; 5 Approximate Quantum Markov Chains; 5.1 Quantum Markov Chains; 5.2 Sufficient Criterion for Approximate Recoverability; 5.2.1 Approximate Markov Chains are not Necessarily Close to Markov Chains.