Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

De Gruyter eBooks

7. Quantum Entropy and Information Quantities

Alexander S. Holevo

Published Jul 10, 2019• 0 citations
Publisher
DOI
10.1515/9783110642490-007

Related papers

Chapter 7. Quantum entropy and information quantities

De Gruyter eBooks•Nov 27, 2012•0 citations

A Hierarchy of Information Quantities for Finite Block Length Analysis of Quantum Tasks

Marco Tomamichel, Masahito Hayashi

We consider two fundamental tasks in quantum information theory, data compression with quantum side information, as well as randomness extraction against quantum side information. We characterize these tasks for general sources using so-called one-shot entropies. These characterizations-in contrast to earlier results-enable us to derive tight second-order asymptotics for these tasks in the i.i.d. limit. More generally, our derivation establishes a hierarchy of information quantities that can be used to investigate information theoretic tasks in the quantum domain: The one-shot entropies most accurately describe an operational quantity, yet they tend to be difficult to calculate for large systems. We show that they asymptotically agree (up to logarithmic terms) with entropies related to the quantum and classical information spectrum, which are easier to calculate in the i.i.d. limit. Our technique also naturally yields bounds on operational quantities for finite block lengths.

arXiv:1208.1478•IEEE Transactions on Information Theory•Aug 2, 2013•297 citations

Quantum Entropy and Information

Nilanjana Datta

Lecture notes in physics•Jan 1, 2010•3 citations

Some applications of matrix inequalities in Rényi entropy

Hadi Reisizadeh, Seyed Mahmoud Manjegani

The R{é}nyi entropy is one of the important information measures that generalizes Shannon's entropy. The quantum R{é}nyi entropy has a fundamental role in quantum information theory, therefore, bounding this quantity is of vital importance. Another important quantity is R{é}nyi relative entropy on which R{é}nyi generalization of the conditional entropy, and mutual information are defined based. Thus, finding lower bound for R{é}nyi relative entropy is our goal in this paper. We use matrix inequalities to prove new bounds on the entropy of type $β$, R{é}nyi entropy.

arXiv:1608.03362•Aug 11, 2016•1 citation

Topological entanglement entropy meets holographic entropy inequalities

Joydeep Naskar, Sai Satyam Samal

Topological entanglement entropy (TEE) is an efficient way to detect topological order in the ground state of gapped Hamiltonians. The seminal work of Kitaev and Preskill~\cite{preskill-kitaev-tee} and simultaneously by Levin and Wen~\cite{levin-wen-tee} proposed information quantities that can probe the TEE. In the present work, we explain why the subtraction schemes in the proposed information quantities~\cite{levin-wen-tee,preskill-kitaev-tee} work for the computation of TEE and generalize them for arbitrary number of subregions by explicitly noting the necessary conditions for an information quantity to capture TEE. Our conditions differentiate the probes defined by Kitaev-Preskill and Levin-Wen into separate classes. While there are infinitely many possible probes of TEE, we focus particularly on the cyclic quantities $Q_{2n+1}$ and multi-information $I_n$. We also show that the holographic entropy inequalities are satisfied by the quantum entanglement entropy of the non-degenerate ground state of a topologically ordered two-dimensional medium with a mass gap.

arXiv:2412.05484•Physical review. D/Physical review. D.•Jun 25, 2026•5 citations

Quantum Information and Entropy

Subhash C. Kak

arXiv:quant-ph/0605096•International Journal of Theoretical Physics•Feb 22, 2007•134 citations
We consider two fundamental tasks in quantum information theory, data compression with quantum side information, as well as randomness extraction against quantum side information. We characterize these tasks for general sources using so-called one-shot entropies. These characterizations-in contrast to earlier results-enable us to derive tight second-order asymptotics for these tasks in the i.i.d. limit. More generally, our derivation establishes a hierarchy of information quantities that can be used to investigate information theoretic tasks in the quantum domain: The one-shot entropies most accurately describe an operational quantity, yet they tend to be difficult to calculate for large systems. We show that they asymptotically agree (up to logarithmic terms) with entropies related to the quantum and classical information spectrum, which are easier to calculate in the i.i.d. limit. Our technique also naturally yields bounds on operational quantities for finite block lengths.
The R{é}nyi entropy is one of the important information measures that generalizes Shannon's entropy. The quantum R{é}nyi entropy has a fundamental role in quantum information theory, therefore, bounding this quantity is of vital importance. Another important quantity is R{é}nyi relative entropy on which R{é}nyi generalization of the conditional entropy, and mutual information are defined based. Thus, finding lower bound for R{é}nyi relative entropy is our goal in this paper. We use matrix inequalities to prove new bounds on the entropy of type βββ, R{é}nyi entropy.
Topological entanglement entropy (TEE) is an efficient way to detect topological order in the ground state of gapped Hamiltonians. The seminal work of Kitaev and Preskill~\cite{preskill-kitaev-tee} and simultaneously by Levin and Wen~\cite{levin-wen-tee} proposed information quantities that can probe the TEE. In the present work, we explain why the subtraction schemes in the proposed information quantities~\cite{levin-wen-tee,preskill-kitaev-tee} work for the computation of TEE and generalize them for arbitrary number of subregions by explicitly noting the necessary conditions for an information quantity to capture TEE. Our conditions differentiate the probes defined by Kitaev-Preskill and Levin-Wen into separate classes. While there are infinitely many possible probes of TEE, we focus particularly on the cyclic quantities Q2n+1Q_{2n+1}Q2n+1​ and multi-information InI_nIn​. We also show that the holographic entropy inequalities are satisfied by the quantum entanglement entropy of the non-degenerate ground state of a topologically ordered two-dimensional medium with a mass gap.