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

A scalable entanglement distribution framework for hybrid quantum networks

Yaqi Zhao, Kan He, Jinchuan Hou, Yongtao Zhang, Nicolò Lo Piparo, Xiangyi Meng

quant-phSubmitted Sep 22, 2026• Announced Sep 23, 2026• 0 citations• Revised Oct 30, 2026 (v2)
v1 · Sep 22, 2026v2 · Oct 30, 2026
arXivHTMLPDF

Abstract

The realization of a scalable quantum network (QN) hinges on the efficient distribution of entanglement across heterogeneous hardware platforms. While traditional QN frameworks are often restricted to single-encoding schemes, relying exclusively on either discrete (DV) or continuous (CV) variables, such segregated architectures limit the capacity and interoperability of large-scale systems. Here, we propose a scalable hybrid entanglement distribution scheme that bridges these domains by mapping hybrid entanglement swapping and concentration at DV--CV interfaces onto a unified set of series and parallel graph rules. We demonstrate that our hybrid approach exhibits a {potential} performance advantage over traditional point-to-point generation of maximally entangled states, achieving enhanced end-to-end entanglement within series-parallel topologies. These results provide a theoretical foundation for designing resource-efficient, interpretable architectures for the future quantum internet.

AI Summary

The paper studies entanglement distribution in networks combining pure two-qubit DV links and CV two-mode squeezed vacuum links. It proposes recursively reducing homogeneous subgraphs using existing deterministic series/parallel rules, then processing the remaining DV–CV interfaces with majorization-based LOCC. For series connections, each CV resource with squeezing parameter $\chi$ is deterministically converted to a two-qubit state with largest Schmidt coefficient $\eta=\max\{1/2,1-\chi^2\}$, followed by deterministic DV swapping. The output concurrence is the product of elementary concurrences, independent of swapping order, giving singlet conversion probability $p=1-\sqrt{1-c^2}$. For a parallel DV–CV pair, joint concentration gives largest Schmidt coefficient $\zeta=\max\{1/2,\lambda(1-\chi^2)\}$ and $p=2(1-\zeta)$. Majorization and algebraic comparisons establish that these elementary series and parallel protocols perform at least as well as independently converting every link to a singlet. The rules are assembled recursively for series-parallel networks. For a double-link honeycomb lattice, finite-size Monte Carlo calculations and infinite-lattice percolation thresholds show no advantage from the proposed deterministic-swapping preprocessing. An alternative conditional Bell-measurement protocol can outperform the benchmark near specified threshold parameters, but direct exact chain analysis can require tracking up to $2^N$ conditional branches. The framework assumes pure resources and ideal operations; it does not establish global optimality or an optimal reduction order. Loss and noise are treated only through approximate effective pure-state parameters. Illustrative attenuation calculations omit postselection success probabilities, and realistic mixed-state, rate, memory and hardware models remain outside the analysis.

Some signs of AI-generated textIncrementalMissing comparisonStrong assumptionsOverclaims

Error found: The homogeneous-first framework need not outperform PSC on the original network: a CV(χ=0.8)–CV(χ=0.8)–DV-singlet chain has original-network PSC probability 1 but yields SCP 0.8192 under the proposed preprocessing and distribution rules.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Related papers

Hybrid CV-DV Quantum Communications and Quantum Networks

Ivan B. Djordjević

Quantum information processing (QIP) opens new opportunities for high-performance computing, high-precision sensing, and secure communications. Among various QIP features, the entanglement is a unique one. To take full advantage of quantum resources, it will be necessary to interface quantum systems based on different encodings of information both discrete and continuous. The goal of this paper is to lay the groundwork for the development of a robust and efficient hybrid continuous variable-discrete variable (CV-DV) quantum network, enabling the distribution of a large number of entangled states over hybrid DV-CV multi-hop nodes in an arbitrary topology. The proposed hybrid quantum communication network (QCN) can serve as the backbone for a future quantum Internet, thus providing extensive long-term impacts on the economy and national security through QIP, distributed quantum computing, quantum networking, and distributed quantum sensing. By employing the photon addition and photon subtraction modules we describe how to generate the hybrid DV-CV entangled states and how to implement their teleportation and entanglement swapping through entangling measurements. We then describe how to extend the transmission distance between nodes in hybrid QCN by employing macroscopic light states, noiseless amplification, and reconfigurable quantum LDPC coding. We further describe how to enable quantum networking and distributed quantum computing by employing the deterministic cluster state concept introduced here. Finally, we describe how the proposed hybrid CV-DV states can be used in an entanglement-based hybrid QKD.

IEEE Access•Jan 1, 2022•21 citations

A Quantum Overlay Network for Efficient Entanglement Distribution

Shahrooz Pouryousef, Nitish K. Panigrahy, Don Towsley

Distributing quantum entanglements over long distances is essential for the realization of a global scale quantum Internet. Most of the prior work and proposals assume an on-demand distribution of entanglements which may result in significant network resource under-utilization. In this work, we introduce Quantum Overlay Networks (QONs) for efficient entanglement distribution in quantum networks. When the demand to create end-to-end user entanglements is low, QONs can generate and store maximally entangled Bell pairs (EPR pairs) at specific overlay storage nodes of the network. Later, during peak demands, requests can be served by performing entanglement swaps either over a direct path from the network or over a path using the storage nodes. We solve the link entanglement and storage resource allocation problem in such a QON using a centralized optimization framework. We evaluate the performance of our proposed QON architecture over a wide number of network topologies under various settings using extensive simulation experiments. Our results demonstrate that QONs fare well by a factor of 40% with respect to meeting surge and changing demands compared to traditional non-overlay proposals. QONs also show significant improvement in terms of average entanglement request service delay over non-overlay approaches.

arXiv:2212.01694•IEEE Conference on Computer Communications (INFOCOM)•May 17, 2023•40 citations

Connecting heterogeneous quantum networks by hybrid entanglement swapping

Giovanni Guccione, Tom Darras, Hanna Le Jeannic +4 more

Recent advances in quantum technologies are rapidly stimulating the building of quantum networks. With the parallel development of multiple physical platforms and different types of encodings, a challenge for present and future networks is to uphold a heterogeneous structure for full functionality and therefore support modular systems that are not necessarily compatible with one another. Central to this endeavor is the capability to distribute and interconnect optical entangled states relying on different discrete and continuous quantum variables. Here, we report an entanglement swapping protocol connecting such entangled states. We generate single-photon entanglement and hybrid entanglement between particle- and wave-like optical qubits and then demonstrate the heralded creation of hybrid entanglement at a distance by using a specific Bell-state measurement. This ability opens up the prospect of connecting heterogeneous nodes of a network, with the promise of increased integration and novel functionalities.

arXiv:2003.11041•Science Advances•May 29, 2020•103 citations

Deterministic entanglement distribution on series-parallel quantum networks

Xiangyi Meng, Yulong Cui, Jianxi Gao +2 more

The performance of distributing entanglement between two distant nodes in a large-scale quantum network (QN) of partially entangled bipartite pure states is generally benchmarked against the classical entanglement percolation (CEP) scheme. Improvements beyond CEP were only achieved by nonscalable strategies for restricted QN topologies. This paper explores and amplifies a new and more effective mapping of a QN, referred to as concurrence percolation theory (ConPT), that suggests using deterministic rather than probabilistic protocols for scalably improving on CEP across arbitrary QN topology. More precisely, we implement ConPT via a deterministic entanglement transmission (DET) scheme that is fully analogous to resistor network analysis, with the corresponding series and parallel rules represented by deterministic entanglement swapping and concentration protocols, respectively. The main contribution of this paper is to establish a powerful mathematical framework, which is applicable to arbitrary $d$-dimensional information carriers (qudits), that provides different natural optimality metrics in terms of generalized $k$-concurrences (a family of fundamental entanglement measures) for different QN topologies. In particular, we conclude that the introduced DET scheme (a) is optimal over the well-known nested repeater protocol for distilling entanglement from partially entangled qubits and (b) leads to higher success probabilities of obtaining a maximally entangled state than using CEP. The implementation of the DET scheme is experimentally feasible as tested on IBM's quantum computation platform.

arXiv:2110.04981•Physical Review Research•Mar 31, 2023•20 citations

Secure and Efficient Entanglement Distribution Protocols for Near-Term Quantum Internet

Nicholas Skjellum, Mohamed Shaban, Muhammad Ismail

Quantum information technology has the potential to revolutionize computing, communications, and security. To fully realize its potential, quantum processors with millions of qubits are needed, which are still far from being accomplished. Thus, it is important to establish quantum networks to enable distributed quantum computing to leverage existing and near-term quantum processors into more powerful resources. This paper proposes an efficient entanglement distribution protocol for classical-quantum networks with a limited number of quantum links, enabling quantum teleportation in near-term hybrid networks. The proposed protocol uses entanglement swapping and classical network coding to distribute entanglements efficiently while overcoming bottlenecks and minimizing qubit and link usage. Experimental results show that the proposed protocol requires quantum resources that scale linearly with network size, with individual nodes only requiring a fixed number of qubits. For small network sizes of up to three transceiver pairs, the proposed protocol outperforms the benchmark by using 17% fewer qubit resources, achieving 8.8% higher accuracy, and with a 35% faster simulation time. The percentage improvement increases significantly for large network sizes. We also propose a protocol for securing entanglement distribution against malicious entanglements using quantum state encoding through rotation. Our analysis shows that this method requires no communication overhead and reduces the chance of a malicious node retrieving the teleported state to 7.2%. The achieved results point toward a protocol that enables a highly scalable, efficient, and secure near-term quantum Internet.

International Conference on Computer Communications and Networks (ICCCN)•Jul 29, 2024•0 citations

Secure and Efficient Entanglement Distribution Protocol for Near-Term Quantum Internet

Nicholas Skjellum, Shaban, Mohamed, Muhammad Ismail

Quantum information technology has the potential to revolutionize computing, communications, and security. To fully realize its potential, quantum processors with millions of qubits are needed, which is still far from being accomplished. Thus, it is important to establish quantum networks to enable distributed quantum computing to leverage existing and near-term quantum processors into more powerful resources. This paper introduces a protocol to distribute entanglements among quantum devices within classical-quantum networks with limited quantum links, enabling more efficient quantum teleportation in near-term hybrid networks. The proposed protocol uses entanglement swapping to distribute entanglements efficiently in a butterfly network, then classical network coding is applied to enable quantum teleportation while overcoming network bottlenecks and minimizing qubit requirements for individual nodes. Experimental results show that the proposed protocol requires quantum resources that scale linearly with network size, with individual nodes only requiring a fixed number of qubits. For small network sizes of up to three transceiver pairs, the proposed protocol outperforms the benchmark by using 17% fewer qubit resources, achieving 8.8% higher accuracy, and with a 35% faster simulation time. The percentage improvement increases significantly for large network sizes. We also propose a protocol for securing entanglement distribution against malicious entanglements using quantum state encoding through rotation. Our analysis shows that this method requires no communication overhead and reduces the chance of a malicious node retrieving a quantum state to 7.2%. The achieved results point toward a protocol that enables a highly scalable, efficient, and secure near-term quantum Internet.

arXiv:2312.05775•Dec 10, 2023•2 citations
The realization of a scalable quantum network (QN) hinges on the efficient distribution of entanglement across heterogeneous hardware platforms. While traditional QN frameworks are often restricted to single-encoding schemes, relying exclusively on either discrete (DV) or continuous (CV) variables, such segregated architectures limit the capacity and interoperability of large-scale systems. Here, we propose a scalable hybrid entanglement distribution scheme that bridges these domains by mapping hybrid entanglement swapping and concentration at DV--CV interfaces onto a unified set of series and parallel graph rules. We demonstrate that our hybrid approach exhibits a {potential} performance advantage over traditional point-to-point generation of maximally entangled states, achieving enhanced end-to-end entanglement within series-parallel topologies. These results provide a theoretical foundation for designing resource-efficient, interpretable architectures for the future quantum internet.
The paper studies entanglement distribution in networks combining pure two-qubit DV links and CV two-mode squeezed vacuum links. It proposes recursively reducing homogeneous subgraphs using existing deterministic series/parallel rules, then processing the remaining DV–CV interfaces with majorization-based LOCC.
For series connections, each CV resource with squeezing parameter χ\chiχ is deterministically converted to a two-qubit state with largest Schmidt coefficient η=max⁡{1/2,1−χ2}\eta=\max\{1/2,1-\chi^2\}η=max{1/2,1−χ2}, followed by deterministic DV swapping. The output concurrence is the product of elementary concurrences, independent of swapping order, giving singlet conversion probability p=1−1−c2p=1-\sqrt{1-c^2}p=1−1−c2​. For a parallel DV–CV pair, joint concentration gives largest Schmidt coefficient ζ=max⁡{1/2,λ(1−χ2)}\zeta=\max\{1/2,\lambda(1-\chi^2)\}ζ=max{1/2,λ(1−χ2)} and p=2(1−ζ)p=2(1-\zeta)p=2(1−ζ). Majorization and algebraic comparisons establish that these elementary series and parallel protocols perform at least as well as independently converting every link to a singlet. The rules are assembled recursively for series-parallel networks.
For a double-link honeycomb lattice, finite-size Monte Carlo calculations and infinite-lattice percolation thresholds show no advantage from the proposed deterministic-swapping preprocessing. An alternative conditional Bell-measurement protocol can outperform the benchmark near specified threshold parameters, but direct exact chain analysis can require tracking up to 2N2^N2N conditional branches.
The framework assumes pure resources and ideal operations; it does not establish global optimality or an optimal reduction order. Loss and noise are treated only through approximate effective pure-state parameters. Illustrative attenuation calculations omit postselection success probabilities, and realistic mixed-state, rate, memory and hardware models remain outside the analysis.
Quantum information processing (QIP) opens new opportunities for high-performance computing, high-precision sensing, and secure communications. Among various QIP features, the entanglement is a unique one. To take full advantage of quantum resources, it will be necessary to interface quantum systems based on different encodings of information both discrete and continuous. The goal of this paper is to lay the groundwork for the development of a robust and efficient hybrid continuous variable-discrete variable (CV-DV) quantum network, enabling the distribution of a large number of entangled states over hybrid DV-CV multi-hop nodes in an arbitrary topology. The proposed hybrid quantum communication network (QCN) can serve as the backbone for a future quantum Internet, thus providing extensive long-term impacts on the economy and national security through QIP, distributed quantum computing, quantum networking, and distributed quantum sensing. By employing the photon addition and photon subtraction modules we describe how to generate the hybrid DV-CV entangled states and how to implement their teleportation and entanglement swapping through entangling measurements. We then describe how to extend the transmission distance between nodes in hybrid QCN by employing macroscopic light states, noiseless amplification, and reconfigurable quantum LDPC coding. We further describe how to enable quantum networking and distributed quantum computing by employing the deterministic cluster state concept introduced here. Finally, we describe how the proposed hybrid CV-DV states can be used in an entanglement-based hybrid QKD.
Distributing quantum entanglements over long distances is essential for the realization of a global scale quantum Internet. Most of the prior work and proposals assume an on-demand distribution of entanglements which may result in significant network resource under-utilization. In this work, we introduce Quantum Overlay Networks (QONs) for efficient entanglement distribution in quantum networks. When the demand to create end-to-end user entanglements is low, QONs can generate and store maximally entangled Bell pairs (EPR pairs) at specific overlay storage nodes of the network. Later, during peak demands, requests can be served by performing entanglement swaps either over a direct path from the network or over a path using the storage nodes. We solve the link entanglement and storage resource allocation problem in such a QON using a centralized optimization framework. We evaluate the performance of our proposed QON architecture over a wide number of network topologies under various settings using extensive simulation experiments. Our results demonstrate that QONs fare well by a factor of 40% with respect to meeting surge and changing demands compared to traditional non-overlay proposals. QONs also show significant improvement in terms of average entanglement request service delay over non-overlay approaches.
Recent advances in quantum technologies are rapidly stimulating the building of quantum networks. With the parallel development of multiple physical platforms and different types of encodings, a challenge for present and future networks is to uphold a heterogeneous structure for full functionality and therefore support modular systems that are not necessarily compatible with one another. Central to this endeavor is the capability to distribute and interconnect optical entangled states relying on different discrete and continuous quantum variables. Here, we report an entanglement swapping protocol connecting such entangled states. We generate single-photon entanglement and hybrid entanglement between particle- and wave-like optical qubits and then demonstrate the heralded creation of hybrid entanglement at a distance by using a specific Bell-state measurement. This ability opens up the prospect of connecting heterogeneous nodes of a network, with the promise of increased integration and novel functionalities.
The performance of distributing entanglement between two distant nodes in a large-scale quantum network (QN) of partially entangled bipartite pure states is generally benchmarked against the classical entanglement percolation (CEP) scheme. Improvements beyond CEP were only achieved by nonscalable strategies for restricted QN topologies. This paper explores and amplifies a new and more effective mapping of a QN, referred to as concurrence percolation theory (ConPT), that suggests using deterministic rather than probabilistic protocols for scalably improving on CEP across arbitrary QN topology. More precisely, we implement ConPT via a deterministic entanglement transmission (DET) scheme that is fully analogous to resistor network analysis, with the corresponding series and parallel rules represented by deterministic entanglement swapping and concentration protocols, respectively. The main contribution of this paper is to establish a powerful mathematical framework, which is applicable to arbitrary ddd-dimensional information carriers (qudits), that provides different natural optimality metrics in terms of generalized kkk-concurrences (a family of fundamental entanglement measures) for different QN topologies. In particular, we conclude that the introduced DET scheme (a) is optimal over the well-known nested repeater protocol for distilling entanglement from partially entangled qubits and (b) leads to higher success probabilities of obtaining a maximally entangled state than using CEP. The implementation of the DET scheme is experimentally feasible as tested on IBM's quantum computation platform.
Quantum information technology has the potential to revolutionize computing, communications, and security. To fully realize its potential, quantum processors with millions of qubits are needed, which are still far from being accomplished. Thus, it is important to establish quantum networks to enable distributed quantum computing to leverage existing and near-term quantum processors into more powerful resources. This paper proposes an efficient entanglement distribution protocol for classical-quantum networks with a limited number of quantum links, enabling quantum teleportation in near-term hybrid networks. The proposed protocol uses entanglement swapping and classical network coding to distribute entanglements efficiently while overcoming bottlenecks and minimizing qubit and link usage. Experimental results show that the proposed protocol requires quantum resources that scale linearly with network size, with individual nodes only requiring a fixed number of qubits. For small network sizes of up to three transceiver pairs, the proposed protocol outperforms the benchmark by using 17% fewer qubit resources, achieving 8.8% higher accuracy, and with a 35% faster simulation time. The percentage improvement increases significantly for large network sizes. We also propose a protocol for securing entanglement distribution against malicious entanglements using quantum state encoding through rotation. Our analysis shows that this method requires no communication overhead and reduces the chance of a malicious node retrieving the teleported state to 7.2%. The achieved results point toward a protocol that enables a highly scalable, efficient, and secure near-term quantum Internet.
Quantum information technology has the potential to revolutionize computing, communications, and security. To fully realize its potential, quantum processors with millions of qubits are needed, which is still far from being accomplished. Thus, it is important to establish quantum networks to enable distributed quantum computing to leverage existing and near-term quantum processors into more powerful resources. This paper introduces a protocol to distribute entanglements among quantum devices within classical-quantum networks with limited quantum links, enabling more efficient quantum teleportation in near-term hybrid networks. The proposed protocol uses entanglement swapping to distribute entanglements efficiently in a butterfly network, then classical network coding is applied to enable quantum teleportation while overcoming network bottlenecks and minimizing qubit requirements for individual nodes. Experimental results show that the proposed protocol requires quantum resources that scale linearly with network size, with individual nodes only requiring a fixed number of qubits. For small network sizes of up to three transceiver pairs, the proposed protocol outperforms the benchmark by using 17% fewer qubit resources, achieving 8.8% higher accuracy, and with a 35% faster simulation time. The percentage improvement increases significantly for large network sizes. We also propose a protocol for securing entanglement distribution against malicious entanglements using quantum state encoding through rotation. Our analysis shows that this method requires no communication overhead and reduces the chance of a malicious node retrieving a quantum state to 7.2%. The achieved results point toward a protocol that enables a highly scalable, efficient, and secure near-term quantum Internet.