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

Globecom

Quantum Error Correction Based Entanglement Routing in Socially-Aware Quantum Networks

Shao-Min Huang, Ming-Huang Chien, Ting-Yuan Wen, Qian-Jing Wang, Jian-Jhih Kuo

Published Dec 8, 2024• 1 citation
Publisher

Abstract

Quantum teleportation enables high-security communications via quantum entanglement. However, decoherence, signal decay, and environmental interference may cause imperfect entangled pairs with low fidelity. Such entangled pairs may easily generate errors when used to teleport data qubits and cause fatal computation errors on quantum computers. Fortunately, data qubits can be encoded via quantum error correction (QEC) code to recover the detected error to some extent. Nevertheless, letting any repeaters process data qubits is dangerous because malicious repeaters may peep at, destroy, or fake the data qubits. Thus, in this paper, we propose a novel QEC-enabled routing framework MOON facilitated with the concept of social networks (SNs) for quantum networks (QNs). MOON selects only trusted repeaters to process data qubits and exhibits elastic routing with QEC to maximize the throughput without errors. Last, simulation results show that our framework can outperform existing approaches by up to 34% on network throughput without errors.

DOI
10.1109/globecom52923.2024.10901515

Related papers

Socially-aware Concurrent Entanglement Routing with Path Decomposition in Quantum Networks

Shao-Min Huang, Ming-Huang Chien, Cheng-Yang Cheng +2 more

Quantum teleportation via quantum entanglement enables high-security communications in networks. However, if two quantum nodes are far away, it may be difficult to create an entangled path due to the low success probability. Besides, existing approaches neglect social relations among nodes' owners. In this paper, we propose a new framework SEER to minimize the waiting time of all source-destination (SD) pairs' requests. SEER has two promising features: 1) Social-relation Consideration. SEER makes the first attempt to select trusted owners' nodes via social networks as intermediate nodes for requests to temporarily store data qubits to increase the success probability. 2) Starvation Mitigation. SEER divides long SD pairs and slices resources reasonably to remedy starvation due to their low success probability. To this end, we design RATE and PLAN to find the proper intermediate nodes and reduce the average waiting time. Simulation results manifest SEER outperforms others by 37%.

Globecom•Dec 4, 2022•9 citations

Quantum Network Routing based on Surface Code Error Correction

Tianjie Hu, Jindi Wu, Qun Li

Quantum networks encounter unavoidable channel noises and erasure errors, presenting a huge obstacle in designing protocols that attain both high reliability and efficiency. Typically, quantum networks fall into two categories: those utilize quantum entanglements for quantum teleportation, and those directly transfer the actual quantum messages. In this paper, we present SurfNet, a quantum network that inherits the main advantages from both categories. It employs surface codes as logical qubits for encoding messages, and utilizes two parallel communication channels to fault-tolerantly transfer each surface code in a modular manner. Our approach of using surface codes can timely correct both operational and photon loss errors within the network, and the integration of the two channels within the network can greatly improve network throughput. For the implementation of SurfNet, we propose a novel network architecture, designed to better integrate surface codes into quantum networks. We also propose a novel error correction decoder, designed to fully utilize the modular characteristic of surface codes within our network. Simulation results demonstrate that SurfNet with its decoder significantly enhances the communication fidelity within quantum networks.

quant-pharXiv:2606.12781•IEEE International Conference on Distributed Computing Systems (ICDCS)•Jun 12, 2026•5 citations

Socially-Aware Opportunistic Routing with Path Segment Selection in Quantum Networks

Shao-Min Huang, Cheng-Yang Cheng, Ming-Huang Chien +3 more

The conventional quantum teleportation schemes enable high-security network communications by establishing end-to-end entangled paths. However, those schemes focus on time synchronization and thus cause lots of idle time. Recent research suggests adopting an opportunistic scheme to forward data qubits as far as it can. However, this scheme lacks security since data qubits may be stored at malicious repeaters, which may peek at, destroy, or fake the data qubits. To this end, we design a new scheme called SOAR that considers trusted repeaters via social networks. Moreover, SOAR promotes the parallelism of swapping processes and thus leads to a less idle time of network resources than the other existing schemes. Furthermore, we design an algorithm called SAGE that can best fit SOAR by linking multiple subpaths via appropriate trusted repeaters to get an ideal path and augmenting least-hop paths to utilize the resources in quantum networks better. Simulation results manifest that SOAR outperforms the other schemes by 54%-89%; SAGE outperforms the other routing algorithms by 50% on average on SOAR.

Globecom•Dec 4, 2023•2 citations

Scheduling Compact Error Correcting Codes in Entanglement Distribution Networks

Keith Kenemer, Michelle Chalupnik, Michelle Fernandez +2 more

A fundamental challenge in generating and distributing high-fidelity entanglement in quantum repeater networks is the management and suppression of quantum errors. In this work, we develop an approach for extending the effective coherence time of shared entanglement between nodes by utilizing compact quantum error correcting (QEC) codes, which are scheduled and run locally on resource-constrained repeaters, to maximize the fidelity of the shared state, while also accounting for the incurred gate noise from QEC circuit operations. This local QEC approach stabilizes the distributed state via local operations, so independent execution on the nodes requires no additional synchronization or protocol overhead. Simulation results show significant improvements in the effective coherence time relative to idle decay, suggesting this approach could be useful in several quantum networking protocols such as entanglement generation, swapping, purification, and teleportation.

Workshop on Quantum Networks and Distributed Quantum Computing (QuNet)•Aug 16, 2023•0 citations

RESEARCH AND DEVELOPMENT OF A QUANTUM CODE FOR ERROR CORRECTION

S. M. Gushanskiy, V.S. Potapov, Божич Владимир Иванович

Quantum error correction (QEC) is required in quantum computers to mitigate the impact of errorson physical qubits. The goal is to optimize the neural network for high decoding performance whilemaintaining a minimalistic hardware implementation. The errors associated with decoherence can bereduced by adopting QEC schemes that encode multiple imperfect physical qubits into a logical quantumstate, similar to classical error correction. The relevance of these studies lies in the mathematicaland software modeling and implementation of corrective codes to correct several types of quantumerrors in the development and implementation of quantum algorithms for solving classes of problems ofa classical nature. The scientific novelty of this direction is expressed in the elimination of one of theshortcomings of the quantum computing process. The development of the theory and principles for constructingmodeling systems that are resistant to external interference (dependence of data distortion onnoise, dependence of the error of a quantum computing process on the measure and purity of entanglement)for modeling quantum computing is a dynamic area, as evidenced by a large number of existingmodels reflecting certain quantum computational processes and phenomena (quantum teleportation,parallelism, entanglement of quantum states) and scientific papers. Although quantum computing is notyet ready to move from theory to practice, it is nevertheless possible to reasonably guess what form aquantum computer might take, or, more importantly for programming language design, what interface itwould be possible to interact with such a quantum computer. It is natural to apply the lessons learnedfrom the programming of classical computing to quantum computing. The analysis of works in this areashowed that a new qualitative level has now been reached, which opens up promising opportunities forthe implementation of multi-qubit quantum computing. Prospects for implementation and developmentare associated not only with technological capabilities, but also with the solution of issues of buildingeffective quantum systems for solving actual mathematical problems, cryptography problems and control(optimization) problems.

Известия Южного федерального университета. Технические науки•Aug 10, 2022•1 citation

Quantum Error Correction Codes via Dynamic Topological Encoding

Jincheng Zhang

This paper proposes a novel approach to quantum error correction (QEC) leveraging the dynamic nature of topological quantum networks. The core idea revolves around real-time monitoring and adaptive configuration of error correction codes within the network topology. Traditional QEC methods often rely on static encoding schemes, failing to account for the inherent dynamic noise and topology changes within quantum topological networks. We introduce a mechanism utilizing quantum entanglement characteristics of topological quantum computing, combined with machine learning algorithms, to dynamically adjust error correction parameters and inter-qubit connections based on observed noise levels and network topology fluctuations. This approach aims to maximize the reliability of quantum information transmission. The framework presented offers a significant advancement over existing static QEC methods, offering improved resilience and efficiency in quantum communication scenarios. Mathematical formulations and key concepts are detailed to illustrate the methodology.

•Aug 28, 2026•0 citations
Quantum teleportation enables high-security communications via quantum entanglement. However, decoherence, signal decay, and environmental interference may cause imperfect entangled pairs with low fidelity. Such entangled pairs may easily generate errors when used to teleport data qubits and cause fatal computation errors on quantum computers. Fortunately, data qubits can be encoded via quantum error correction (QEC) code to recover the detected error to some extent. Nevertheless, letting any repeaters process data qubits is dangerous because malicious repeaters may peep at, destroy, or fake the data qubits. Thus, in this paper, we propose a novel QEC-enabled routing framework MOON facilitated with the concept of social networks (SNs) for quantum networks (QNs). MOON selects only trusted repeaters to process data qubits and exhibits elastic routing with QEC to maximize the throughput without errors. Last, simulation results show that our framework can outperform existing approaches by up to 34% on network throughput without errors.
Quantum teleportation via quantum entanglement enables high-security communications in networks. However, if two quantum nodes are far away, it may be difficult to create an entangled path due to the low success probability. Besides, existing approaches neglect social relations among nodes' owners. In this paper, we propose a new framework SEER to minimize the waiting time of all source-destination (SD) pairs' requests. SEER has two promising features: 1) Social-relation Consideration. SEER makes the first attempt to select trusted owners' nodes via social networks as intermediate nodes for requests to temporarily store data qubits to increase the success probability. 2) Starvation Mitigation. SEER divides long SD pairs and slices resources reasonably to remedy starvation due to their low success probability. To this end, we design RATE and PLAN to find the proper intermediate nodes and reduce the average waiting time. Simulation results manifest SEER outperforms others by 37%.
Quantum networks encounter unavoidable channel noises and erasure errors, presenting a huge obstacle in designing protocols that attain both high reliability and efficiency. Typically, quantum networks fall into two categories: those utilize quantum entanglements for quantum teleportation, and those directly transfer the actual quantum messages. In this paper, we present SurfNet, a quantum network that inherits the main advantages from both categories. It employs surface codes as logical qubits for encoding messages, and utilizes two parallel communication channels to fault-tolerantly transfer each surface code in a modular manner. Our approach of using surface codes can timely correct both operational and photon loss errors within the network, and the integration of the two channels within the network can greatly improve network throughput. For the implementation of SurfNet, we propose a novel network architecture, designed to better integrate surface codes into quantum networks. We also propose a novel error correction decoder, designed to fully utilize the modular characteristic of surface codes within our network. Simulation results demonstrate that SurfNet with its decoder significantly enhances the communication fidelity within quantum networks.
The conventional quantum teleportation schemes enable high-security network communications by establishing end-to-end entangled paths. However, those schemes focus on time synchronization and thus cause lots of idle time. Recent research suggests adopting an opportunistic scheme to forward data qubits as far as it can. However, this scheme lacks security since data qubits may be stored at malicious repeaters, which may peek at, destroy, or fake the data qubits. To this end, we design a new scheme called SOAR that considers trusted repeaters via social networks. Moreover, SOAR promotes the parallelism of swapping processes and thus leads to a less idle time of network resources than the other existing schemes. Furthermore, we design an algorithm called SAGE that can best fit SOAR by linking multiple subpaths via appropriate trusted repeaters to get an ideal path and augmenting least-hop paths to utilize the resources in quantum networks better. Simulation results manifest that SOAR outperforms the other schemes by 54%-89%; SAGE outperforms the other routing algorithms by 50% on average on SOAR.
A fundamental challenge in generating and distributing high-fidelity entanglement in quantum repeater networks is the management and suppression of quantum errors. In this work, we develop an approach for extending the effective coherence time of shared entanglement between nodes by utilizing compact quantum error correcting (QEC) codes, which are scheduled and run locally on resource-constrained repeaters, to maximize the fidelity of the shared state, while also accounting for the incurred gate noise from QEC circuit operations. This local QEC approach stabilizes the distributed state via local operations, so independent execution on the nodes requires no additional synchronization or protocol overhead. Simulation results show significant improvements in the effective coherence time relative to idle decay, suggesting this approach could be useful in several quantum networking protocols such as entanglement generation, swapping, purification, and teleportation.
Quantum error correction (QEC) is required in quantum computers to mitigate the impact of errorson physical qubits. The goal is to optimize the neural network for high decoding performance whilemaintaining a minimalistic hardware implementation. The errors associated with decoherence can bereduced by adopting QEC schemes that encode multiple imperfect physical qubits into a logical quantumstate, similar to classical error correction. The relevance of these studies lies in the mathematicaland software modeling and implementation of corrective codes to correct several types of quantumerrors in the development and implementation of quantum algorithms for solving classes of problems ofa classical nature. The scientific novelty of this direction is expressed in the elimination of one of theshortcomings of the quantum computing process. The development of the theory and principles for constructingmodeling systems that are resistant to external interference (dependence of data distortion onnoise, dependence of the error of a quantum computing process on the measure and purity of entanglement)for modeling quantum computing is a dynamic area, as evidenced by a large number of existingmodels reflecting certain quantum computational processes and phenomena (quantum teleportation,parallelism, entanglement of quantum states) and scientific papers. Although quantum computing is notyet ready to move from theory to practice, it is nevertheless possible to reasonably guess what form aquantum computer might take, or, more importantly for programming language design, what interface itwould be possible to interact with such a quantum computer. It is natural to apply the lessons learnedfrom the programming of classical computing to quantum computing. The analysis of works in this areashowed that a new qualitative level has now been reached, which opens up promising opportunities forthe implementation of multi-qubit quantum computing. Prospects for implementation and developmentare associated not only with technological capabilities, but also with the solution of issues of buildingeffective quantum systems for solving actual mathematical problems, cryptography problems and control(optimization) problems.
This paper proposes a novel approach to quantum error correction (QEC) leveraging the dynamic nature of topological quantum networks. The core idea revolves around real-time monitoring and adaptive configuration of error correction codes within the network topology. Traditional QEC methods often rely on static encoding schemes, failing to account for the inherent dynamic noise and topology changes within quantum topological networks. We introduce a mechanism utilizing quantum entanglement characteristics of topological quantum computing, combined with machine learning algorithms, to dynamically adjust error correction parameters and inter-qubit connections based on observed noise levels and network topology fluctuations. This approach aims to maximize the reliability of quantum information transmission. The framework presented offers a significant advancement over existing static QEC methods, offering improved resilience and efficiency in quantum communication scenarios. Mathematical formulations and key concepts are detailed to illustrate the methodology.