Related papers: Explicit error bounds for entanglement transformat…
In their seminal work, Bennett et al. [IEEE Trans. Inf. Theory (2002)] showed that, with sufficient shared randomness, one noisy channel can simulate another at a rate equal to the ratio of their capacities. We establish that when coding…
We provide upper bound on the maximal rate at which irreversible quantum dynamics can generate entanglement in a bipartite system. The generator of irreversible dynamics consists of a Hamiltonian and dissipative terms in Lindblad form. The…
Entanglement is known to boost the efficiency of classical communication. In distributed computation, for instance, exploiting entanglement can reduce the number of communicated bits or increase the probability to obtain a correct answer.…
An entanglement measure for a bipartite quantum system is a state functional that vanishes on separable states and that does not increase under separable (local) operations. It is well-known that for pure states, essentially all…
We present a construction of new bound entangled states from given bound entangled states for arbitrary dimensional bipartite systems. One way to construct bound entangled states is to show that these states are PPT (positive partial…
I consider deterministic distinguishability of a set of orthogonal, bipartite states when only a single copy is available and the parties are restricted to local operations and classical communication, but with the additional requirement…
The newfound importance of ``entanglement as a resource'' in quantum computation and quantum communication compels us to quantify it in as many distinct ways as possible. Here we explore a new measure of entanglement for mixed quantum…
Coherent enhancement is a powerful mechanism for improving the sensitivity of a wide range of detectors, but its practical use is often limited by the difficulty of preparing the required quantum states. We show that this difficulty has a…
The paper presents exponentially-strong converses for source-coding, channel coding, and hypothesis testing problems. More specifically, it presents alternative proofs for the well-known exponentially-strong converse bounds for almost…
We initiate the study of quantifying nonlocalness of a bipartite measurement by the minimum amount of classical communication required to simulate the measurement. We derive general upper bounds, which are expressed in terms of certain…
We demonstrate the irreversibility of asymptotic entanglement manipulation under quantum operations that completely preserve the positivity of partial transpose (PPT), resolving a major open problem in quantum information theory. Our key…
We provide a general description of the phenomenon of entanglement in bipartite systems, as it manifests in micro and macro physical systems, as well as in human cognitive processes. We do so by observing that when genuine coincidence…
In this article, we provide a comprehensive analysis of the asymptotic behavior of Bell numbers, enhancing and unifying various results previously dispersed in the literature. We establish several explicit lower and upper bounds. The main…
We determine the exact error and strong converse exponent for entanglement-assisted classical-quantum channel simulation in worst case input purified distance. The error exponent is expressed as a single-letter formula optimized over…
Bound entangled states are states that are entangled but from which no entanglement can be distilled if all parties are allowed only local operations and classical communication. However, in creating these states one needs nonzero…
In recent years considerable progress has been made towards developing a general theory of quantum entanglement. In particular, criteria to decide whether a given quantum state is entangled are of high theoretical and practical interest.…
We relate the the distinguishability of quantum states with their robustness of the entanglement, where the robustness of any resource quantifies how tolerant it is to noise. In particular, we identify upper and lower bounds on the…
Characterizing entanglement in all but the simplest case of a two qubit pure state is a hard problem, even understanding the relevant experimental quantities that are related to entanglement is difficult. It may not be necessary, however,…
A natural operational paradigm for distributed quantum and classical information processing involves local operations coordinated by multiple rounds of public communication. In this paper we consider the minimum number of communication…
We study the complexity of approximately contracting translation-invariant tensor networks. The computational cost of row-by-row tensor network contraction, which defines a discrete time evolution governed by a fixed transfer matrix, is…