Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE

Algorithm for nondestructive estimation of quantum relative entropy

Alexei Kaltchenko

Published Aug 24, 2004• 0 citations

Abstract

We propose a new simple algorithm for non-destructive estimation of quantum relative entropy S(ρ||σ), where the density operators ρ and σ are defined on the same finite-dimensional Hilbert space but are otherwise completely unspecified (unknown). See text for formula.

DOI: 10.1117/12.541901

Related papers

Universal non-destructive estimation of quantum relative entropy

Alexei Kaltchenko

This paper describes the universal nondestructive estimation of quantum relative entropy. The sequences with the independent realizations of two i.i.d sources over a finite alphabet and the corresponding marginal distributions with the universal estimation is used to define the function quantum relative entropy. A product state emitted by a quantum i.i.d source with density matrix is subjected to a unitary transformation with a computational basis. The quantum entropy of a source and the eigenbasis without compromising the fidelity is learnt. With the arbitrary high accuracy the fidelity arbitrary is close to the unity

IEEE International Symposium on Information Theory (ISIT)Dec 23, 20042 citations

Further results on the relative entropy

Matthew J. Donald

Given any subset ℬ, containing the identity (1), of ℬ (ℋ) (the bounded operators on some Hilbert space ℋ), and given two states σ and ρ on ℬ(ℋ), a definition was given in [3] of entℬ (σℬ|ρ|ℬ) - ‘the entropy of σ relative to ρ given the information in ℬ’. It was shown that, for ℬ an injective von Neumann algebra, the resulting relative entropy agreed with those of Umegaki, Araki, Pusz and Woronowicz, and Uhlmann. The purpose of this paper is to explore this definition further. After some technical preliminaries in Section 2, in Section 3 a new characterization of entℬ(ℋ) (σ|ρ) for σ and ρ normal states will be given. In Section 4 it will be shown that under fairly general circumstances the relative entropy on algebras can be used for statistical inference. This is important for applications of the relative entropy. I shall given the briefest sketches of how I see these applications being made in the measurement problem in quantum theory and in a ‘many worlds’ interpretation. The vigilant reader will notice that the scheme proposed in Section 4 for modelling measurements subject to given compatibility requirements differs slightly from that proposed in the introduction to [3]. The reason for this is outlined in Section 5, where an explicit computation is made of the relative entropy for the simplest non-trivial case in which ℬ is not an algebra; when ℬ = {1, P, Q} for P and Q projections subject to certain conditions.

Mathematical Proceedings of the Cambridge Philosophical SocietyMar 1, 198748 citations

Maps on states preserving the relative entropy

Lajos Molnár

Let H be a finite dimensional Hilbert space. The aim of this short note is to prove that every bijective map on the space S(H) of all density operators on H which preserves the relative entropy is of the form ϕ(ρ)=UρU* with some unitary or antiunitary operator U on H.

Journal of Mathematical PhysicsMar 1, 200828 citations

Measuring quantum relative entropy with finite-size effect

Masahito Hayashi

We study the estimation of relative entropy D ( ρ ‖ σ ) when σ is known. We show that the Cramér-Rao type bound equals the relative varentropy. Our estimator attains the Cramér-Rao type bound when the dimension d is fixed. It also achieves the sample complexity O ( d 2 ) when the dimension d increases. This sample complexity is optimal when σ is the completely mixed state. Also, it has time complexity O ( d 6 p o l y l o g d ) . Our proposed estimator unifiedly works under both settings.

arXiv:2406.17299QuantumMay 5, 20252 citations

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 MathematicsJan 1, 20240 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 PhysicsNov 1, 19915 citations