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

Journal of Physics Complexity

Advantage of deterministic entanglement transmission on Gaussian-state quantum networks

Yaqi Zhao, Kan He, Jinchuan Hou, Xiangyi Meng

Published Sep 19, 2025• 1 citation
Publisher

Abstract

Abstract The promising future of the quantum internet hinges on how we scale entanglement distribution on quantum networks (QNs). Classical entanglement percolation (CEP) offers a simple approach for this but is limited by ‘classical’ scaling laws, while deterministic entanglement transmission (DET) leverages the determinacy of quantum protocols to achieve a more effective ‘quantum’ scaling. This advantage is, however, unexplored for Gaussian-state QNs, where the infinite-dimensional, continuous-variable states are often required to be first prepared into qubits or qudits via additional conversions. This overhead raises a question: can DET’s quantum advantage survive in a practical Gaussian-to-qudit conversion process? To answer this, we analyze both DET and CEP across a spectrum of conversion strategies, from best-case theoretical limits to probabilistic, practical projections. We find that DET’s superiority is robust: even a DET scheme burdened by the overhead of practical projective conversions consistently outperforms CEP endowed with theoretically perfect conversion. Our work thus provides a possible roadmap, demonstrating that the quantum-native approach of DET could be the key to unlocking the potential of long-range quantum communication.

DOI
10.1088/2632-072x/ae0971

Related papers

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

Exploring the Percolation Phenomena in Quantum Networks

Chuanxin Wang, Xinqi Hu, Gaogao Dong

Quantum entanglement as a non-local correlation between particles is critical to the transmission of quantum information in quantum networks (QNs); the key challenge lies in establishing long-distance entanglement transmission between distant targets. This issue aligns with percolation theory, and as a result, an entanglement distribution scheme called “Classical Entanglement Percolation” (CEP) has been proposed. While this scheme provides an effective framework, “Quantum Entanglement Percolation” (QEP) indicates a lower percolation threshold through quantum preprocessing strategies, which will modify the network topology. Meanwhile, an emerging statistical theory known as “Concurrence Percolation” reveals the unique advantages of quantum networks, enabling entanglement transmission under lower conditions. It fundamentally belongs to a different universality class from classical percolation. Although these studies have made significant theoretical advancements, most are based on an idealized pure state network model. In practical applications, quantum states are often affected by thermal noise, resulting in mixed states. When these mixed states meet specific conditions, they can be transformed into pure states through quantum operations and further converted into singlets with a certain probability, thereby facilitating entanglement percolation in mixed state networks. This finding greatly broadens the application prospects of quantum networks. This review offers a comprehensive overview of the fundamental theories of quantum percolation and the latest cutting-edge research developments.

Mathematics•Nov 15, 2024•3 citations

Entanglement Percolation in Small-World Quantum Networks

Zhu Shi-Qun

Long-distance entanglement establishment is investigated on small-world complex network topologies.The quantum entanglement percolation(QEP) protocol is proposed to optimize networked quantum communications.If the additional local target-swap quantum operations are performed in the classical entanglement percolation(CEP) protocol,the QEP can be obtained.The QEP has great advantage over CEP with respect to the efficiency of long-distance entanglement establishment.The advantage may be due to the changes of the degree distributions in the QEP.

Acta Sinica Quantum Optica•Jan 1, 2012•0 citations

Harnessing Quantum Entanglement: Comprehensive Strategies for Enhanced Communication and Beyond in Quantum Networks

Amit Kumar Bhuyan, Dutta, Hrishikesh

Quantum communication represents a revolutionary advancement over classical information theory, which leverages unique quantum mechanics properties like entanglement to achieve unprecedented capabilities in secure and efficient information transmission. Unlike bits in classical communication, quantum communication utilizes qubits in superposition states, allowing for novel information storage and processing. Entanglement, a key quantum phenomenon, enables advanced protocols with enhanced security and processing power. This paper provides a comprehensive overview of quantum communication, emphasizing the role of entanglement in theoretical foundations, practical protocols, experimental progress, and security implications. It contrasts quantum communications potential applications with classical networks, identifying areas where entanglement offers significant advantages. The paper explores the fundamentals of quantum mechanics in communication, the physical realization of quantum information, and the formation of secure quantum networks through entanglement-based strategies like Quantum Key Distribution (QKD) and teleportation. It addresses the challenges of long-distance quantum communication, the role of quantum repeaters in scaling networks, and the conceptualization of interconnected quantum networks. Additionally, it discusses strides towards the Quantum Internet, Quantum Error-Correcting codes, and quantum cryptographys role in ensuring secure communication. By highlighting the role of entanglement, this paper aims to inspire further research and innovation in secure and efficient information exchange within quantum networks.

arXiv:2406.08833•Jun 13, 2024•13 citations

Entanglement percolation in random quantum networks

Alessandro Romancino, Jordi Romero-Pallejà, G. Massimo Palma +1 more

Entanglement percolation aims at generating maximal entanglement between any two nodes of a quantum network by utilizing strategies based solely on local operations and classical communication between the nodes. As it happens in classical percolation theory, the topology of the network is crucial, but also the entanglement shared between the nodes of the network. In a network of identically partially entangled states, the network topology determines the minimum entanglement needed for percolation. In this work, we generalize the protocol to scenarios where the initial entanglement shared between any two nodes of the network is not the same but has some randomness. In such cases, we find that for classical entanglement percolation, only the average initial entanglement is relevant. In contrast, the quantum entanglement percolation protocol (within the q-swap framework) degrades under these more realistic conditions as the width of the distribution increases, suggesting that Random CEP may become the optimal LOCC strategy in sufficiently heterogeneous quantum networks.

quant-pharXiv:2602.10189•Quantum Science and Technology•Feb 12, 2026•2 citations

An Operator-Theoretic Model of Entanglement Percolation in Series-Parallel Quantum Networks

Kan He, Jinchuan Hou, Yaqi Zhao

The realization of entanglement distribution (ED) in large-scale quantum networks (QNs), as a fundamental theoretical framework of quantum communication, faces significant challenges. Percolation theory, drawn from statistical physics, has been identified as a potential solution to this problem. Nevertheless, when addressing ED, percolation theory primarily relies on numerical simulations and approximate algorithms. This approach often lacks interpretability and controllability for many phenomena occurring during the ED process in large-scale networks, including emergent phenomena near the threshold. To address these limitations, in this paper, we {focus on} leveraging operator theory to construct a mathematical framework for entanglement percolation in series-parallel QNs. Through the application of operator-theoretic methodologies, we analyze several critical issues within the entanglement percolation process.

quant-pharXiv:2609.26367•Sep 23, 2026•0 citations
Abstract The promising future of the quantum internet hinges on how we scale entanglement distribution on quantum networks (QNs). Classical entanglement percolation (CEP) offers a simple approach for this but is limited by ‘classical’ scaling laws, while deterministic entanglement transmission (DET) leverages the determinacy of quantum protocols to achieve a more effective ‘quantum’ scaling. This advantage is, however, unexplored for Gaussian-state QNs, where the infinite-dimensional, continuous-variable states are often required to be first prepared into qubits or qudits via additional conversions. This overhead raises a question: can DET’s quantum advantage survive in a practical Gaussian-to-qudit conversion process? To answer this, we analyze both DET and CEP across a spectrum of conversion strategies, from best-case theoretical limits to probabilistic, practical projections. We find that DET’s superiority is robust: even a DET scheme burdened by the overhead of practical projective conversions consistently outperforms CEP endowed with theoretically perfect conversion. Our work thus provides a possible roadmap, demonstrating that the quantum-native approach of DET could be the key to unlocking the potential of long-range quantum communication.
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 entanglement as a non-local correlation between particles is critical to the transmission of quantum information in quantum networks (QNs); the key challenge lies in establishing long-distance entanglement transmission between distant targets. This issue aligns with percolation theory, and as a result, an entanglement distribution scheme called “Classical Entanglement Percolation” (CEP) has been proposed. While this scheme provides an effective framework, “Quantum Entanglement Percolation” (QEP) indicates a lower percolation threshold through quantum preprocessing strategies, which will modify the network topology. Meanwhile, an emerging statistical theory known as “Concurrence Percolation” reveals the unique advantages of quantum networks, enabling entanglement transmission under lower conditions. It fundamentally belongs to a different universality class from classical percolation. Although these studies have made significant theoretical advancements, most are based on an idealized pure state network model. In practical applications, quantum states are often affected by thermal noise, resulting in mixed states. When these mixed states meet specific conditions, they can be transformed into pure states through quantum operations and further converted into singlets with a certain probability, thereby facilitating entanglement percolation in mixed state networks. This finding greatly broadens the application prospects of quantum networks. This review offers a comprehensive overview of the fundamental theories of quantum percolation and the latest cutting-edge research developments.
Long-distance entanglement establishment is investigated on small-world complex network topologies.The quantum entanglement percolation(QEP) protocol is proposed to optimize networked quantum communications.If the additional local target-swap quantum operations are performed in the classical entanglement percolation(CEP) protocol,the QEP can be obtained.The QEP has great advantage over CEP with respect to the efficiency of long-distance entanglement establishment.The advantage may be due to the changes of the degree distributions in the QEP.
Quantum communication represents a revolutionary advancement over classical information theory, which leverages unique quantum mechanics properties like entanglement to achieve unprecedented capabilities in secure and efficient information transmission. Unlike bits in classical communication, quantum communication utilizes qubits in superposition states, allowing for novel information storage and processing. Entanglement, a key quantum phenomenon, enables advanced protocols with enhanced security and processing power. This paper provides a comprehensive overview of quantum communication, emphasizing the role of entanglement in theoretical foundations, practical protocols, experimental progress, and security implications. It contrasts quantum communications potential applications with classical networks, identifying areas where entanglement offers significant advantages. The paper explores the fundamentals of quantum mechanics in communication, the physical realization of quantum information, and the formation of secure quantum networks through entanglement-based strategies like Quantum Key Distribution (QKD) and teleportation. It addresses the challenges of long-distance quantum communication, the role of quantum repeaters in scaling networks, and the conceptualization of interconnected quantum networks. Additionally, it discusses strides towards the Quantum Internet, Quantum Error-Correcting codes, and quantum cryptographys role in ensuring secure communication. By highlighting the role of entanglement, this paper aims to inspire further research and innovation in secure and efficient information exchange within quantum networks.
Entanglement percolation aims at generating maximal entanglement between any two nodes of a quantum network by utilizing strategies based solely on local operations and classical communication between the nodes. As it happens in classical percolation theory, the topology of the network is crucial, but also the entanglement shared between the nodes of the network. In a network of identically partially entangled states, the network topology determines the minimum entanglement needed for percolation. In this work, we generalize the protocol to scenarios where the initial entanglement shared between any two nodes of the network is not the same but has some randomness. In such cases, we find that for classical entanglement percolation, only the average initial entanglement is relevant. In contrast, the quantum entanglement percolation protocol (within the q-swap framework) degrades under these more realistic conditions as the width of the distribution increases, suggesting that Random CEP may become the optimal LOCC strategy in sufficiently heterogeneous quantum networks.
The realization of entanglement distribution (ED) in large-scale quantum networks (QNs), as a fundamental theoretical framework of quantum communication, faces significant challenges. Percolation theory, drawn from statistical physics, has been identified as a potential solution to this problem. Nevertheless, when addressing ED, percolation theory primarily relies on numerical simulations and approximate algorithms. This approach often lacks interpretability and controllability for many phenomena occurring during the ED process in large-scale networks, including emergent phenomena near the threshold. To address these limitations, in this paper, we {focus on} leveraging operator theory to construct a mathematical framework for entanglement percolation in series-parallel QNs. Through the application of operator-theoretic methodologies, we analyze several critical issues within the entanglement percolation process.