Related papers: Entanglement summoning from entanglement sharing
Establishing entanglement between distant parties is one of the most important problems of quantum technology, since long-distance entanglement is an essential part of such fundamental tasks as quantum cryptography or quantum teleportation.…
We study the emergence of bipartite entanglement between a pair of spins weakly connected to the ends of a linear disordered $XY$ spin-1/2 channel. We analyze how their concurrence responds to structural and on-site fluctuations embodied by…
We study the problem of communication over a compound quantum channel in the presence of entanglement. Classically such channels are modeled as a collection of conditional probability distributions wherein neither the sender nor the…
Quantum networks are of high interest nowadays and a quantum internet has been long envisioned. Network-entanglement adapts the notion of entanglement to the network scenario and network-entangled states are considered to be a resource to…
This article presents the basis of a theory of entanglement. We begin with a classical theory of entangled discrete measures in Section~1. Section~2 treats quantum mechanics and discusses the statistics of bounded operators on a Hilbert…
Certain quantum information tasks require entanglement of assistance, namely a reduction of a tripartite entangled state to a bipartite entangled state via local measurements. We establish that 'concurrence of assistance' (CoA) identifies…
The state of a quantum system, consisting of two distinct subsystems, is called separable if it can be prepared by two distant experimenters who receive instructions from a common source, via classical communication channels. A necessary…
Quantum entanglement is at the heart of many tasks in quantum information. Apart from simple cases (low dimensions, few particles, pure states), however, the mathematical structure of entanglement is not yet fully understood. This tutorial…
We present basics of mixed-state entanglement theory. The first part of the article is devoted to mathematical characterizations of entangled states. In second part we discuss the question of using mixed-state entanglement for quantum…
We study under what circumstances a separable bipartite system A-B can or cannot become entangled through local interactions with a bi-local entangled source $\text{S}_1$-$\text{S}_2$. We obtain constraints on the general forms of the…
We demonstrate that a necessary precondition for unconditionally secure quantum key distribution is that sender and receiver can use the available measurement results to prove the presence of entanglement in a quantum state that is…
The ability to teleport entanglement through maximally entangled mixed states as defined by concurrence and linear entropy is studied. We show how the teleported entanglement depends on the quality of the quantum channel used, as defined…
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…
We study a quantum switch that distributes maximally entangled multipartite states to sets of users. The entanglement switching process requires two steps: first, each user attempts to generate bipartite entanglement between itself and the…
Entanglement, one of the clearest manifestations of non-classical physics, holds significant promise for technological applications such as more secure communications and faster computations. In this paper we explore the use of…
The optimal coordination rates are determined in three primary settings of multi-user quantum networks, thus characterizing the minimal resources required in order to simulate a joint quantum state among multiple parties. We study the…
Multipartite entangled states are a fundamental resource for a wide range of quantum information processing tasks. In particular, in quantum networks it is essential for the parties involved to be able to verify if entanglement is present…
This note shows how quantum entanglement may be simulated in classical computing. The simulated entanglement protocol is implemented using oblivious transfer in the simplest case and other many-to-one mappings in more general cases. For the…
Quantum switches are critical components in quantum networks, distributing maximally entangled pairs among end nodes by entanglement swapping. In this work, we design protocols that schedule entanglement swapping operations in quantum…
We demonstrate that quantum entanglement can help separated individuals in making decisions if their goal is to find each other in the absence of any communication between them. We derive a Bell-like inequality that the efficiency of every…