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:1903.09797 · Entropy

Canonical Divergence for Measuring Classical and Quantum Complexity

Domenico Felice, Stefano Mancini, Nihat Ay

Published Apr 24, 2019• 10 citations
arXivHTMLPDF

Abstract

A new canonical divergence is put forward for generalizing an information-geometric measure of complexity for both classical and quantum systems. On the simplex of probability measures, it is proved that the new divergence coincides with the Kullback-Leibler divergence, which is used to quantify how much a probability measure deviates from the non-interacting states that are modeled by exponential families of probabilities. On the space of positive density operators, we prove that the same divergence reduces to the quantum relative entropy, which quantifies many-party correlations of a quantum state from a Gibbs family.

DOI
10.3390/e21040435

Related papers

Asymptotic Attainment for Quantum Relative Entropy

Masahito Hayashi

In this paper it was proved that the quantum relative entropy D(k) can be asymptotically attained by Kullback Leibler divergences of probabilities given by a certain sequence of measurements. The sequence of measurements depends on , but is independent of the choice of . In classical statistical theory the relative entropy D(pkq) is an information quantity which means the statistical eÆciency in order to distinguish a probability measure p of a measurable space from another probability measure q of the same measurable space. The states correspond to measures on measurable space. When p; q are discrete probabilities, the relative entropy (called also information divergence) introduced by Kullback and Leibler is dened by [1]: D(pkq) := X i p i log p i q i : In general, when p; q are measures on measurable space the relative entropy is dened by: D(pkq) := Z log dq dp (!)p( d!); where dq dp (!) is Radon-Nikodym derivative of q with respect to p. In this paper, we co...

•Apr 24, 1997•2 citations

On the Relation between Kullback Divergence and Fisher Information: From Classical Systems to Quantum Systems

Hiroshi Nagaoka

Kullback divergence D(p ∥ q) for a couple of probability distributions {p, q} and Fisher information J(θ) for a parametric family of probability distributions {p θ } are very important notions in the classical theory of statistical inference. Quantum analogues of these notions are known as Umegaki's relative entropy D(ρ ‖ σ) for a couple of density operators {ρ, σ} and the quantum Fisher information J(θ) based on the pymmetric logarithmic derivatives for a parametric family of density operators {ρ Θ }. In the classical case, the relation holds, which connects the asymptotic theory of hypothesis testing and that of parameter estimation. In the quantum case, the relation defines , which is not equal to J(θ) in general and is another quantum analogue of Fisher information. We show the inequality and elucidate its meaning in connection with the statistical inference for quantum states.

WORLD SCIENTIFIC eBooks•Feb 1, 2005•8 citations

Nonadditive generalization of the quantum Kullback-Leibler divergence for measuring the degree of purification

Sumiyoshi Abe

The Kullback-Leibler divergence offers an information-theoretic basis for measuring the difference between two given distributions. Its quantum analog, however, fails to play a corresponding role for comparing two density matrices, if the reference states are pure states. Here it is shown that nonadditive quantum information theory inspired by nonextensive statistical mechanics is free from such a difficulty and the associated quantity, termed the quantum q-divergence, can in fact be a good information-theoretic measure of the degree of state purification. The correspondence relation between the ordinary divergence and the q-divergence is violated for the pure reference states, in general.

arXiv:quant-ph/0301136•Physical Review A•Sep 10, 2003•68 citations

Jensen-Shannon divergence as a measure of distinguishability between mixed quantum states

A. P. Majtey, Pedro W. Lamberti, Domingo P. Prato

We discuss an alternative to relative entropy as a measure of distance between mixed quantum states. The proposed quantity is an extension to the realm of quantum theory of the Jensen-Shannon divergence (JSD) between probability distributions. The JSD has several interesting properties. It arises in information theory and, unlike the Kullback-Leibler divergence, it is symmetric, always well-defined, and bounded. We show that the quantum JSD shares with the relative entropy most of the physically relevant properties, in particular those required for a ``good'' quantum distinguishability measure. We relate it to other known quantum distances and we suggest possible applications in the field of the quantum information theory.

arXiv:quant-ph/0508138•Physical Review A•Nov 11, 2005•230 citations

Properties of classical and quantum Jensen-Shannon divergence

Jop Briët, Peter Harremoës

Jensen-Shannon divergence (JD) is a symmetrized and smoothed version of the most important divergence measure of information theory, Kullback divergence. As opposed to Kullback divergence it determines in a very direct way a metric; indeed, it is the square of a metric. We consider a family of divergence measures (${\text{JD}}_{\ensuremath{\alpha}}$ for $\ensuremath{\alpha}>0$), the Jensen divergences of order $\ensuremath{\alpha}$, which generalize JD as ${\text{JD}}_{1}=\text{JD}$. Using a result of Schoenberg, we prove that ${\text{JD}}_{\ensuremath{\alpha}}$ is the square of a metric for $\ensuremath{\alpha}∊(0,2]$, and that the resulting metric space of probability distributions can be isometrically embedded in a real Hilbert space. Quantum Jensen-Shannon divergence (QJD) is a symmetrized and smoothed version of quantum relative entropy and can be extended to a family of quantum Jensen divergences of order $\ensuremath{\alpha}$ $({\text{QJD}}_{\ensuremath{\alpha}})$. We strengthen results by Lamberti and co-workers by proving that for qubits and pure states, ${\text{QJD}}_{\ensuremath{\alpha}}^{1/2}$ is a metric space which can be isometrically embedded in a real Hilbert space when $\ensuremath{\alpha}∊(0,2]$. In analogy with Burbea and Rao's generalization of JD, we also define general QJD by associating a Jensen-type quantity to any weighted family of states. Appropriate interpretations of quantities introduced are discussed and bounds are derived in terms of the total variation and trace distance.

arXiv:0806.4472•Physical Review A•May 12, 2009•219 citations

COMPLEXITY MEASURE: A QUANTUM INFORMATION APPROACH

Yuri Campbell, José Roberto Castilho Piqueira

In the past decades, all of the efforts at quantifying systems complexity with a general tool has usually relied on using Shannon's classical information framework to address the disorder of the system through the Boltzmann–Gibbs–Shannon entropy, or one of its extensions. However, in recent years, there were some attempts to tackle the quantification of algorithmic complexities in quantum systems based on the Kolmogorov algorithmic complexity, obtaining some discrepant results against the classical approach. Therefore, an approach to the complexity measure is proposed here, using the quantum information formalism, taking advantage of the generality of the classical-based complexities, and being capable of expressing these systems' complexity on other framework than its algorithmic counterparts. To do so, the Shiner–Davison–Landsberg (SDL) complexity framework is considered jointly with linear entropy for the density operators representing the analyzed systems formalism along with the tangle for the entanglement measure. The proposed measure is then applied in a family of maximally entangled mixed state.

International Journal of Quantum Information•Jun 1, 2012•7 citations
A new canonical divergence is put forward for generalizing an information-geometric measure of complexity for both classical and quantum systems. On the simplex of probability measures, it is proved that the new divergence coincides with the Kullback-Leibler divergence, which is used to quantify how much a probability measure deviates from the non-interacting states that are modeled by exponential families of probabilities. On the space of positive density operators, we prove that the same divergence reduces to the quantum relative entropy, which quantifies many-party correlations of a quantum state from a Gibbs family.
In this paper it was proved that the quantum relative entropy D(k) can be asymptotically attained by Kullback Leibler divergences of probabilities given by a certain sequence of measurements. The sequence of measurements depends on , but is independent of the choice of . In classical statistical theory the relative entropy D(pkq) is an information quantity which means the statistical eÆciency in order to distinguish a probability measure p of a measurable space from another probability measure q of the same measurable space. The states correspond to measures on measurable space. When p; q are discrete probabilities, the relative entropy (called also information divergence) introduced by Kullback and Leibler is dened by [1]: D(pkq) := X i p i log p i q i : In general, when p; q are measures on measurable space the relative entropy is dened by: D(pkq) := Z log dq dp (!)p( d!); where dq dp (!) is Radon-Nikodym derivative of q with respect to p. In this paper, we co...
Kullback divergence D(p ∥ q) for a couple of probability distributions {p, q} and Fisher information J(θ) for a parametric family of probability distributions {p θ } are very important notions in the classical theory of statistical inference. Quantum analogues of these notions are known as Umegaki's relative entropy D(ρ ‖ σ) for a couple of density operators {ρ, σ} and the quantum Fisher information J(θ) based on the pymmetric logarithmic derivatives for a parametric family of density operators {ρ Θ }. In the classical case, the relation holds, which connects the asymptotic theory of hypothesis testing and that of parameter estimation. In the quantum case, the relation defines , which is not equal to J(θ) in general and is another quantum analogue of Fisher information. We show the inequality and elucidate its meaning in connection with the statistical inference for quantum states.
The Kullback-Leibler divergence offers an information-theoretic basis for measuring the difference between two given distributions. Its quantum analog, however, fails to play a corresponding role for comparing two density matrices, if the reference states are pure states. Here it is shown that nonadditive quantum information theory inspired by nonextensive statistical mechanics is free from such a difficulty and the associated quantity, termed the quantum q-divergence, can in fact be a good information-theoretic measure of the degree of state purification. The correspondence relation between the ordinary divergence and the q-divergence is violated for the pure reference states, in general.
We discuss an alternative to relative entropy as a measure of distance between mixed quantum states. The proposed quantity is an extension to the realm of quantum theory of the Jensen-Shannon divergence (JSD) between probability distributions. The JSD has several interesting properties. It arises in information theory and, unlike the Kullback-Leibler divergence, it is symmetric, always well-defined, and bounded. We show that the quantum JSD shares with the relative entropy most of the physically relevant properties, in particular those required for a ``good'' quantum distinguishability measure. We relate it to other known quantum distances and we suggest possible applications in the field of the quantum information theory.
Jensen-Shannon divergence (JD) is a symmetrized and smoothed version of the most important divergence measure of information theory, Kullback divergence. As opposed to Kullback divergence it determines in a very direct way a metric; indeed, it is the square of a metric. We consider a family of divergence measures (${\text{JD}}_{\ensuremath{\alpha}}$ for $\ensuremath{\alpha}>0$), the Jensen divergences of order $\ensuremath{\alpha}$, which generalize JD as JD1=JD{\text{JD}}_{1}=\text{JD}JD1​=JD. Using a result of Schoenberg, we prove that ${\text{JD}}_{\ensuremath{\alpha}}$ is the square of a metric for $\ensuremath{\alpha}∊(0,2]$, and that the resulting metric space of probability distributions can be isometrically embedded in a real Hilbert space. Quantum Jensen-Shannon divergence (QJD) is a symmetrized and smoothed version of quantum relative entropy and can be extended to a family of quantum Jensen divergences of order $\ensuremath{\alpha}$ $({\text{QJD}}_{\ensuremath{\alpha}})$. We strengthen results by Lamberti and co-workers by proving that for qubits and pure states, ${\text{QJD}}_{\ensuremath{\alpha}}^{1/2}$ is a metric space which can be isometrically embedded in a real Hilbert space when $\ensuremath{\alpha}∊(0,2]$. In analogy with Burbea and Rao's generalization of JD, we also define general QJD by associating a Jensen-type quantity to any weighted family of states. Appropriate interpretations of quantities introduced are discussed and bounds are derived in terms of the total variation and trace distance.
In the past decades, all of the efforts at quantifying systems complexity with a general tool has usually relied on using Shannon's classical information framework to address the disorder of the system through the Boltzmann–Gibbs–Shannon entropy, or one of its extensions. However, in recent years, there were some attempts to tackle the quantification of algorithmic complexities in quantum systems based on the Kolmogorov algorithmic complexity, obtaining some discrepant results against the classical approach. Therefore, an approach to the complexity measure is proposed here, using the quantum information formalism, taking advantage of the generality of the classical-based complexities, and being capable of expressing these systems' complexity on other framework than its algorithmic counterparts. To do so, the Shiner–Davison–Landsberg (SDL) complexity framework is considered jointly with linear entropy for the density operators representing the analyzed systems formalism along with the tangle for the entanglement measure. The proposed measure is then applied in a family of maximally entangled mixed state.