D. Sutter. (2018)cite arxiv:1802.05477Comment: 110 pages; PhD thesis, ETH Zurich; to appear as SpringerBriefs in Mathematical Physics; contains material from arXiv:1507.00303, arXiv:1509.07127, arXiv:1604.03023, and arXiv:1705.06749.
Аннотация
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.
cite arxiv:1802.05477Comment: 110 pages; PhD thesis, ETH Zurich; to appear as SpringerBriefs in Mathematical Physics; contains material from arXiv:1507.00303, arXiv:1509.07127, arXiv:1604.03023, and arXiv:1705.06749
%0 Generic
%1 sutter2018approximate
%A Sutter, David
%D 2018
%K information quantum
%T Approximate quantum Markov chains
%U http://arxiv.org/abs/1802.05477
%X 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.
@misc{sutter2018approximate,
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.},
added-at = {2020-05-16T03:21:00.000+0200},
author = {Sutter, David},
biburl = {https://www.bibsonomy.org/bibtex/2626298951631fffd077782eaee7d3f01/gzhou},
description = {Approximate quantum Markov chains},
interhash = {229ab54420780615b1e116fa9e5667a5},
intrahash = {626298951631fffd077782eaee7d3f01},
keywords = {information quantum},
note = {cite arxiv:1802.05477Comment: 110 pages; PhD thesis, ETH Zurich; to appear as SpringerBriefs in Mathematical Physics; contains material from arXiv:1507.00303, arXiv:1509.07127, arXiv:1604.03023, and arXiv:1705.06749},
timestamp = {2020-05-16T03:21:00.000+0200},
title = {Approximate quantum Markov chains},
url = {http://arxiv.org/abs/1802.05477},
year = 2018
}