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

International Journal of Systems Science

Use of the quantum entropy of non-probabilistic matrices in automatic control

Guy Jumarie

Published Dec 1, 1993• 0 citations
Publisher

Abstract

The quantum mechanical entropy of density matrices defined by Von Neumann in quantum physics has been generalized in the form of quantum entropy of non-probabilistic matrices, and it is shown that the latter can be of some use in automatic control. This quantum entropy can be thought of as a measure of structure complexity and its application is quite relevant and meaningful in the following topics: stability of linear and non-linear systems, robustness and order reduction. Quantum entropy appears to be a new weighted combination of eigenvalues which would allow us to re-examine some problems with new points of view relating to information theory without probability.

DOI
10.1080/00207729308949628

Related papers

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

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 algorithmic entropy

Péter Gács

We extend algorithmic information theory to quantum mechanics, taking a universal semicomputable density matrix (`universal probability') as a starting point, and define complexity (an operator) as its negative logarithm. A number of properties of Kolmogorov complexity extend naturally to the new domain. Approximately, a quantum state is simple if it is within a small distance from a low-dimensional subspace of low Kolmogorov complexity. The von Neumann entropy of a computable density matrix is within an additive constant from the average complexity. Some of the theory of randomness translates to the new domain. We explore the relations of the new quantity to the quantum Kolmogorov complexity defined by Vitányi (we show that the latter is sometimes as large as 2 n − 2 log n ) and the qubit complexity defined by Berthiaume, Dam and Laplante. The `cloning' properties of our complexity measure are similar to those of qubit complexity.

arXiv:quant-ph/0011046•Journal of Physics A Mathematical and General•Aug 24, 2001•71 citations

Quantum algorithmic entropy

Péter Gács

Extends algorithmic information theory to quantum mechanics, taking a universal semi-computable density matrix ("universal probability") as a starting point, and defines complexity (an operator) as its negative logarithm. A number of properties of Kolmogorov complexity extend naturally to the new domain. Approximately, a quantum state is simple if it is within a small distance from a low-dimensional subspace of low Kolmogorov complexity. The von-Neumann entropy of a computable density matrix is within an additive constant from the average complexity. Some of the theory of randomness translates to the new domain. We explore the relations of the new quantity to the quantum Kolmogorov complexity defined by P.M.B. Vita/spl acute/nyi (1999) (we show that the latter is sometimes as large as 2n-2 log n) and the qubit complexity defined by A. Berthiaume et al. (2000). The "cloning" properties of our complexity measure are similar to those of qubit complexity.

IEEE Conference on Computational Complexity (CCC)•Nov 13, 2002•4 citations

Randomized Linear Algebra Approaches to Estimate the Von Neumann Entropy of Density Matrices

Eugenia-Maria Kontopoulou, Gregory Dexter, Wojciech Szpankowski +2 more

The von Neumann entropy, named after John von Neumann, is an extension of the classical concept of entropy to the field of quantum mechanics. From a numerical perspective, von Neumann entropy can be computed simply by computing all eigenvalues of a density matrix, an operation that could be prohibitively expensive for large-scale density matrices. We present and analyze three randomized algorithms to approximate von Neumann entropy of real density matrices: our algorithms leverage recent developments in the Randomized Numerical Linear Algebra (RandNLA) literature, such as randomized trace estimators, provable bounds for the power method, and the use of random projections to approximate the eigenvalues of a matrix. All three algorithms come with provable accuracy guarantees and our experimental evaluations support our theoretical findings showing considerable speedup with small loss in accuracy.

arXiv:1801.01072•IEEE Transactions on Information Theory•Jun 1, 2018•22 citations

Some Aspects of Entropies for Quantum Processes

Noboru Watanabe, Luigi Accardi, Guillaume Adenier +5 more

The classical entropies were formulated by means of the classical probability theory. The essence of the classical probability theory corresponds to the use of c‐number with commutative property. On the base of the classical probability theory, the classical information theory can be discussed by using the classical entropies. On the other hand, the principle of the quantum phenomenon seems to be having non‐commutative behavior. It leads to the use of the q‐operator with non‐commutative property to introduce the quantum entropies based on the quantum probability theory. In order to discuss the efficiency of the information communication processes, a measure of complexity of initial state itself and a measure of transmitted complexity through communication channels are necessary. Shannon’s entropy and the mutual entropy represent these measures of complexities in classical communication system, respectively. Von Neumann entropy and Ohya mutual entropy relate to these measures of complexities in quantum communication system, respectively. Recently, several mutual entropy type measures (Lindblad—Nielsen entropy and Coherent entropy) were proposed by using an entropy exchange with respect to a channel and an initial state. In this paper, we will show the most suitable one for discuss the efficiency of information transmission for quantum processes. In classical information theory, one of the most important tools to analyze communication processes are the classical coding theorems, which was investigated through the classical dynamical entropy. The classical dynamical entropy was discussed in [1] with respect to a measure preserving transformation defined on a message space for finite partitions of the measure space. In quantum information theory, Emch [2] and Conne, Stormer [3] first studied a complexity of quantum dynamical processes. After that, Ohya introduced a S‐ mixing entropy in general quantum systems, which was natural extension of the von Neumann entropy. Using the S—mixing entropy, Ohya defined a mean entropy and a mean mutual entropy for the quantum dynamical systems. Conne, Narnhoffer and Thirring introduced a dynamical entropy (CNT entropy) [4] and several researchers discussed the CNT entropy [5,6,7,8]. Alicki and Fannes defined a dynamical entropy (AF entropy) [9] using a finite operational partitions of unity. In 1995, Voiculescu proposed a dynamical entropy (dynamical approximation entropy) [10] in C* and W* algebras. Through the quantum Markov process, Accardi, Ohya and Watanabe defined a dynamical entropy (AOW entropy) [11,12] in 1997. Base on transition expectations and liftings in the sense of Accardi and Ohya [13], Kossakowski, Ohya and Watanabe introduced a dynamical entropy (KOW entropy) [14] with respect to completely positive maps in 1999. In this paper, we will discuss the complexity of the quantum dynamical process to calculate the generalized AOW entropy given by KOW entropy.

AIP conference proceedings•Jan 1, 2009•0 citations
The quantum mechanical entropy of density matrices defined by Von Neumann in quantum physics has been generalized in the form of quantum entropy of non-probabilistic matrices, and it is shown that the latter can be of some use in automatic control. This quantum entropy can be thought of as a measure of structure complexity and its application is quite relevant and meaningful in the following topics: stability of linear and non-linear systems, robustness and order reduction. Quantum entropy appears to be a new weighted combination of eigenvalues which would allow us to re-examine some problems with new points of view relating to information theory without probability.
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.
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
We extend algorithmic information theory to quantum mechanics, taking a universal semicomputable density matrix (`universal probability') as a starting point, and define complexity (an operator) as its negative logarithm. A number of properties of Kolmogorov complexity extend naturally to the new domain. Approximately, a quantum state is simple if it is within a small distance from a low-dimensional subspace of low Kolmogorov complexity. The von Neumann entropy of a computable density matrix is within an additive constant from the average complexity. Some of the theory of randomness translates to the new domain. We explore the relations of the new quantity to the quantum Kolmogorov complexity defined by Vitányi (we show that the latter is sometimes as large as 2 n − 2 log n ) and the qubit complexity defined by Berthiaume, Dam and Laplante. The `cloning' properties of our complexity measure are similar to those of qubit complexity.
Extends algorithmic information theory to quantum mechanics, taking a universal semi-computable density matrix ("universal probability") as a starting point, and defines complexity (an operator) as its negative logarithm. A number of properties of Kolmogorov complexity extend naturally to the new domain. Approximately, a quantum state is simple if it is within a small distance from a low-dimensional subspace of low Kolmogorov complexity. The von-Neumann entropy of a computable density matrix is within an additive constant from the average complexity. Some of the theory of randomness translates to the new domain. We explore the relations of the new quantity to the quantum Kolmogorov complexity defined by P.M.B. Vita/spl acute/nyi (1999) (we show that the latter is sometimes as large as 2n-2 log n) and the qubit complexity defined by A. Berthiaume et al. (2000). The "cloning" properties of our complexity measure are similar to those of qubit complexity.
The von Neumann entropy, named after John von Neumann, is an extension of the classical concept of entropy to the field of quantum mechanics. From a numerical perspective, von Neumann entropy can be computed simply by computing all eigenvalues of a density matrix, an operation that could be prohibitively expensive for large-scale density matrices. We present and analyze three randomized algorithms to approximate von Neumann entropy of real density matrices: our algorithms leverage recent developments in the Randomized Numerical Linear Algebra (RandNLA) literature, such as randomized trace estimators, provable bounds for the power method, and the use of random projections to approximate the eigenvalues of a matrix. All three algorithms come with provable accuracy guarantees and our experimental evaluations support our theoretical findings showing considerable speedup with small loss in accuracy.
The classical entropies were formulated by means of the classical probability theory. The essence of the classical probability theory corresponds to the use of c‐number with commutative property. On the base of the classical probability theory, the classical information theory can be discussed by using the classical entropies. On the other hand, the principle of the quantum phenomenon seems to be having non‐commutative behavior. It leads to the use of the q‐operator with non‐commutative property to introduce the quantum entropies based on the quantum probability theory. In order to discuss the efficiency of the information communication processes, a measure of complexity of initial state itself and a measure of transmitted complexity through communication channels are necessary. Shannon’s entropy and the mutual entropy represent these measures of complexities in classical communication system, respectively. Von Neumann entropy and Ohya mutual entropy relate to these measures of complexities in quantum communication system, respectively. Recently, several mutual entropy type measures (Lindblad—Nielsen entropy and Coherent entropy) were proposed by using an entropy exchange with respect to a channel and an initial state. In this paper, we will show the most suitable one for discuss the efficiency of information transmission for quantum processes. In classical information theory, one of the most important tools to analyze communication processes are the classical coding theorems, which was investigated through the classical dynamical entropy. The classical dynamical entropy was discussed in [1] with respect to a measure preserving transformation defined on a message space for finite partitions of the measure space. In quantum information theory, Emch [2] and Conne, Stormer [3] first studied a complexity of quantum dynamical processes. After that, Ohya introduced a S‐ mixing entropy in general quantum systems, which was natural extension of the von Neumann entropy. Using the S—mixing entropy, Ohya defined a mean entropy and a mean mutual entropy for the quantum dynamical systems. Conne, Narnhoffer and Thirring introduced a dynamical entropy (CNT entropy) [4] and several researchers discussed the CNT entropy [5,6,7,8]. Alicki and Fannes defined a dynamical entropy (AF entropy) [9] using a finite operational partitions of unity. In 1995, Voiculescu proposed a dynamical entropy (dynamical approximation entropy) [10] in C* and W* algebras. Through the quantum Markov process, Accardi, Ohya and Watanabe defined a dynamical entropy (AOW entropy) [11,12] in 1997. Base on transition expectations and liftings in the sense of Accardi and Ohya [13], Kossakowski, Ohya and Watanabe introduced a dynamical entropy (KOW entropy) [14] with respect to completely positive maps in 1999. In this paper, we will discuss the complexity of the quantum dynamical process to calculate the generalized AOW entropy given by KOW entropy.