We classify entanglement distribution protocols based on whether or not entanglement gain is observed with respect to communicated and initial entanglement. We call a protocol nonexcessive if the gain of entanglement is bounded by the communicated entanglement and excessive if it violates this bound. We present examples of excessive protocols that achieve significant gain, independently of the presence of the initial and (or) communicated entanglement. We show that, for certain entanglement measures, excessive entanglement distribution is possible even with pure states, which sheds light on the possibility of formulating a unifying approach to quantifiers of quantum correlations. We point out a ``catalytic'' effect, where a protocol is turned into an excessive one by sending an intermediate particle (which does not change the initial entanglement) in advance of the designated carrier. Finally, we analyze the protocols in noisy scenarios and show that, under suitable conditions, excessive distribution may be the only way to achieve entanglement gain.
We classify entanglement distribution protocols based on whether or not entanglement gain is observed with respect to communicated and initial entanglement. We call a protocol nonexcessive if the gain of entanglement is bounded by the communicated entanglement and excessive if it violates this bound. We present examples of excessive protocols that achieve significant gain, independently of the presence of the initial and (or) communicated entanglement. We show that, for certain entanglement measures, excessive entanglement distribution is possible even with pure states, which sheds light on the possibility of formulating a unifying approach to quantifiers of quantum correlations. We point out a ``catalytic'' effect, where a protocol is turned into an excessive one by sending an intermediate particle (which does not change the initial entanglement) in advance of the designated carrier. Finally, we analyze the protocols in noisy scenarios and show that, under suitable conditions, excessive distribution may be the only way to achieve entanglement gain.
Entanglement distribution is key to the success of secure communication schemes based on quantum mechanics, and there is a strong need for an ultimate architecture able to overcome the limitations of recent proposals such as those based on entanglement percolation or quantum repeaters. In this work we provide a broad theoretical background for the development of such technologies. In particular, we investigate the question of whether entanglement distribution is more efficient if some amount of entanglement---or some amount of correlations in general---is available prior to the transmission stage of the protocol. We show that in the presence of noise the answer to this question strongly depends on the type of noise and on the way the entanglement is quantified. On the one hand, subadditive entanglement measures do not show an advantage of preshared correlations if entanglement is established via combinations of single-qubit Pauli channels. On the other hand, based on the superadditivity conjecture of distillable entanglement, we provide evidence that this phenomenon occurs for this measure. These results strongly suggest that sending one half of some pure entangled state down a noisy channel is the best strategy for any subadditive entanglement quantifier, thus paving the way to a unified approach for entanglement distribution which does not depend on the nature of noise. We also provide general bounds for entanglement distribution involving quantum discord and present a counterintuitive phenomenon of the advantage of arbitrarily little entangled states over maximally entangled ones, which may also occur for quantum channels relevant in experiments.
The main focus of this thesis is quantum entanglement and, more specifically, pro- tocols that allow its distribution between distant places. In the last decades, with the rise of attention on quantum technologies, entangle- ment is mostly seen as a resource, that could be exchanged, measured, and ideally stored and used when convenient. However, entanglement is not as stable and cheap as the classical resources. One reason for this is that entanglement between two quantum systems is easily disrupted by the interaction with the environment that surrounds them. The presence of noise is even more significant when we wish to entangle two systems that are very far away, a task that is essential for quantum communication technologies. In this case, what can disrupt the entanglement is not only the noise that the particles experience locally, but also the noise in the quantum channel during the communication process, which can be significant over long distances. For this reason, it is important to design distribution protocols that work well in such conditions. In 2003, Cubitt et al. showed the existence of a very curious class of protocols, often called entanglement distribution with separable states (EDSS). They proved that a non-entangled (separable) carrier can be used to increase, or even gener- ate entanglement between two already distant parties. From this, some questions arise. First, what limits or allows an entanglement distribution protocol, if not the entanglement that is sent. Quantum discord was shown to be a necessary, but not sufficient, resource for entanglement distribution. Another natural question is whether these protocols can beat others, for technological purposes, especially in noisy conditions. I will describe some work I have done in an attempt to partially 9 address both of these questions. After introducing various tools and concepts that are useful to understand this topic (chapter 1) and motivate the necessity of entanglement distribution in quantum communication (chapter 2), I will describe a proof-of-principle experiment demon- strating EDSS schemes (chapter 3). Later (chapter 4), I will introduce a more general classification of distribution protocols (excessive or non-excessive protocols), based on whether the entanglement gain is larger than the one that is communicated, describing specific examples and general properties of such protocols. I will then partially address the problem regarding the robustness to the noise of communica- tion protocols (chapter 5). Finally, in chapter 6, I will describe how entanglement of a bipartite state can grow with a quantum measurement with unknown results. I discuss the properties of the measurement and of the initial state that make this process effective.
The key requirement for quantum networking is the distribution of entanglement between nodes. Surprisingly, entanglement can be generated across a network without direct transfer-or communication-of entanglement. In contrast to information gain, which cannot exceed the communicated information, the entanglement gain is bounded by the communicated quantum discord, a more general measure of quantum correlation that includes but is not limited to entanglement. Here, we experimentally entangle two communicating parties sharing three initially separable photonic qubits by exchange of a carrier photon that is unentangled with either party at all times. We show that distributing entanglement with separable carriers is resilient to noise and in some cases becomes the only way of distributing entanglement through noisy environments.
Catalysis refers to the possibility of performing an otherwise impossible local state transformation by sharing an additional state, i.e. a catalyst, which is returned at the end of the protocol. There is a stronger version, known as supercatalysis, in which the borrowed catalyst is returned in an enhanced form, i.e. more entangled. However, this phenomenon has remained little explored. In this work we introduce the supercatalytic entanglement gain as a figure of merit taking values in [0,1] that quantifies the performance of the protocol (with 0 corresponding to the standard case of catalysis and 1 representing the maximal possible gain) and we study in which cases it can be greater than zero and which strategies can maximize it. While it turns out that every catalytic transformation can be implemented in a supercatalytic fashion with entanglement gain equal to 1 if the state that is borrowed is chosen appropriately, other choices can make the gain strictly less than 1 and even 0. In fact, we prove that a large class of catalytic transformations are not fully supercatalyzable, i.e. there is at least one choice of catalyst for which the entanglement gain vanishes. On the other hand, the construction that shows that supercatalysis is always possible with maximal gain uses artificially highly entangled catalysts. For this reason, we also study minimal supercatalysis, where the entanglement content of the borrowed state is constrained in a precise and natural way. While we consider a scenario where we prove it is impossible to have entanglement gain equal to 1 in this case, we show that there exist minimal supercatalytic transformations with gain as close to 1 as desired. We also explore several examples and observe that, although choosing a catalyst with the least possible entanglement is often an optimal strategy for minimal supercatalysis, this is not necessarily always the case.
The ability to distribute quantum entanglement is a prerequisite for many fundamental tests of quantum theory and numerous quantum information protocols. Two distant parties can increase the amount of entanglement between them by means of quantum communication encoded in a carrier that is sent from one party to the other. Intriguingly, entanglement can be increased even when the exchanged carrier is not entangled with the parties. However, in light of the defining property of entanglement stating that it cannot increase under classical communication, the carrier must be quantum. Here we show that, in general, the increase of relative entropy of entanglement between two remote parties is bounded by the amount of nonclassical correlations of the carrier with the parties as quantified by the relative entropy of discord. We study implications of this bound, provide new examples of entanglement distribution via unentangled states, and put further limits on this phenomenon.
Entanglement distribution is a crucial problem in quantum information science, owing to the essential role that entanglement plays in enabling advanced quantum protocols, including quantum teleportation and quantum cryptography. We investigate strategies for distributing quantum entanglement between two distant parties through noisy quantum channels. Specifically, we compare two configurations: one where the entanglement source is placed at the midpoint of the communication line, and another where it is located at one end. For certain families of qubit channels we show analytically that the midpoint strategy is optimal. Based on extensive numerical analysis, we conjecture that this strategy is generally optimal for all qubit channels. Focusing on the midpoint configuration, we develop semidefinite programming (SDP) techniques to assess whether entanglement can be successfully distributed through the network, and to quantify the amount of entanglement that can be distributed in the process. In many relevant cases the SDP formulation reliably captures the maximal amount of entanglement which can be distributed, if entanglement is quantified using the negativity. We analyze several channel models and demonstrate that, for various combinations of amplitude damping and depolarizing noise, entanglement distribution is only possible with weakly entangled input states. Excessive entanglement in the input state can hinder the channel's ability to establish entanglement. Our findings have implications for optimizing entanglement distribution in realistic quantum communication networks.