Related papers: Error exponents for tripartite-to-bipartite entang…
We describe a protocol for distilling maximally entangled bipartite states between random pairs of parties from those sharing a tripartite W state, and show that, rather surprisingly, the total distillation rate (the total number of EPR…
We analyze entanglement swapping (ES) of partially entangled pure states with arbitrary Schmidt rank from the perspective of quantum state discrimination. It is shown that the standard deterministic ES protocol is related with an optimal…
Entanglement of pure states of bipartite quantum systems has been shown to have a unique measure in terms of the von Neumann entropy of the reduced states of either of its subsystems. The measure is established under entanglement…
We consider implementations of a bipartite unitary on many pairs of unknown input states by local operation and classical communication assisted by shared entanglement. We investigate to what extent the entanglement cost and the classical…
Consider the asymmetric broadcast channel with a random superposition codebook, which may be comprised of constant composition or \iid codewords. By applying Forney's optimal decoder for individual messages and the message pair for the…
We propose a robust and efficient approach for tripartite-to-bipartite entanglement localization. By using weak measurements and quantum measurement reversal, an almost maximal entangled state shared by two parties can be generated with the…
The most useful measure of a bipartite entanglement is the von Neumann entropy of either of the reduced density matrices. For a particular class of continuous-variable states, the Gaussian states, the entropy of entanglement can be…
An optimal local conversion strategy between any two pure states of a bipartite system is presented. It is optimal in that the probability of success is the largest achievable if the parties which share the system, and which can communicate…
We study the problem of transforming a tripartite pure state to a bipartite one using stochastic local operations and classical communication (SLOCC). It is known that the tripartite-to-bipartite SLOCC convertibility is characterized by the…
The study of transformations among pure states via Local Operations assisted by Classical Communication (LOCC) plays a central role in entanglement theory. The main emphasis of these investigations is on the deterministic, or probabilistic…
Compared with entanglement with multiple types of noise, entanglement including only one type of error is a favorable fundamental resource not only for quantum communication but also for distributed quantum computation. We consider protocol…
The trade-offs between error probabilities in quantum hypothesis testing are by now well-understood in the centralized setting, but much less is known for distributed settings. Here, we study a distributed binary hypothesis testing problem…
In the problem of asymptotic binary i.i.d. state discrimination, the optimal asymptotics of the type I and the type II error probabilities is in general an exponential decrease to zero as a function of the number of samples; the set of…
We consider bipartite quantum state discrimination using positive-partial-transpose measurements and show that minimum-error discrimination by positive-partial-transpose measurements is closely related to entanglement witness. By using the…
Historically, the focus in entanglement distillation has predominantly been on the distillable entanglement, and the framework assumes complete knowledge of the initial state. In this paper, we study the reliability function of entanglement…
Calculating the von Neumann entanglement entropy from experimental data is challenging due to its dependence on the complete wavefunction, forcing reliance on approximations such as classical mutual information (MI). We propose a machine…
In this note, I define error exponents and strong converse exponents for the tasks of distinguishability distillation and dilution. These are counterparts to the one-shot distillable distinguishability and the one-shot distinguishability…
Discrete-variable (DV) entanglement is crucial for numerous quantum applications, yet its deterministic generation in many bosonic systems remains experimentally challenging. In contrast, continuous-variable (CV) entanglement can be…
For a discrete memoryless channel with finite input and output alphabets, we prove convergence of a parametric family of iterative computations of the optimal correct-decoding exponent. The exponent, as a function of communication rate, is…
A convergent iterative procedure is proposed for the calculation of the relative entropy of entanglement of a given bipartite quantum state. When this state turns out to be non-separable the algorithm provides the corresponding optimal…