Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userDecomposition Rules for Quantum Renyi Mutual Information with an Application to Information Exclusion Relations
68
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
We prove decomposition rules for quantum Renyi mutual information, generalising the relation $I(A:B) = H(A) - H(A|B)$ to inequalities between Renyi mutual information and Renyi entropy of different orders. The proof uses Beigis generalisation of Reisz-Thorin interpolation to operator norms, and a variation of the argument employed by Dupuis which was used to show chain rules for conditional Renyi entropies. The resulting decomposition rule is then applied to establish an information exclusion relation for Renyi mutual information, generalising the original relation by Hall.
rate research
Read More
We study the relation between the quantum conditional mutual information and the quantum $alpha$-Renyi divergences. Considering the totally antisymmetric state we show that it is not possible to attain a proper generalization of the quantum conditional mutual information by optimizing the distance in terms of quantum $alpha$-Renyi divergences over the set of all Markov states. The failure of the approach considered arises from the observation that a small quantum conditional mutual information does not imply that the state is close to a quantum Markov state.
The thermal equilibrium properties of physical systems can be described using Gibbs states. It is therefore of great interest to know when such states allow for an easy description. In particular, this is the case if correlations between distant regions are small. In this work, we consider 1D quantum spin systems with local, finite-range, translation-invariant interactions at any temperature. In this setting, we show that Gibbs states satisfy uniform exponential decay of correlations and, moreover, the mutual information between two regions decays exponentially with their distance, irrespective of the temperature. The methods we use are based on the Belavkin-Staszewski relative entropy and on techniques developed by Araki. Moreover, we find that the Gibbs states of the systems we consider are superexponentially close to saturating the data-processing inequality for the Belavkin-Staszewski relative entropy.
The Quantum Fisher Information (QFI) plays a crucial role in quantum information theory and in many practical applications such as quantum metrology. However, computing the QFI is generally a computationally demanding task. In this work we analyze a lower bound on the QFI which we call the sub-Quantum Fisher Information (sub-QFI). The bound can be efficiently estimated on a quantum computer for an $n$-qubit state using $2n$ qubits. The sub-QFI is based on the super-fidelity, an upper bound on Uhlmanns fidelity. We analyze the sub-QFI in the context of unitary families, where we derive several crucial properties including its geometrical interpretation. In particular, we prove that the QFI and the sub-QFI are maximized for the same optimal state, which implies that the sub-QFI is faithful to the QFI in the sense that both quantities share the same global extrema. Based on this faithfulness, the sub-QFI acts as an efficiently computable surrogate for the QFI for quantum sensing and quantum metrology applications. Finally, we provide additional meaning to the sub-QFI as a measure of coherence, asymmetry, and purity loss.
In this work we build a theoretical framework for the transport of information in quantum systems. This is a framework aimed at describing how out of equilibrium open quantum systems move information around their state space, using an approach inspired by transport theories. The main goal is to build new mathematical tools, together with physical intuition, to improve our understanding of non-equilibrium phenomena in quantum systems. In particular, we are aiming at unraveling the interplay between dynamical properties and information-theoretic features. The main rationale here is to have a framework that can imitate, and potentially replicate, the decades-long history of success of transport theories in modeling non-equilibrium phenomena.
We provide a detailed analysis of the question: how many measurement settings or outcomes are needed in order to identify a quantum system which is constrained by prior information? We show that if the prior information restricts the system to a set of lower dimensionality, then topological obstructions can increase the required number of outcomes by a factor of two over the number of real parameters needed to characterize the system. Conversely, we show that almost every measurement becomes informationally complete with respect to the constrained set if the number of outcomes exceeds twice the Minkowski dimension of the set. We apply the obtained results to determine the minimal number of outcomes of measurements which are informationally complete with respect to states with rank constraints. In particular, we show that 4d-4 measurement outcomes (POVM elements) is enough in order to identify all pure states in a d-dimensional Hilbert space, and that the minimal number is at most 2 log_2(d) smaller than this upper bound.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
