We develop two analytic lower bounds on the probability of success p of identifying a state picked from a known ensemble of pure states: a bound based on the pairwise inner products of the states, and a bound based on the eigenvalues of their Gram matrix. We use the latter to lower bound the asymptotic distinguishability of ensembles of n random quantum states in d dimensions, where n/d approac...

We propose a new family of coherence monotones, named the generalized coherence concurrence (or coherence k-concurrence), which is an analogous concept to the generalized entanglement concurrence. The coherence k-concurrence of a state is nonzero if and only if the coherence number (a recently introduced discrete coherence monotone) of the state is not smaller than k, and a state can be convert...

We present mathematical techniques for addressing two closely related questions in quantum communication theory. In particular, we give a statistically motivated derivation of the Bures-Uhlmann measure of distinguishability for density operators, and we present a simplified proof of the Holevo upper bound to the mutual information of quantum communication channels. Both derivations give rise to...

This review reports on the main results of a set of kinetic elucidation methods developed by our team over the last few years. Formalisms, procedures and examples to solve all possible AB photochromic and thermophotochromic kinetics are presented. Also, discussions of the operating conditions, the continuous irradiation experiment, the spectrokinetic methods testing with numerical integration m...

The conventional way of explaining Gibbs paradox as due to the distinguishability of particles has been challenged recently and a new fundamental definition for the entropy has been proposed that gives the same entropy for distinguishable particles as for indistinguishable particles. In this paper arguments are presented that strongly favor the conventional definition of entropy and its resolut...