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

arXiv:quant-ph/0004045

Relative entropy in quantum information theory

Benjamin W. Schumacher, Michael D. Westmoreland

Published Apr 10, 2000• 6 citations
arXivHTMLPDF

Abstract

We review the properties of the quantum relative entropy function and discuss its application to problems of classical and quantum information transfer and to quantum data compression. We then outline further uses of relative entropy to quantify quantum entanglement and analyze its manipulation.
DOI
10.48550/arxiv.quant-ph/0004045

Related papers

The role of relative entropy in quantum information theory

Vlatko Vedral

Quantum mechanics and information theory are among the most important scientific discoveries of the last century. Although these two areas initially developed separately, it has emerged that they are in fact intimately related. In this review the author shows how quantum information theory extends traditional information theory by exploring the limits imposed by quantum, rather than classical, mechanics on information storage and transmission. The derivation of many key results differentiates this review from the usual presentation in that they are shown to follow logically from one crucial property of relative entropy. Within the review, optimal bounds on the enhanced speed that quantum computers can achieve over their classical counterparts are outlined using information-theoretic arguments. In addition, important implications of quantum information theory for thermodynamics and quantum measurement are intermittently discussed. A number of simple examples and derivations, including quantum superdense coding, quantum teleportation, and Deutsch's and Grover's algorithms, are also included.

arXiv:quant-ph/0102094•Reviews of Modern Physics•Mar 8, 2002•1,162 citations

Reexamination of quantum data compression and relative entropy

Alexei Kaltchenko

Schumacher and Westmoreland [Phys. Rev. A 64, 42304 (2001)] have established a quantum analog of a well-known classical information theory result on a role of relative entropy as a measure of nonoptimality in (classical) data compression. In this paper, we provide an alternative simple and constructive proof of this result by constructing quantum compression codes (schemes) from classical data compression codes. Moreover, as the quantum data compression or coding task can be effectively reduced to a (quasi)classical one, we show that relevant results from classical information theory and data compression become applicable and therefore can be extended to the quantum domain.

arXiv:0805.0328•Physical Review A•Aug 7, 2008•1 citation

Quantum Information Entropy: A Generalized Definition

Jincheng Zhang

This paper introduces a generalized definition of quantum information entropy, aiming to provide a more comprehensive framework for quantifying information in complex quantum systems. The core of this work lies in extending the conventional concept of entropy, traditionally applied to classical information, to the realm of quantum mechanics. We explore various types of quantum entropy, including von Neumann entropy, relative entropy, and a newly proposed generalized entropy, denoted as *Eg*. The definition of *Eg* is based on a novel approach that considers the entanglement structure and correlations within quantum states. We establish relationships between these different entropy measures, demonstrating their interconnectedness within the broader context of quantum information theory. The paper further outlines a mathematical formalism for calculating *Eg*, providing a tool for analyzing and characterizing quantum information. Our generalized entropy provides a more flexible and potentially more accurate measure of quantum information, particularly in scenarios involving complex quantum correlations and multi-partite quantum systems. ---

•Aug 31, 2026•0 citations

Quantum Information Theory and Applications to Quantum Cryptography

Nikolaos P. Papadakos

Classical and quantum information theory are simply explained. To be more specific it is clarified why Shannon entropy is used as measure of classical information and after a brief review of quantum mechanics it is possible to demonstrate why the density matrix is the main tool of quantum information theory. Then von Neumann entropy is introduced and with its help a great difference between classical and quantum information theory is presented: quantum entanglement. Moreover an information theoretic interpretation of quantum measurement is discussed. Data compression, error correction and noisy channel transmission are simply demonstrated for both classical and quantum cases. Finally using the above theory quantum cryptography is reviewed and the possibility of a commercial device realizing it is explored.

arXiv:quant-ph/0201057•Jan 14, 2002•1 citation

Estimation of quantum entropies

Alexei Kaltchenko

Motivated by the importance of entropy functions in quantum data compression, entanglement theory, and various quantum information-processing tasks, this study demonstrates how classical algorithms for entropy estimation can effectively contribute to the construction of quantum algorithms for universal quantum entropy estimation. Given two quantum i.i.d. sources with completely unknown density matrices, algorithms are developed for estimating quantum cross entropy and quantum relative entropy. These estimation techniques represent a quantum generalization of the classical algorithms by Lempel, Ziv, and Merhav.

i-manager’s Journal on Mathematics•Jan 1, 2024•0 citations

QUANTUM ENTROPIES AND ENTANGLEMENT

Josep Amengual i Batle, M. Casas, Angel Ricardo Plastino +1 more

The nature of quantum entropies, and its use in Quantum Information Theory in the form of (i) total entropy, (ii) relative entropy and (iii) conditional entropy is revisited. In this ordering, we first show the correlations existing between the total q-entropy and entanglement, quantified in the form of entanglement of formation. Then, we revisit the use of the quantum relative entropy as a measure of entanglement, and we finally discuss some features of the quantum conditional q-entropies, which are used in turn as a separability criterion.

International Journal of Quantum Information•Dec 17, 2004•5 citations
Quantum mechanics and information theory are among the most important scientific discoveries of the last century. Although these two areas initially developed separately, it has emerged that they are in fact intimately related. In this review the author shows how quantum information theory extends traditional information theory by exploring the limits imposed by quantum, rather than classical, mechanics on information storage and transmission. The derivation of many key results differentiates this review from the usual presentation in that they are shown to follow logically from one crucial property of relative entropy. Within the review, optimal bounds on the enhanced speed that quantum computers can achieve over their classical counterparts are outlined using information-theoretic arguments. In addition, important implications of quantum information theory for thermodynamics and quantum measurement are intermittently discussed. A number of simple examples and derivations, including quantum superdense coding, quantum teleportation, and Deutsch's and Grover's algorithms, are also included.
Schumacher and Westmoreland [Phys. Rev. A 64, 42304 (2001)] have established a quantum analog of a well-known classical information theory result on a role of relative entropy as a measure of nonoptimality in (classical) data compression. In this paper, we provide an alternative simple and constructive proof of this result by constructing quantum compression codes (schemes) from classical data compression codes. Moreover, as the quantum data compression or coding task can be effectively reduced to a (quasi)classical one, we show that relevant results from classical information theory and data compression become applicable and therefore can be extended to the quantum domain.
This paper introduces a generalized definition of quantum information entropy, aiming to provide a more comprehensive framework for quantifying information in complex quantum systems. The core of this work lies in extending the conventional concept of entropy, traditionally applied to classical information, to the realm of quantum mechanics. We explore various types of quantum entropy, including von Neumann entropy, relative entropy, and a newly proposed generalized entropy, denoted as *Eg*. The definition of *Eg* is based on a novel approach that considers the entanglement structure and correlations within quantum states. We establish relationships between these different entropy measures, demonstrating their interconnectedness within the broader context of quantum information theory. The paper further outlines a mathematical formalism for calculating *Eg*, providing a tool for analyzing and characterizing quantum information. Our generalized entropy provides a more flexible and potentially more accurate measure of quantum information, particularly in scenarios involving complex quantum correlations and multi-partite quantum systems. ---
Classical and quantum information theory are simply explained. To be more specific it is clarified why Shannon entropy is used as measure of classical information and after a brief review of quantum mechanics it is possible to demonstrate why the density matrix is the main tool of quantum information theory. Then von Neumann entropy is introduced and with its help a great difference between classical and quantum information theory is presented: quantum entanglement. Moreover an information theoretic interpretation of quantum measurement is discussed. Data compression, error correction and noisy channel transmission are simply demonstrated for both classical and quantum cases. Finally using the above theory quantum cryptography is reviewed and the possibility of a commercial device realizing it is explored.
Motivated by the importance of entropy functions in quantum data compression, entanglement theory, and various quantum information-processing tasks, this study demonstrates how classical algorithms for entropy estimation can effectively contribute to the construction of quantum algorithms for universal quantum entropy estimation. Given two quantum i.i.d. sources with completely unknown density matrices, algorithms are developed for estimating quantum cross entropy and quantum relative entropy. These estimation techniques represent a quantum generalization of the classical algorithms by Lempel, Ziv, and Merhav.
The nature of quantum entropies, and its use in Quantum Information Theory in the form of (i) total entropy, (ii) relative entropy and (iii) conditional entropy is revisited. In this ordering, we first show the correlations existing between the total q-entropy and entanglement, quantified in the form of entanglement of formation. Then, we revisit the use of the quantum relative entropy as a measure of entanglement, and we finally discuss some features of the quantum conditional q-entropies, which are used in turn as a separability criterion.