Quantumness of quantum ensembles

Quantum ensembles, as generalizations of quantum states, are a universal instrument for describing the physical or informational status in measurement theory and communication theory because of the ubiquitous presence of incomplete information and the necessity of encoding classical messages in quantum states. The interrelations between the constituent states of a quantum ensemble can display more or less quantum characteristics when the involved quantum states do not commute because no single classical basis diagonalizes all these states. This contrasts sharply with the situation of a single quantum state, which is always diagonalizable. To quantify these quantum characteristics and, in particular, to more clearly understand the possibilities of secure data transmission in quantum cryptography, based on certain prototypical quantum ensembles, we introduce some figures of merit quantifying the quantumness of a quantum ensemble, review some existing quantities that are interpretable as measures of quantumness, and investigate their fundamental properties such as subadditivity and concavity. Comparing these measures, we find that different measures can yield different quantumness orderings for quantum ensembles. This reveals the elusive and complex nature of quantum ensembles and shows that no unique measure can describe all the fundamental and subtle properties of quantumness.     

Transformations on density operators and on positive definite operators preserving the quantum Rényi divergence

In a certain sense we generalize the recently introduced and extensively studied notion called quantum Rényi divergence (also called ”sandwiched Rényi relative entropy”) and describe the structures of corresponding symmetries. More precisely, we characterize all transformations on the set of density operators which leave our new general quantity invariant and also determine the structure of all bijective transformations on the cone of positive definite operators which preserve the quantum Rényi divergence.     

Entropy and entanglement of an effective two-level atom interacting with two quantized field modes in squeezed displaced fock states

We have studied the influences of ac-Stark shifts on the field quantum entropy, with “squeezed displaced Fock states” (SDFSs) basis. By a unitary transformation we derive a Raman-coupled Hamiltonian perturbatively in coupling constants. The exact results are employed to perform a careful investigation of the temporal evolution of entropy. A factorization of the initial density operator is assumed, with the privileged field mode being in the SDFS. We invoke the mathematical notion of maximum variation of a function to construct a measure for entropy fluctuations. The results show that the effect of the SDFS changes the quasiperiod of the field entropy evolution and entanglement between the atom and the field. The Rabi oscillation frequency, the collapse and revival times of the atomic coherence are found to have strikingly different photon-intensity dependent than those found previously. The general conclusions reached are illustrated by numerical results.     

Entropy,stochastic matrices,and quantum operations

The goal of the present paper is to derive some conditions on saturation of (strong) subadditivity inequality for the stochastic matrices. The notion of relative entropy of stochastic matrices is introduced by mimicking quantum relative entropy. Some properties of this concept are listed, and the connection between the entropy of the stochastic quantum operations and that of stochastic matrices are discussed.     

Quantum proper entropies and additive capacities of quantum information channels

An elementary algebraic approach to unified quantum information theory is given. The operational meaning of entanglement as specifically quantum encoding is disclosed. General relative entropy as information divergence is introduced, and three most important types of relative information, namely, the Araki-Umegaki type (A-type), the Belavkin-Staszewski type (B-type), and the thermodynamical (C-type) are discussed. It is shown that true quantum entanglement-assisted entropy is greater than semiclassical (von Neumann) quantum entropy, and the proper positive quantum conditional entropy is introduced. The general quantum mutual information via entanglement is defined, and the corresponding types of quantum channel capacities as a supremum via the generalized encodings are formulated. The additivity problem for quantum logarithmic capacities for products of arbitrary quantum channels under appropriate constraints on encodings is discussed. It is proved that true quantum capacity, which is achieved on the standard entanglement as an optimal quantum encoding, retains the additivity property of the logarithmic quantum channel entanglement-assisted capacities on the products of quantum input states. This result for quantum logarithmic information of A-type, which was obtained earlier by the author, is extended to any type of quantum information.     

WEAKLY ALMOST PERIODIC POINT AND ERGODIC MEASURE

Let X be a compact metric space and f: X→X be continuous.This pape introduces the notion of weakly almost periodic point, which is a generalization of the notion of almost periodic point, proves that each of f-invariant ergodic measures can be generated by a weakly almost periodic point of f and gives some equivalent conditions for that f has an invariant ergodic measure whose support is X and ones for that f has no non-atomic invariant ergodic measure, the latter is a generalization of the Blokh's work on self-maps of the interval. Also two formulae for calculating the togological entropy are obtained.     

信息熵公理及其在决策分析中的应用

针对信息量是消息发生前的不确定性给出一个直观测量信息量公式.为了克服Shannon熵的局限性和分析信息度量本质,借鉴距离空间理论中度量公理定义的思路,通过非负性、对称性、次可加和极大性给出信息熵的公理化新定义.将Shannon熵、直观信息熵和β-熵等不同形式的信息度量统一在同一公理化结构下.应用直观信息熵公式仅采用四则运算进行决策树分析,避免了利用Shannon熵公式的对数运算.     

关于有限马氏链相对熵密度和随机条件熵的一类极限定理

本文引进有限非齐次马链随机条件熵的概念，研究这个概念与相对熵密度的关系，并通过数列的绝对平均收敛的概念给出了有限非齐次马氏链的相对频率，相对熵密度和平均随机条件熵ａ．ｅ收敛于常数及有限非齐次马氏链熵率存在的条件。     

Quantity of information; Comparison between information systems: 1. Non-fuzzy states

In statistical theory, experiments or probabilistic information systems are supposed to be informative, since they reduce the amount of uncertainty associated with the states of nature. For the case that the available information systems are vague (fuzzy information systems), H. Tanaka, T. Okuda and K. Asai have proven, using the ‘measure of information’ as provided by ‘entropy’, that the fuzzy information systems are informative too.Now, we wish to state and to study a criterion in order to compare fuzzy information systems by the ‘quantity of information of a fuzzy information system’ (defined by Tanaka et al.).In this first paper we consider the situation where we require information about the original state space (non-fuzzy state space).The second paper will deal with the situation where we require only information on certain vague states (fuzzy states).     

Quantity of information; comparison between information systems: 2. Fuzzy states

In statistical theory, experiments or probabilistic information systems are supposed to be informative, since they reduce the amount of uncertainty associated with the states of nature. For the case that the available information systems are vague (fuzzy information systems), H. Tanaka, T. Okuda and K. Asai have proven, using the ‘measure of information’ as provided by ‘entropy’, that the fuzzy information systems are informative too.Now, we wish to state and to study a criterion in order to compare fuzzy information systems by the ‘quantity of information of a fuzzy information system’ (defined by Tanaka et al.).In the first paper we considered the situation where we require information about the original state space (non-fuzzy state space).This second paper deals with the situation where we require only information on certain vague states (fuzzy states).     

对数似然比与整值随机变量序列的一类强律

本文引进对数似然比作为整值随机变量序列相对于服从几何分布的独立随机变量序列的偏差的一种度量,并通过限制对数似然比给出了样本空间的一个子集.在此子集上得到了一类用不等式表示的强律,其中包含整值随机变量序列与相对熵密度及几何分布的熵函数有关的若干极限性质.     

On analogs of spectral decomposition of a quantum state

The set of quantum states in a Hilbert space is considered. The structure of the set of extreme points of the set of states is investigated and an arbitrary state is represented as the Pettis integral over a finitely additive measure on the set of vector states, which is a generalization of the spectral decomposition of a normal state.     

Displacement convexity of entropy and related inequalities on graphs

We introduce the notion of an interpolating path on the set of probability measures on finite graphs. Using this notion, we first prove a displacement convexity property of entropy along such a path and derive Prékopa-Leindler type inequalities, a Talagrand transport-entropy inequality, certain HWI type as well as log-Sobolev type inequalities in discrete settings. To illustrate through examples, we apply our results to the complete graph and to the hypercube for which our results are optimal—by passing to the limit, we recover the classical log-Sobolev inequality for the standard Gaussian measure with the optimal constant.     

Bisimulations and bisimulation games between Verbrugge models

Interpretability logic is a modal formalization of relative interpretability between first-order arithmetical theories. Verbrugge semantics is a generalization of Veltman semantics, the basic semantics for interpretability logic. Bisimulation is the basic equivalence between models for modal logic. We study various notions of bisimulation between Verbrugge models and develop a new one, which we call w-bisimulation. We show that the new notion, while keeping the basic property that bisimilarity implies modal equivalence, is weak enough to allow the converse to hold in the finitary case. To do this, we develop and use an appropriate notion of bisimulation games between Verbrugge models.     

Entanglement measures based on observable correlations

By regarding quantum states as communication channels and using observable correlations quantitatively expressed by mutual information, we introduce a hierarchy of entanglement measures that includes the entanglement of formation as a particular instance. We compare the maximal and minimal measures and indicate the conceptual advantages of the minimal measure over the entanglement of formation. We reveal a curious feature of the entanglement of formation by showing that it can exceed the quantum mutual information, which is usually regarded as a theoretical measure of total correlations. This places the entanglement of formation in a broader scenario, highlights its peculiarity in relation to pure-state ensembles, and introduces a competing definition with intrinsic informational significance. __________ Translated from Teoreticheskaya i Matematicheskaya Fizika, Vol. 155, No. 3, pp. 453–462, June, 2008.     

Development of concept of topological entropy for systems with multiple time

We study the topological entropy for dynamical systems with discrete or continuous multiple time. Due to the generalization of a well-known one time-dimensional result we show that the definition of topological entropy, using the approach for subshifts, leads to the zero entropy for many systems different from subshift. We define a new type of relative topological entropy to avoid this phenomenon. The generalization of Bowen’s power rule allows us to define topological and relative topological entropies for systems with continuous multiple time. As an application, we find a relation between the relative topological entropy and controllability of linear systems with continuous multiple time.     

Dirichlet norms,capacities and generalized isoperimetric inequalities for Markov operators

We define the notion of p-capacity for a reversible Markov operator on a general measure space and prove that uniform estimates for the ratio of capacity and measure are equivalent to certain imbedding theorems for the Orlicz and Dirichlet norms. As a corollary we get results on connections between embedding theorems and isoperimetric properties for general Markov operators and, particularly, a generalization of the Kesten theorem on the spectral radius of random walks on amenable groups for the case of arbitrary graphs with non-finitely supported transition probabilities.     

The Local Cut Lemma

The Lovász Local Lemma is a very powerful tool in probabilistic combinatorics, that is often used to prove existence of combinatorial objects satisfying certain constraints. Moser and Tardos (2010) have shown that the LLL gives more than just pure existence results: there is an effective randomized algorithm that can be used to find a desired object. In order to analyze this algorithm, Moser and Tardos developed the so-called entropy compression method. It turned out that one could obtain better combinatorial results by a direct application of the entropy compression method rather than simply appealing to the LLL. The aim of this paper is to provide a generalization of the LLL which implies these new combinatorial results. This generalization, which we call the Local Cut Lemma, concerns a random cut in a directed graph with certain properties. Note that our result has a short probabilistic proof that does not use entropy compression. As a consequence, it not only shows that a certain probability is positive, but also gives an explicit lower bound for this probability. As an illustration, we present a new application (an improved lower bound on the number of edges in color-critical hypergraphs) as well as explain how to use the Local Cut Lemma to derive some of the results obtained previously using the entropy compression method.     

Entropy and the variational principle for actions of sofic groups

Recently Lewis Bowen introduced a notion of entropy for measure-preserving actions of a countable sofic group on a standard probability space admitting a generating partition with finite entropy. By applying an operator algebra perspective we develop a more general approach to sofic entropy which produces both measure and topological dynamical invariants, and we establish the variational principle in this context. In the case of residually finite groups we use the variational principle to compute the topological entropy of principal algebraic actions whose defining group ring element is invertible in the full group C ^∗-algebra.