Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1203.1264 · Physical Review Letters

Quantum Cost for Sending Entanglement

Alexander Streltsov, Hermann Kampermann, Dagmar Bruß

Published Jun 18, 2012• 162 citations
arXivHTMLPDF

Abstract

Establishing quantum entanglement between two distant parties is an essential step of many protocols in quantum information processing. One possibility for providing long-distance entanglement is to create an entangled composite state within a lab and then physically send one subsystem to a distant lab. However, is this the "cheapest" way? Here, we investigate the minimal "cost" that is necessary for establishing a certain amount of entanglement between two distant parties. We prove that this cost is intrinsically quantum, and is specified by quantum correlations. Our results provide an optimal protocol for entanglement distribution and show that quantum correlations are the essential resource for this task.

DOI
10.1103/physrevlett.108.250501

Related papers

Entanglement assisted quantum communication protocols

Amélie Piveteau

Quantum entanglement plays a central role in many quantum communication protocols. It allows distant particles to share correlations beyond the limits of classical interactions. Entanglement is essential for superdense coding, quantum teleportation, and secure cryptographic key distribution in quantum communication. It is also a pillar for developing quantum networks, where the management and distribution of entanglement are crucial for connecting distant nodes. Although perfect entanglement is a sought-after ideal, experimental imperatives, including entanglement distribution over long distances, often limit the quality of entangled states. An important question is whether weaker entanglement still offers advantages. First, we study more general tasks than dense coding to show that simpler measurements, combined with entanglement, allow advantageous and sometimes even optimal qubit communication protocols to be obtained. We also demonstrate that simple measurements can generate quantum correlations that cannot be modelled by two classical communication bits and can constitute an optimal protocol with quantum resources. We implement a novel Bell-type inequality tailored for certifying full network non-locality (FNN) to develop certification methods guaranteeing security on an entanglement-based network. Our experiment uses two pairs of polarised entangled photons in a network configuration with three nodes, briefly referred to as a bilocal network scenario. Finally, we show that weakly entangled states can improve communication over a qubit channel using only separate (local) measurements on isotropic non-steerable two-qubit states, without interference, of individual photons, across two communication tasks: secret sharing and its stochastic variant.

•Jan 1, 2026•0 citations

Cost of Quantum Entanglement Simplified

Xin Wang, Mark M. Wilde

Quantum entanglement is a key physical resource in quantum information processing that allows for performing basic quantum tasks such as teleportation and quantum key distribution, which are impossible in the classical world. Ever since the rise of quantum information theory, it has been an open problem to quantify entanglement in an information-theoretically meaningful way. In particular, every previously defined entanglement measure bearing a precise information-theoretic meaning is not known to be efficiently computable, or if it is efficiently computable, then it is not known to have a precise information-theoretic meaning. In this Letter, we meet this challenge by introducing an entanglement measure that has a precise information-theoretic meaning as the exact cost required to prepare an entangled state when two distant parties are allowed to perform quantum operations that completely preserve the positivity of the partial transpose. Additionally, this entanglement measure is efficiently computable by means of a semidefinite program, and it bears a number of useful properties such as additivity and faithfulness. Our results bring key insights into the fundamental entanglement structure of arbitrary quantum states, and they can be used directly to assess and quantify the entanglement produced in quantum-physical experiments.

arXiv:2007.14270•Physical Review Letters•Jul 24, 2020•63 citations

ENTANGLEMENT PERCOLATION IN QUANTUM NETWORKS: HOW TO ESTABLISH LARGE DISTANCE QUANTUM CORRELATIONS?

Antonio Acín, Maciej Lewenstein, J. I. Cirac

Quantum communication networks consist of N distant nodes sharing a quantum state. By means of local operation in each node assisted by classical communication, the nodes try to transform the initial state into perfect quantum correlations, that later will be used to perform a quantum information task, such as quantum teleportation or quantum cryptography. Given a network, defined by a geometry of nodes and connections, it is crucial to understand whether it is possible to establish long-distance quantum correlations, in the sense that the correlations between two end points of the network do not decrease exponentially with the number of intermediate connections. In this contribution, we present our recent findings on the distribution of entanglement through quantum networks. In the case of one-dimensional chains of connected quantum systems, the results are hardly surprising: a non-exponential decay is possible only when the entanglement in the connections between nodes is larger than a maximally entangled state of two qubits. The picture becomes much richer and interesting for networks of dimension larger than one: long-distance correlations can be established even when the connecting nodes are not maximally entangled. Actually, the problem of establishing maximally entangled states between nodes is related to classical percolation in statistical mechanics. We show, then, that statistical concepts, such as percolation and phase transitions, can be used to optimize the entanglement distribution through quantum networks. Remarkably, the quantum features allow going beyond the known results for classical percolation, giving rise to a new type of critical phenomenon that we call entanglement percolation.

Recent Progress in Many-Body Theories•Jun 1, 2008•0 citations

Generating remote entanglement via disentangling operations

Jennifer R. Glick, Christoph Adami

Shared entanglement between spatially separated systems is an essential resource for quantum information processing including long-distance quantum cryptography and teleportation. While purification protocols for mixed distributed entangled quantum states exist, it is not clear how to optimally distribute entanglement to remote locations. Here, we describe a deterministic protocol for generating a maximally entangled state between remote locations that only uses local operations on qubits, and requires no classical communication between the separated parties. The procedure may provide protection from decoherence before the entanglement is "activated," and could be useful for quantum key distribution.

arXiv:1708.08491•Aug 28, 2017•1 citation

Quantum state redistribution with local coherence

Anurag Anshu, Rahul Jain, Alexander Streltsov

Quantum entanglement and coherence are two fundamental resources for quantum information processing. Recent results clearly demonstrate their relevance in quantum technological tasks, including quantum communication and quantum algorithms. In this Letter we study the role of quantum coherence for quantum state redistribution, a fundamental task where two parties aim to relocate a quantum particle by using a limited amount of quantum communication and shared entanglement. We provide general bounds for the resource rates required for this process, and show that these bounds are tight under additional reasonable constraints, including the situation where the receiving party cannot use local coherence. While entanglement cannot be directly converted into local coherence in our setting, we show that entanglement is still useful for local coherence creation if an additional quantum channel is provided, and the optimal protocol for local coherence creation for any given amount of quantum communication and shared entanglement is presented. We also discuss possible extensions of our methods to other scenarios where the receiving party is limited by local constraints, including theories of thermodynamics and asymmetry.

arXiv:1804.04915•Apr 13, 2018•16 citations

Entanglement distribution

Margherita Zuppardo

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.

•Jan 1, 2017•0 citations
Establishing quantum entanglement between two distant parties is an essential step of many protocols in quantum information processing. One possibility for providing long-distance entanglement is to create an entangled composite state within a lab and then physically send one subsystem to a distant lab. However, is this the "cheapest" way? Here, we investigate the minimal "cost" that is necessary for establishing a certain amount of entanglement between two distant parties. We prove that this cost is intrinsically quantum, and is specified by quantum correlations. Our results provide an optimal protocol for entanglement distribution and show that quantum correlations are the essential resource for this task.
Quantum entanglement plays a central role in many quantum communication protocols. It allows distant particles to share correlations beyond the limits of classical interactions. Entanglement is essential for superdense coding, quantum teleportation, and secure cryptographic key distribution in quantum communication. It is also a pillar for developing quantum networks, where the management and distribution of entanglement are crucial for connecting distant nodes. Although perfect entanglement is a sought-after ideal, experimental imperatives, including entanglement distribution over long distances, often limit the quality of entangled states. An important question is whether weaker entanglement still offers advantages. First, we study more general tasks than dense coding to show that simpler measurements, combined with entanglement, allow advantageous and sometimes even optimal qubit communication protocols to be obtained. We also demonstrate that simple measurements can generate quantum correlations that cannot be modelled by two classical communication bits and can constitute an optimal protocol with quantum resources. We implement a novel Bell-type inequality tailored for certifying full network non-locality (FNN) to develop certification methods guaranteeing security on an entanglement-based network. Our experiment uses two pairs of polarised entangled photons in a network configuration with three nodes, briefly referred to as a bilocal network scenario. Finally, we show that weakly entangled states can improve communication over a qubit channel using only separate (local) measurements on isotropic non-steerable two-qubit states, without interference, of individual photons, across two communication tasks: secret sharing and its stochastic variant.
Quantum entanglement is a key physical resource in quantum information processing that allows for performing basic quantum tasks such as teleportation and quantum key distribution, which are impossible in the classical world. Ever since the rise of quantum information theory, it has been an open problem to quantify entanglement in an information-theoretically meaningful way. In particular, every previously defined entanglement measure bearing a precise information-theoretic meaning is not known to be efficiently computable, or if it is efficiently computable, then it is not known to have a precise information-theoretic meaning. In this Letter, we meet this challenge by introducing an entanglement measure that has a precise information-theoretic meaning as the exact cost required to prepare an entangled state when two distant parties are allowed to perform quantum operations that completely preserve the positivity of the partial transpose. Additionally, this entanglement measure is efficiently computable by means of a semidefinite program, and it bears a number of useful properties such as additivity and faithfulness. Our results bring key insights into the fundamental entanglement structure of arbitrary quantum states, and they can be used directly to assess and quantify the entanglement produced in quantum-physical experiments.
Quantum communication networks consist of N distant nodes sharing a quantum state. By means of local operation in each node assisted by classical communication, the nodes try to transform the initial state into perfect quantum correlations, that later will be used to perform a quantum information task, such as quantum teleportation or quantum cryptography. Given a network, defined by a geometry of nodes and connections, it is crucial to understand whether it is possible to establish long-distance quantum correlations, in the sense that the correlations between two end points of the network do not decrease exponentially with the number of intermediate connections. In this contribution, we present our recent findings on the distribution of entanglement through quantum networks. In the case of one-dimensional chains of connected quantum systems, the results are hardly surprising: a non-exponential decay is possible only when the entanglement in the connections between nodes is larger than a maximally entangled state of two qubits. The picture becomes much richer and interesting for networks of dimension larger than one: long-distance correlations can be established even when the connecting nodes are not maximally entangled. Actually, the problem of establishing maximally entangled states between nodes is related to classical percolation in statistical mechanics. We show, then, that statistical concepts, such as percolation and phase transitions, can be used to optimize the entanglement distribution through quantum networks. Remarkably, the quantum features allow going beyond the known results for classical percolation, giving rise to a new type of critical phenomenon that we call entanglement percolation.
Shared entanglement between spatially separated systems is an essential resource for quantum information processing including long-distance quantum cryptography and teleportation. While purification protocols for mixed distributed entangled quantum states exist, it is not clear how to optimally distribute entanglement to remote locations. Here, we describe a deterministic protocol for generating a maximally entangled state between remote locations that only uses local operations on qubits, and requires no classical communication between the separated parties. The procedure may provide protection from decoherence before the entanglement is "activated," and could be useful for quantum key distribution.
Quantum entanglement and coherence are two fundamental resources for quantum information processing. Recent results clearly demonstrate their relevance in quantum technological tasks, including quantum communication and quantum algorithms. In this Letter we study the role of quantum coherence for quantum state redistribution, a fundamental task where two parties aim to relocate a quantum particle by using a limited amount of quantum communication and shared entanglement. We provide general bounds for the resource rates required for this process, and show that these bounds are tight under additional reasonable constraints, including the situation where the receiving party cannot use local coherence. While entanglement cannot be directly converted into local coherence in our setting, we show that entanglement is still useful for local coherence creation if an additional quantum channel is provided, and the optimal protocol for local coherence creation for any given amount of quantum communication and shared entanglement is presented. We also discuss possible extensions of our methods to other scenarios where the receiving party is limited by local constraints, including theories of thermodynamics and asymmetry.
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.