This article contains a survey of the geometric approach to quantum correlations. We focus mainly on the geometric measures of quantum correlations based on the Bures and quantum Hellinger distances.
The minimal Bures distance of a quantum state of a bipartite system AB to the set of classical states for subsystem A defines a geometric measure of quantum discord. When A is a qubit, we show that this geometric quantum discord is given in terms of
the eigenvalues of a (2 n_B) x (2 n_B) hermitian matrix, n_B being the Hilbert space dimension of the other subsystem B. As a first application, we calculate the geometric discord for the output state of the DQC1 algorithm. We find that it takes its highest value when the unitary matrix from which the algorithm computes the trace has its eigenvalues uniformly distributed on the unit circle modulo a symmetry with respect to the origin. As a second application, we derive an explicit formula for the geometric discord of two-qubit states with maximally mixed marginals and compare it with other measures of quantum correlations. We also determine the closest classical states to such two-qubit states.
A geometric interpretation for the A-fidelity between two states of a qubit system is presented, which leads to an upper bound of the Bures fidelity. The metrics defined based on the A-fidelity are studied by numerical method. An alternative generali
zation of the A-fidelity, which has the same geometric picture, to a $N$-state quantum system is also discussed.
We analyze the geometry of a joint distribution over a set of discrete random variables. We briefly review Shannons entropy, conditional entropy, mutual information and conditional mutual information. We review the entropic information distance formu
la of Rokhlin and Rajski. We then define an analogous information area. We motivate this definition and discuss its properties. We extend this definition to higher-dimensional volumes. We briefly discuss the potential utility for these geometric measures in quantum information processing.
Quantum channel estimation and discrimination are fundamentally related information processing tasks of interest in quantum information science. In this paper, we analyze these tasks by employing the right logarithmic derivative Fisher information an
d the geometric Renyi relative entropy, respectively, and we also identify connections between these distinguishability measures. A key result of our paper is that a chain-rule property holds for the right logarithmic derivative Fisher information and the geometric Renyi relative entropy for the interval $alphain(0,1) $ of the Renyi parameter $alpha$. In channel estimation, these results imply a condition for the unattainability of Heisenberg scaling, while in channel discrimination, they lead to improved bounds on error rates in the Chernoff and Hoeffding error exponent settings. More generally, we introduce the amortized quantum Fisher information as a conceptual framework for analyzing general sequential protocols that estimate a parameter encoded in a quantum channel, and we use this framework, beyond the aforementioned application, to show that Heisenberg scaling is not possible when a parameter is encoded in a classical-quantum channel. We then identify a number of other conceptual and technical connections between the tasks of estimation and discrimination and the distinguishability measures involved in analyzing each. As part of this work, we present a detailed overview of the geometric Renyi relative entropy of quantum states and channels, as well as its properties, which may be of independent interest.
Quantum correlations as the resource for quantum communication can be distributed over long distances by quantum repeaters. In this Letter, we introduce the notion of a noisy quantum repeater, and examine its role in quantum communication. Quantum co
rrelations shared through noisy quantum repeaters are then characterized and their secrecy properties are studied. Remarkably, noisy quantum repeaters naturally introduce private states in the key distillation scenario, and consequently key distillation protocols are demonstrated to be more tolerant.