Related papers: Locally accessible information: How much can the p…
We derive an explicit analytic estimate for the entanglement of a large class of bipartite quantum states which extends into bound entanglement regions. This is done by using an efficiently computable concurrence lower bound, which is…
While the detection of entanglement has been proved already to be quite a difficult task, experimental quantification of entanglement is even more challenging. In this work, we derive an analytical lower bound for the concurrence of a…
Inspired by Hilberg's hypothesis, which states that mutual information between blocks for natural language grows like a power law, we seek for links between power-law growth rate of algorithmic mutual information and of some estimator of…
We analyze a distributed information network in which each node has access to the information contained in a limited set of nodes (its neighborhood) at a given time. A collective computation is carried out in which each node calculates a…
The question of what can be computed, and how efficiently, are at the core of computer science. Not surprisingly, in distributed systems and networking research, an equally fundamental question is what can be computed in a…
Quantum entanglement is known to provide a strong advantage in many two-party distributed tasks. We investigate the question of how much entanglement is needed to reach optimal performance. For the first time we show that there exists a…
We investigate how much information about a quantum system can be simultaneously communicated to independent observers, by establishing quantitative limits to bipartite quantum correlations in many-body systems. As recently reported in…
We derive general upper bounds to pointwise mutual information in terms of stochastic Fisher information and show these bounds average to known results in the literature for bounds to mutual information in terms of Fisher information. These…
In recent years, the use of information principles to understand quantum correlations has been very successful. Unfortunately, all principles considered so far have a bipartite formulation, but intrinsically multipartite principles, yet to…
Multipartite entanglement is the premier resource for quantum technologies. Yet, its exact quantification in the laboratory is notoriously challenging, typically requiring the full knowledge of high dimensional quantum states. Here, we…
We give a necessary condition that a separable measurement can be implemented by local quantum operations and classical communication (LOCC) in any finite number of rounds of communication, generalizing and strengthening a result obtained…
We can only perform a finite rounds of measurements in protocols with local operations and classical communication (LOCC). In this paper, we propose a set of product states, which require infinite rounds of measurements in order to…
Genuine multipartite non-locality is not only of fundamental interest but also serves as an important resource for quantum information theory. We consider the $N$-partite scenario and provide an analytical upper bound on the maximal…
The violations of Bell inequalities by measurements on quantum states give rise to the phenomenon of quantum non-locality and express the advantage of using quantum resources over classical ones for certain information-theoretic tasks. The…
We consider the discrimination of bipartite quantum states and establish a relation between nonlocal quantum state ensemble and quantum data hiding processing. Using a bound on optimal local discrimination of bipartite quantum states, we…
We prove a new version of the Holevo bound employing the Hilbert-Schmidt norm instead of the Kullback-Leibler divergence. Suppose Alice is sending classical information to Bob using a quantum channel, while Bob is performing some projective…
Anyonic system not only has potential applications in the construction of topological quantum computer, but also presents a unique property known as topological entanglement entropy in quantum many-body systems. How to understand…
In spite of many results in quantum information theory, the complex nature of compound systems is far from being clear. In general the information is a mixture of local, and non-local ("quantum") information. To make this point more clear,…
Local state transformation is the problem of transforming an arbitrary number of copies of a bipartite resource state to a bipartite target state under local operations. That is, given two bipartite states, is it possible to transform an…
We exactly evaluate a number of multipartite entanglement measures for a class of graph states, including d-dimensional cluster states (d = 1,2,3), the Greenberger-Horne-Zeilinger states, and some related mixed states. The entanglement…