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:1208.2046

Contextual Entropy and Reconstruction of Quantum States

Carmen Constantin, Andreas Doering

Published Aug 9, 2012• 3 citations
arXivHTMLPDF

Abstract

We introduce a new notion of entropy for quantum states, called contextual entropy, and show how it unifies Shannon and von Neumann entropy. The main result is that from the knowledge of the contextual entropy of a quantum state of a finite-dimensional system, one can reconstruct the quantum state, i.e., the density matrix, if the Hilbert space is of dimension 3 or greater. We present an explicit algorithm for this state reconstruction and relate our result to Gleason's theorem.

DOI
10.48550/arxiv.1208.2046

Related papers

A Topos Theoretic Notion of Entropy

Carmen-Maria Constantin, Andreas Doering

In the topos approach to quantum theory, the spectral presheaf plays the role of the state space of a quantum system. We show how a notion of entropy can be defined within the topos formalism using the equivalence between states and measures on the spectral presheaf. We show how this construction unifies Shannon and von Neumann entropy as well as classical and quantum Renyi entropies. The main result is that from the knowledge of the contextual entropy of a quantum state of a finite-dimensional system, one can (mathematically) reconstruct the quantum state, i.e., the density matrix, if the Hilbert space is of dimension $3$ or greater. We present an explicit algorithm for this state reconstruction and relate our result to Gleason's theorem.

arXiv:2006.03139•Jun 4, 2020•3 citations

Information content for quantum states

Dorje C. Brody, Lane P. Hughston

A method for representing probabilistic aspects of quantum systems by means of a density function on the space of pure quantum states is introduced. In particular, a maximum entropy argument allows us to obtain a natural density function that only reflects the information provided by the density matrix. This result is applied to derive the Shannon entropy of a quantum state. The information theoretic quantum entropy thereby obtained is shown to have the desired concavity property, and to differ from the conventional von Neumann entropy. This is illustrated explicitly for a two-state system.

arXiv:quant-ph/9906085•Journal of Mathematical Physics•May 1, 2000•19 citations

Entropy of Quantum States

Paolo Facchi A, Giovanni Gramegna, Arturo Konderak

Given the algebra of observables of a quantum system subject to selection rules, a state can be represented by different density matrices. As a result, different von Neumann entropies can be associated with the same state. Motivated by a minimality property of the von Neumann entropy of a density matrix with respect to its possible decompositions into pure states, we give a purely algebraic definition of entropy for states of an algebra of observables, thus solving the above ambiguity. The entropy so-defined satisfies all the desirable thermodynamic properties and reduces to the von Neumann entropy in the quantum mechanical case. Moreover, it can be shown to be equal to the von Neumann entropy of the unique representative density matrix belonging to the operator algebra of a multiplicity-free Hilbert-space representation.

arXiv:2104.12611•Entropy•May 21, 2021•12 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

Entropy in Quantum Probability I

Dėnes Petz

The notion of entropy was introduced by Clausius in order to discuss the thermal behavior of physical systems. After the work of Clausius, Boltzmann, Gibbs and others, the beginning of the exact treatment of entropy was due to von Neumann and Shannon. Their starting point was very di erent, von Neumann was motivated by quantum mechanics and Shannon founded communication theory. The entropy of a state describing a physical system is a quantity expressing the uncertainty or randomness of the system. Shannon regarded this uncertainty attached to a physical system as the amount of information carried by the system, so that the entropy of a state can be read as the information carried by the state. His idea comes from the following consideration: If a physical system has a large uncertainty and one receives information on the system by some procedure, then the so obtained information is more valuable than that received from a system having less uncertainty. It is understood in probability theory that the notion of (Shannon or measure theoretic) entropy has successful applications in a variety of subjects because it determines the asymptotic behavior of certain probabilities in the course of independent trials. First we will discuss this phenomena for nite quantum systems. By a nite quantum system we mean an algebra of matrices which is stable under taking adjoint. (In other words, a nite quantum system is a nite dimensional C*algebra.) If A is such an algebra then there is a linear functional Tr which takes the value 1 at each minimal projection. It is "tracial " in the sense that Tr ab = Tr ba (a; b 2 A) Every functional! on A is determined by a density operator D! 2 A in the form!(a) = Tr D! a (a 2 A): The entropy S(!) of a functional! is de ned by means of its density operator as S(!) = Tr (D!): This notion was introduced by von Neumann in 1927 and we term it von Neumann's entropy or shortly entropy (cf. [1]). In fact, von Neumann de ned the entropy such

QP-PQ, quantum probability and white noise analysis•Jul 1, 1992•2 citations

Quantum entropies of nonprobabilistic matrices

Guy Jumarie

Von Neumann defined the informational entropy of a density matrix ρ by the expression S(ρ)=−tr(ρ ln ρ). [J. Von Neumann, Die Mathematischen Grundlagen der Quantummechanik (Springer-Verlag, Berlin, 1932)]. Here, starting from the definitions of Shannon entropy and of Renyi entropy of random variables, and using some (reasonable) rules of inference, two expressions are obtained for the quantum entropy of a given square (deterministic) matrix, irrespective of any probabilistic framework and/or any randomization technique. These definitions apply directly to linear operators on Hilbert spaces even when they are not of positive trace class, and they contain Von Neumann entropy as a special case. These new measures of uncertainty could provide new approaches to some problems related to structure complexity.

Journal of Mathematical Physics•Nov 1, 1991•5 citations
We introduce a new notion of entropy for quantum states, called contextual entropy, and show how it unifies Shannon and von Neumann entropy. The main result is that from the knowledge of the contextual entropy of a quantum state of a finite-dimensional system, one can reconstruct the quantum state, i.e., the density matrix, if the Hilbert space is of dimension 3 or greater. We present an explicit algorithm for this state reconstruction and relate our result to Gleason's theorem.
In the topos approach to quantum theory, the spectral presheaf plays the role of the state space of a quantum system. We show how a notion of entropy can be defined within the topos formalism using the equivalence between states and measures on the spectral presheaf. We show how this construction unifies Shannon and von Neumann entropy as well as classical and quantum Renyi entropies. The main result is that from the knowledge of the contextual entropy of a quantum state of a finite-dimensional system, one can (mathematically) reconstruct the quantum state, i.e., the density matrix, if the Hilbert space is of dimension 333 or greater. We present an explicit algorithm for this state reconstruction and relate our result to Gleason's theorem.
A method for representing probabilistic aspects of quantum systems by means of a density function on the space of pure quantum states is introduced. In particular, a maximum entropy argument allows us to obtain a natural density function that only reflects the information provided by the density matrix. This result is applied to derive the Shannon entropy of a quantum state. The information theoretic quantum entropy thereby obtained is shown to have the desired concavity property, and to differ from the conventional von Neumann entropy. This is illustrated explicitly for a two-state system.
Given the algebra of observables of a quantum system subject to selection rules, a state can be represented by different density matrices. As a result, different von Neumann entropies can be associated with the same state. Motivated by a minimality property of the von Neumann entropy of a density matrix with respect to its possible decompositions into pure states, we give a purely algebraic definition of entropy for states of an algebra of observables, thus solving the above ambiguity. The entropy so-defined satisfies all the desirable thermodynamic properties and reduces to the von Neumann entropy in the quantum mechanical case. Moreover, it can be shown to be equal to the von Neumann entropy of the unique representative density matrix belonging to the operator algebra of a multiplicity-free Hilbert-space representation.
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.
The notion of entropy was introduced by Clausius in order to discuss the thermal behavior of physical systems. After the work of Clausius, Boltzmann, Gibbs and others, the beginning of the exact treatment of entropy was due to von Neumann and Shannon. Their starting point was very di erent, von Neumann was motivated by quantum mechanics and Shannon founded communication theory. The entropy of a state describing a physical system is a quantity expressing the uncertainty or randomness of the system. Shannon regarded this uncertainty attached to a physical system as the amount of information carried by the system, so that the entropy of a state can be read as the information carried by the state. His idea comes from the following consideration: If a physical system has a large uncertainty and one receives information on the system by some procedure, then the so obtained information is more valuable than that received from a system having less uncertainty. It is understood in probability theory that the notion of (Shannon or measure theoretic) entropy has successful applications in a variety of subjects because it determines the asymptotic behavior of certain probabilities in the course of independent trials. First we will discuss this phenomena for nite quantum systems. By a nite quantum system we mean an algebra of matrices which is stable under taking adjoint. (In other words, a nite quantum system is a nite dimensional C*algebra.) If A is such an algebra then there is a linear functional Tr which takes the value 1 at each minimal projection. It is "tracial " in the sense that Tr ab = Tr ba (a; b 2 A) Every functional! on A is determined by a density operator D! 2 A in the form!(a) = Tr D! a (a 2 A): The entropy S(!) of a functional! is de ned by means of its density operator as S(!) = Tr (D!): This notion was introduced by von Neumann in 1927 and we term it von Neumann's entropy or shortly entropy (cf. [1]). In fact, von Neumann de ned the entropy such
Von Neumann defined the informational entropy of a density matrix ρ by the expression S(ρ)=−tr(ρ ln ρ). [J. Von Neumann, Die Mathematischen Grundlagen der Quantummechanik (Springer-Verlag, Berlin, 1932)]. Here, starting from the definitions of Shannon entropy and of Renyi entropy of random variables, and using some (reasonable) rules of inference, two expressions are obtained for the quantum entropy of a given square (deterministic) matrix, irrespective of any probabilistic framework and/or any randomization technique. These definitions apply directly to linear operators on Hilbert spaces even when they are not of positive trace class, and they contain Von Neumann entropy as a special case. These new measures of uncertainty could provide new approaches to some problems related to structure complexity.