Related papers: Distillation Protocols that Involve Local Distingu…
We derive concentration inequalities for the supremum norm of the difference between a kernel density estimator (KDE) and its point-wise expectation that hold uniformly over the selection of the bandwidth and under weaker conditions on the…
The intriguing and powerful capability of nonlocality in communication field ignites the research of the nonlocality distillation. The first protocol presented in Ref[Phys. Rev. Lett. 102, 120401] shows that the nonlocality of bipartite…
Non-locality is a powerful resource for various communication and information theoretic tasks, e.g., to establish a secret key between two parties, or to reduce the communication complexity of distributed computing. Typically, the more…
Frequency estimation in data streams is one of the classical problems in streaming algorithms. Following much research, there are now almost matching upper and lower bounds for the trade-off needed between the number of samples and the…
We imagine an experiment on an unknown quantum mechanical system in which the system is prepared in various ways and a range of measurements are performed. For each measurement M and preparation rho the experimenter can determine, given…
An important open problem in quantum information theory is the question of the existence of NPT bound entanglement. In the past years, little progress has been made, mainly because of the lack of mathematical tools to address the problem.…
This paper theoretically investigates the following empirical phenomenon: given a high-complexity network with poor generalization bounds, one can distill it into a network with nearly identical predictions but low complexity and vastly…
In this work, we establish lower-bounds against memory bounded algorithms for distinguishing between natural pairs of related distributions from samples that arrive in a streaming setting. In our first result, we show that any algorithm…
A lower bound on the amount of noise that must be added to a GHZ-like entangled state to make it separable (also called the random robustness) is found using the transposition condition. The bound is applicable to arbitrary numbers of…
The prototypical high-dimensional statistics problem entails finding a structured signal in noise. Many of these problems exhibit an intriguing phenomenon: the amount of data needed by all known computationally efficient algorithms far…
In this paper, we consider sparse networks consisting of a finite number of non-overlapping communities, i.e. disjoint clusters, so that there is higher density within clusters than across clusters. Both the intra- and inter-cluster edge…
We consider bipartite systems as versatile probes for the estimation of transformations acting locally on one of the subsystems. We investigate what resources are required for the probes to offer a guaranteed level of metrological…
Non-local correlations are one of the most fascinating consequences of quantum physics from the point of view of information: Such correlations, although not allowing for signaling, are unexplainable by pre-shared information. The…
We explore entanglement as a resource to distinguish locally indistinguishable orthogonal quantum states. Specifically, we consider sets which contain states from an unextendible product basis along with a pure entangled state. We establish…
Entanglement is a central resource in quantum information science, yet its structure in high dimensions remains notoriously difficult to characterize. One of the few general results on high-dimensional entanglement is given by peel-off…
Quantum entanglement is a useful resource for implementing communication tasks. However, for the resource to be useful in practice, it needs to be accessible by parties with bounded computational resources. Computational entanglement…
We consider the problem of sampling from a strongly log-concave density in $\mathbb{R}^d$, and prove an information theoretic lower bound on the number of stochastic gradient queries of the log density needed. Several popular sampling…
A key concept of quantum information theory is that accessing information encoded in a quantum system requires us to discriminate between several possible states the system could be in. A natural generalization of this problem, namely,…
Recently, hypergraphs have attracted a lot of attention due to their ability to capture complex relations among entities. The insurgence of hypergraphs has resulted in data of increasing size and complexity that exhibit interesting…
Given a bipartite system, correlations between its subsystems can be understood as information that each one carries about the other. In order to give a model-independent description of secure information disposal, we propose the paradigm…