Approximate quantum Markov chains

DOI10.1007/978-3-319-78732-9MaRDI QIDQ4638305zbMATH OpenOpenAlexFDO

Authors David Sutter

Publication date 4 May 2018

Published in SpringerBriefs in Mathematical Physics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1802.05477, http://hdl.handle.net/20.500.11850/238570

zbMATH Keywords

approximate recoverabilityMarkov chainsnoncommutative entropyquantum Markov property

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to quantum theory (81-02) Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Quantum stochastic calculus (81S25) Measures of information, entropy (94A17)

Abstract: This book is an introduction to quantum Markov chains and explains how this concept is connected to the question of how well a lost quantum mechanical system can be recovered from a correlated subsystem. To achieve this goal, we strengthen the data-processing inequality such that it reveals a statement about the reconstruction of lost information. The main difficulty in order to understand the behavior of quantum Markov chains arises from the fact that quantum mechanical operators do not commute in general. As a result we start by explaining two techniques of how to deal with non-commuting matrices: the spectral pinching method and complex interpolation theory. Once the reader is familiar with these techniques a novel inequality is presented that extends the celebrated Golden-Thompson inequality to arbitrarily many matrices. This inequality is the key ingredient in understanding approximate quantum Markov chains and it answers a question from matrix analysis that was open since 1973, i.e., if Lieb's triple matrix inequality can be extended to more than three matrices. Finally, we carefully discuss the properties of approximate quantum Markov chains and their implications.

Recommendations

• Quantum conditional mutual information and approximate Markov chains
• Complete entropic inequalities for quantum Markov chains
• Universal recovery map for approximate Markov chains
• Quantum information theory and quantum statistics.
• Quantum Markov chains: a unification approach

Cited in

(25)

• Necessary criterion for approximate recoverability
• Geometric Rényi divergence and its applications in quantum channel capacities
• Quantitative lower bounds on the Lyapunov exponent from multivariate matrix inequalities
• Mean hitting times of quantum Markov chains in terms of generalized inverses
• Quantum approximate Markov chains are thermal
• Quantum hidden Markov models based on transition operation matrices
• Reachability Probabilities of Quantum Markov Chains
• The Quantum Complexity of Markov Chain Monte Carlo
• Quantum Markov chains and classical random sequences
• Quantum conditional mutual information and approximate Markov chains
• Equality conditions of data processing inequality for -z Rényi relative entropies
• QUANTUM MARKOVIAN APPROXIMATIONS FOR FERMIONIC RESERVOIRS
• Recoverability from direct quantum correlations
• Recovery map stability for the data processing inequality
• Multivariate trace inequalities, p-fidelity, and universal recovery beyond tracial settings
• Decay of quantum conditional mutual information for purely generated finitely correlated states
• Quantum Brascamp-Lieb dualities
• Matrix product states and the decay of quantum conditional mutual information
• Entanglement monogamy via multivariate trace inequalities
• Smooth min-entropy lower bounds for approximation chains
• Unified framework for continuity of sandwiched Rényi divergences
• On the distinguishability of geometrically uniform quantum states
• Generalized entanglement of purification criteria for 2-producible states in multipartite systems
• Virtual quantum Markov chain of four-qubit systems
• Robustness of quantum Markov chains

This page was built for publication: Approximate quantum Markov chains

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