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:math-ph/0109023

The von Neumann entropy and information rate for ideal quantum Gibbs ensembles

Oliver Johnson, Yuri Suhov

Published Sep 21, 2001• 0 citations
arXivHTMLPDF

Abstract

A model of a quantum information source is proposed, based on the Gibbs ensemble of ideal (free) particles (bosons or fermions). We identify the (thermodynamic) von Neumann entropy as the information rate and establish the classical Lempel--Ziv universal coding algorithm in Grassberger's form for such a source. This generalises the Schumacher theorem to the case of non-IID qubits.

DOI
10.48550/arxiv.math-ph/0109023

Related papers

The von Neumann entropy and information rate for integrable quantum Gibbs ensembles 2

Oliver Johnson, Yuri Suhov

In this and the subsequent paper under the same title a number of exactly sovlable models of quantum statistical mechanics are studied in a context of quantum information theory. The basic model in this paper is a lattice system of ideal (free) particles (bosons or fermions), in the infinite-volume lmit of the grand canonical Gibbs ensemble. We interpet the (limiting) von Neumann entropy rate h as the information rate and use the classical Lempel-Ziv universal coding algorithm to assess the value of h from a single eigenvector W of the Gibbs ensemble density matrix p. We also show how to apply this scheme to the Calogero model.

•Jan 1, 2002•6 citations

Quantum Fisher Information for Entropy of Gibbs States

Francis J. Headley

We derive the quantum Fisher information for entropy estimation in a Gibbs state and show that it equals the inverse of the heat capacity, which is dual to the temperature Fisher information given by the heat capacity divided by the square of the temperature. Their product is independent of the Hamiltonian and depends only on the temperature, leading to a metrological uncertainty relation between the variances of entropy and temperature estimators in which all system-specific quantities cancel. This relation arises from the dually-flat structure of the Gibbs exponential family expressed in thermodynamic coordinates, and holds for all standard thermodynamically conjugate pairs. We identify energy measurement as the optimal protocol for entropy estimation, analyse critical-point scaling where the entropy Fisher information vanishes, and connect it to the Ruppeiner metric in entropy coordinates. We lastly examine the distinguished role of the von Neumann entropy within the Rényi family. Generalisations to the grand canonical and generalised Gibbs ensembles are given.

quant-pharXiv:2603.16456•Mar 18, 2026•0 citations

The von Neumann entropy and information rate for integrable quantum Gibbs ensembles, 2

Oliver Johnson, Yuri Suhov

This paper considers the problem of data compression for dependent quantum systems. It is the second in a series under the same title. As in the previous paper, we are interested in Lempel--Ziv encoding for quantum Gibbs ensembles. Here, we consider the canonical ideal lattice Bose- and Fermi-ensembles. We prove that as in the case of the grand canonical ensemble, the (limiting) von Neumann entropy rate $h$ can be assessed, via the classical Lempel--Ziv universal coding algorithm, from a single eigenvector of the density matrix.

arXiv:math-ph/0305016•May 8, 2003•4 citations

Universal quantum information compression and degrees of prior knowledge

Richard Jozsa, Stuart Presnell

We describe a universal information–compression scheme that compresses any pure quantum independent identically distributed (i.i.d.) source asymptotically to its von Neumann entropy, with no prior knowledge of the structure of the source. We introduce a diagonalization procedure that enables any classical compression algorithm to be used in a quantum context. Our scheme is then based on the corresponding quantum translation of the classical Lempel–Ziv algorithm. Our methods lead to a conceptually simple way of estimating the entropy of a source in terms of the measurement of an associated length parameter while maintaining high fidelity for long blocks. As a byproduct we also estimate the eigenbasis of the source. Since our scheme is based on the Lempel–Ziv method, it can potentially be applied also to non–i.i.d. sources that satisfy some further regularity conditions.

arXiv:quant-ph/0210196•Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences•Nov 25, 2003•30 citations

Aspects of Quantum Information Compression for Pure States

Richard Jozsa

Consider a source of pure quantum states with density matrix ρ and von Neumann entropy S . It is known that the quantum information of the source may be faithfully compressed to 5 qubits/signal (asymptotically for long sequences) and that this limit is optimal if we demand high fidelity for long strings of signals. The usual method for achieving this compression, based on the typical subspace of the source, requires knowledge of the density matrix. We describe a new “universal” compression scheme which does not even require knowledge of ρ. More precisely, suppose that the source is known to have von Neumann entropy less than some given bound S 0 but is otherwise completely unspecified. Our method will faithfully compress the quantum information of any such source to S 0 qubits/signal. It is known that S is always less than or equal to the Shannon entropy H of the prior distribution of the source. According to Shannon’s theorem, H provides the limit for compression of classical signals, so one may ask the question: what is the physical origin of the extra compression available in the quantum case compared to the classical case (where the prior probabilities are the same)? One may suggest that this effect is a consequence of possible non-orthogonality of signal states. However we demonstrate that it is possible to make each pair of signal states of a source more parallel (keeping the prior probabilities the same) while increasing the von Neumann entropy. This casts doubt on the conventional wisdom that overlap of quantum states is a measure of their (non-)distinguishability. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Kluwer Academic Publishers eBooks•Dec 19, 2005•1 citation

Schumacher Compression

Mark M. Wilde

One of the fundamental tasks in classical information theory is the compression of information. Given access to many uses of a noiseless classical channel, what is the best that a sender and receiver can make of this resource for compressed data transmission? Shannon's compression theorem demonstrates that the Shannon entropy is the fundamental limit for the compression rate in the IID setting (recall the development in Section 13.4). That is, if one compresses at a rate above the Shannon entropy, then it is possible to recover the compressed data perfectly in the asymptotic limit, and otherwise, it is not possible to do so. This theorem establishes the prominent role of the entropy in Shannon's theory of information. In the quantum world, it very well could be that one day a sender and a receiver would have many uses of a noiseless quantum channel available, and the sender could use this resource to transmit compressed quantum information. But what exactly does this mean in the quantum setting? A simple model of a quantum information source is an ensemble of quantum states { pX(x) , ∣ψ x ⟩}, i.e., the source outputs the state ∣ψ x ⟩ with probability pX(x) , and the states {∣ψ x ⟩} do not necessarily have to form an orthonormal basis. Let us suppose for the moment that the classical data x is available as well, even though this might not necessarily be the case in practice. A naive strategy for compressing this quantum information source would be to ignore the quantum states coming out, handle the classical data instead, and exploit Shannon's compression protocol from Section 13.4.

Cambridge University Press eBooks•Apr 18, 2013•1 citation
A model of a quantum information source is proposed, based on the Gibbs ensemble of ideal (free) particles (bosons or fermions). We identify the (thermodynamic) von Neumann entropy as the information rate and establish the classical Lempel--Ziv universal coding algorithm in Grassberger's form for such a source. This generalises the Schumacher theorem to the case of non-IID qubits.
In this and the subsequent paper under the same title a number of exactly sovlable models of quantum statistical mechanics are studied in a context of quantum information theory. The basic model in this paper is a lattice system of ideal (free) particles (bosons or fermions), in the infinite-volume lmit of the grand canonical Gibbs ensemble. We interpet the (limiting) von Neumann entropy rate h as the information rate and use the classical Lempel-Ziv universal coding algorithm to assess the value of h from a single eigenvector W of the Gibbs ensemble density matrix p. We also show how to apply this scheme to the Calogero model.
We derive the quantum Fisher information for entropy estimation in a Gibbs state and show that it equals the inverse of the heat capacity, which is dual to the temperature Fisher information given by the heat capacity divided by the square of the temperature. Their product is independent of the Hamiltonian and depends only on the temperature, leading to a metrological uncertainty relation between the variances of entropy and temperature estimators in which all system-specific quantities cancel. This relation arises from the dually-flat structure of the Gibbs exponential family expressed in thermodynamic coordinates, and holds for all standard thermodynamically conjugate pairs. We identify energy measurement as the optimal protocol for entropy estimation, analyse critical-point scaling where the entropy Fisher information vanishes, and connect it to the Ruppeiner metric in entropy coordinates. We lastly examine the distinguished role of the von Neumann entropy within the Rényi family. Generalisations to the grand canonical and generalised Gibbs ensembles are given.
This paper considers the problem of data compression for dependent quantum systems. It is the second in a series under the same title. As in the previous paper, we are interested in Lempel--Ziv encoding for quantum Gibbs ensembles. Here, we consider the canonical ideal lattice Bose- and Fermi-ensembles. We prove that as in the case of the grand canonical ensemble, the (limiting) von Neumann entropy rate hhh can be assessed, via the classical Lempel--Ziv universal coding algorithm, from a single eigenvector of the density matrix.
We describe a universal information–compression scheme that compresses any pure quantum independent identically distributed (i.i.d.) source asymptotically to its von Neumann entropy, with no prior knowledge of the structure of the source. We introduce a diagonalization procedure that enables any classical compression algorithm to be used in a quantum context. Our scheme is then based on the corresponding quantum translation of the classical Lempel–Ziv algorithm. Our methods lead to a conceptually simple way of estimating the entropy of a source in terms of the measurement of an associated length parameter while maintaining high fidelity for long blocks. As a byproduct we also estimate the eigenbasis of the source. Since our scheme is based on the Lempel–Ziv method, it can potentially be applied also to non–i.i.d. sources that satisfy some further regularity conditions.
Consider a source of pure quantum states with density matrix ρ and von Neumann entropy S . It is known that the quantum information of the source may be faithfully compressed to 5 qubits/signal (asymptotically for long sequences) and that this limit is optimal if we demand high fidelity for long strings of signals. The usual method for achieving this compression, based on the typical subspace of the source, requires knowledge of the density matrix. We describe a new “universal” compression scheme which does not even require knowledge of ρ. More precisely, suppose that the source is known to have von Neumann entropy less than some given bound S 0 but is otherwise completely unspecified. Our method will faithfully compress the quantum information of any such source to S 0 qubits/signal. It is known that S is always less than or equal to the Shannon entropy H of the prior distribution of the source. According to Shannon’s theorem, H provides the limit for compression of classical signals, so one may ask the question: what is the physical origin of the extra compression available in the quantum case compared to the classical case (where the prior probabilities are the same)? One may suggest that this effect is a consequence of possible non-orthogonality of signal states. However we demonstrate that it is possible to make each pair of signal states of a source more parallel (keeping the prior probabilities the same) while increasing the von Neumann entropy. This casts doubt on the conventional wisdom that overlap of quantum states is a measure of their (non-)distinguishability. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
One of the fundamental tasks in classical information theory is the compression of information. Given access to many uses of a noiseless classical channel, what is the best that a sender and receiver can make of this resource for compressed data transmission? Shannon's compression theorem demonstrates that the Shannon entropy is the fundamental limit for the compression rate in the IID setting (recall the development in Section 13.4). That is, if one compresses at a rate above the Shannon entropy, then it is possible to recover the compressed data perfectly in the asymptotic limit, and otherwise, it is not possible to do so. This theorem establishes the prominent role of the entropy in Shannon's theory of information. In the quantum world, it very well could be that one day a sender and a receiver would have many uses of a noiseless quantum channel available, and the sender could use this resource to transmit compressed quantum information. But what exactly does this mean in the quantum setting? A simple model of a quantum information source is an ensemble of quantum states { pX(x) , ∣ψ x ⟩}, i.e., the source outputs the state ∣ψ x ⟩ with probability pX(x) , and the states {∣ψ x ⟩} do not necessarily have to form an orthonormal basis. Let us suppose for the moment that the classical data x is available as well, even though this might not necessarily be the case in practice. A naive strategy for compressing this quantum information source would be to ignore the quantum states coming out, handle the classical data instead, and exploit Shannon's compression protocol from Section 13.4.