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:2506.06089 · Physical Review A

Optimizing entanglement distribution via noisy quantum channels

Piotr Masajada, Marco Fellous-Asiani, Alexander Streltsov

Published Apr 7, 2026• 4 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1103/hdzn-fwpj

Related papers

Entanglement distribution via noisy quantum channels

Wang Qiong, Mei-Yuan Tan, Yun Liu +1 more

We investigate the change of entanglement for distributing an arbitrarily entangled two-qubit pure state via three typical kinds of noisy quantum channels—amplitude damping, phase damping and depolarizing quantum channels. We find that for one-qubit transmission, the output distant entanglement (measured by concurrence) reduces proportionately with respect to its initial amount, and the entanglement-decay ratio is determined only by the noisy characteristics of quantum channels. For two-qubit transmission, the rule of the entanglement change is complex. For phase damping quantum channels, the four Bell states and are all the optimal entanglement-distribution (OED) input states. But for amplitude damping quantum channels, only |ψ ± ⟩ are the OED input. For depolarizing quantum channels, and in the case of symmetrical quantum channels, the four Bell states are still the OED input. We also discuss the problem of entanglement sudden death (ESD) and find that for all the three types of quantum channels, ESD can be found.

Journal of Physics B Atomic Molecular and Optical Physics•Jun 1, 2009•21 citations

Progress towards a unified approach to entanglement distribution

Alexander Streltsov, Remigiusz Augusiak, Maciej Demianowicz +1 more

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.

arXiv:1412.5885•Physical Review A•Jul 30, 2015•18 citations

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

Semidefinite optimization for quantum information

Xin Wang

This thesis aims to improve our understanding of the structure of quantum entanglement and the limits of information processing with quantum systems. It presents new results relevant to three threads of quantum information: the theory of quantum entanglement, the communication capabilities of quantum channels, and the quantum zero-error information theory. \nIn the first part, we investigate the fundamental features of quantum entanglement and develop quantitative approaches to better exploit the power of entanglement. First, we introduce a computable and additive entanglement measure to quantify the amount of entanglement, which also plays an important role as the improved semidefinite programming (SDP) upper bound of distillable entanglement. Second, we show that the Rains bound is neither additive nor equal to the asymptotic relative entropy of entanglement. Third, we establish SDP lower bounds for the entanglement cost and demonstrate the irreversibility of asymptotic entanglement manipulation under positive-partial-transpose-preserving quantum operations, resolving a major open problem in quantum information theory. \nIn the second part, we develop a framework of semidefinite programs to evaluate the classical and quantum communication capabilities of quantum channels in both the non-asymptotic and asymptotic regimes. In particular, we establish the first general SDP strong converse bound on the classical capacity of an arbitrary quantum channel and give in particular the best known upper bound on the classical capacity of the amplitude damping channel. We further establish a finite resource analysis of classical communication over quantum erasure channels, including the first second-order expansion of classical capacity beyond entanglement-breaking channels. For quantum communication, we establish the best SDP-computable strong converse bound and refine it as the so-called max-Rains information. \nIn the third part, we investigate the quantum zero-error information theory. In contrast to the conventional Shannon theory, there is a very different-looking information theory when errors are required to be precisely zero, where the communication problem reduces to the analysis of the so-called confusability graph (noncommutative graph) of a classical channel (quantum channel). We develop an activated communication model and explore its novel properties. Notably, we separate the quantum Lovász number and the entanglement-assisted zero-error capacity, resolving an intriguing open problem in the area of zero-error information.

•Jan 1, 2018•7 citations

Optimizing Entanglement Distribution and Quantum Source Placement in Probabilistic Quantum Networks

S. N. Singh, Adhishek Kr. Mishra, Rajesh Singh

A probability-based optimization model of entanglement distribution and quantum source positioning on quantum communication networks. The overall probabilistic model is derived first to include the overall effect of fiber attenuation, depolarizing noise, dephasing effects, loss of photon generation in the qubit generation, and imperfections in teleportation on successful qubit reception. According to this model, a mixed-integer non-linear programming model is formulated, which simultaneously optimizes the placement of quantum sources and equitable photon-pair scheduling of nodepairs. In order to work around the non-convexity, a structured solution method based on a combination of Block Coordinate Descent, Karush-Kuhn-Tucker conditions and Successive Convex Approximation is suggested. The simulation outcomes show that centroid-based placement is only adequate when dealing with small-scale networks but probability-based optimal positioning effectively enhances entanglement throughput in larger deployments especially in higher attenuation and dephasing environments. The results offer theoretical and practical information to be used in scalable and reliability-conscious development of next-generation quantum communication infrastructures.

IEEE International Conference on Computing, Power and Communication Technologies (IC2PCT)•May 15, 2026•0 citations

Quantum communication via noisy channels

Z. Shadman

Quantum communication is at the heart of the quantum information theory. We study two types of quantum communication protocols over noisy transmission channels, i.e. super dense coding and cryptography protocols. In the first part of this thesis, for various scenarios, it is discussed how the super dense coding capacity is influenced by noisy quantum channels. The case of memoryless channels as well as those channels with memory which are modelled by uncorrelated and correlated noise, respectively, are considered. Explicitly Pauli channels over arbitrary dimensions are treated and the super dense coding capacity for some resource states is derived. For the qubit depolarizing channel, when noise is uncorrelated, the super dense coding capacity with respect to the input state is also optimized. This illustrates a threshold value of the noise parameter below which the super dense coding capacity is optimized by a maximally entangled initial state, while above the threshold value the super dense coding capacity is optimized by a product state. For Pauli channels, with correlated noise, the case of non unitary encoding is studied and the super dense coding capacity is derived. The first part of this thesis is concluded with an example for multipartite super dense coding. In the second part of the thesis, the problem of optimal eavesdropping on noisy states in quantum key distribution is investigated. The case of the six state protocol, when the signal states are mixed with white noise, is considered. This situation may arise either when Alice deliberately adds noise to the signal states before they leave her lab, or, in a realistic scenario when the eavesdropper (referred to as Eve) is not assumed to replace the noisy quantum channel by a noiseless one. For individual attacks, we find Eve's optimal mutual information with Alice as a function of the quantum bit error rate. Finally, the results illustrate that adding noise on the quantum level can make quantum key distribution more robust against eavesdropping.

•Jan 1, 2011•0 citations
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.
We investigate the change of entanglement for distributing an arbitrarily entangled two-qubit pure state via three typical kinds of noisy quantum channels—amplitude damping, phase damping and depolarizing quantum channels. We find that for one-qubit transmission, the output distant entanglement (measured by concurrence) reduces proportionately with respect to its initial amount, and the entanglement-decay ratio is determined only by the noisy characteristics of quantum channels. For two-qubit transmission, the rule of the entanglement change is complex. For phase damping quantum channels, the four Bell states and are all the optimal entanglement-distribution (OED) input states. But for amplitude damping quantum channels, only |ψ ± ⟩ are the OED input. For depolarizing quantum channels, and in the case of symmetrical quantum channels, the four Bell states are still the OED input. We also discuss the problem of entanglement sudden death (ESD) and find that for all the three types of quantum channels, ESD can be found.
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.
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.
This thesis aims to improve our understanding of the structure of quantum entanglement and the limits of information processing with quantum systems. It presents new results relevant to three threads of quantum information: the theory of quantum entanglement, the communication capabilities of quantum channels, and the quantum zero-error information theory. \nIn the first part, we investigate the fundamental features of quantum entanglement and develop quantitative approaches to better exploit the power of entanglement. First, we introduce a computable and additive entanglement measure to quantify the amount of entanglement, which also plays an important role as the improved semidefinite programming (SDP) upper bound of distillable entanglement. Second, we show that the Rains bound is neither additive nor equal to the asymptotic relative entropy of entanglement. Third, we establish SDP lower bounds for the entanglement cost and demonstrate the irreversibility of asymptotic entanglement manipulation under positive-partial-transpose-preserving quantum operations, resolving a major open problem in quantum information theory. \nIn the second part, we develop a framework of semidefinite programs to evaluate the classical and quantum communication capabilities of quantum channels in both the non-asymptotic and asymptotic regimes. In particular, we establish the first general SDP strong converse bound on the classical capacity of an arbitrary quantum channel and give in particular the best known upper bound on the classical capacity of the amplitude damping channel. We further establish a finite resource analysis of classical communication over quantum erasure channels, including the first second-order expansion of classical capacity beyond entanglement-breaking channels. For quantum communication, we establish the best SDP-computable strong converse bound and refine it as the so-called max-Rains information. \nIn the third part, we investigate the quantum zero-error information theory. In contrast to the conventional Shannon theory, there is a very different-looking information theory when errors are required to be precisely zero, where the communication problem reduces to the analysis of the so-called confusability graph (noncommutative graph) of a classical channel (quantum channel). We develop an activated communication model and explore its novel properties. Notably, we separate the quantum Lovász number and the entanglement-assisted zero-error capacity, resolving an intriguing open problem in the area of zero-error information.
A probability-based optimization model of entanglement distribution and quantum source positioning on quantum communication networks. The overall probabilistic model is derived first to include the overall effect of fiber attenuation, depolarizing noise, dephasing effects, loss of photon generation in the qubit generation, and imperfections in teleportation on successful qubit reception. According to this model, a mixed-integer non-linear programming model is formulated, which simultaneously optimizes the placement of quantum sources and equitable photon-pair scheduling of nodepairs. In order to work around the non-convexity, a structured solution method based on a combination of Block Coordinate Descent, Karush-Kuhn-Tucker conditions and Successive Convex Approximation is suggested. The simulation outcomes show that centroid-based placement is only adequate when dealing with small-scale networks but probability-based optimal positioning effectively enhances entanglement throughput in larger deployments especially in higher attenuation and dephasing environments. The results offer theoretical and practical information to be used in scalable and reliability-conscious development of next-generation quantum communication infrastructures.
Quantum communication is at the heart of the quantum information theory. We study two types of quantum communication protocols over noisy transmission channels, i.e. super dense coding and cryptography protocols. In the first part of this thesis, for various scenarios, it is discussed how the super dense coding capacity is influenced by noisy quantum channels. The case of memoryless channels as well as those channels with memory which are modelled by uncorrelated and correlated noise, respectively, are considered. Explicitly Pauli channels over arbitrary dimensions are treated and the super dense coding capacity for some resource states is derived. For the qubit depolarizing channel, when noise is uncorrelated, the super dense coding capacity with respect to the input state is also optimized. This illustrates a threshold value of the noise parameter below which the super dense coding capacity is optimized by a maximally entangled initial state, while above the threshold value the super dense coding capacity is optimized by a product state. For Pauli channels, with correlated noise, the case of non unitary encoding is studied and the super dense coding capacity is derived. The first part of this thesis is concluded with an example for multipartite super dense coding. In the second part of the thesis, the problem of optimal eavesdropping on noisy states in quantum key distribution is investigated. The case of the six state protocol, when the signal states are mixed with white noise, is considered. This situation may arise either when Alice deliberately adds noise to the signal states before they leave her lab, or, in a realistic scenario when the eavesdropper (referred to as Eve) is not assumed to replace the noisy quantum channel by a noiseless one. For individual attacks, we find Eve's optimal mutual information with Alice as a function of the quantum bit error rate. Finally, the results illustrate that adding noise on the quantum level can make quantum key distribution more robust against eavesdropping.