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

Híradástechnika/Infocommunications journal

The Effect of Large Jumps in a Ring-like Quantum Network

Botond L. Márton, László Bacsárdi

Published Jan 1, 2025• 0 citations
Publisher

Abstract

Quantum communications promises major changes in today’s communication networks by sending qubits over long distances. These qubits enable large-scale quantum computing or information-theoretically secure distribution of symmetrical keys. One of the main enablers is quantum teleportation, which makes sending quantum information between two nodes possible even when they are far apart. From these nodes, one can build a larger quantum network, but due to the nature of quantum physics, certain tasks that are well understood in classical networks, such as routing, cannot be handled in a similar way. Our work focuses on modifying a previously created model for a ring-like quantum network and assessing the effect of introducing a new node type. Our results show that this node can alter properties of the underlying network. We also look at the possibilities of modeling the capacity of the network as well as the availability of the newly introduced edges, which open interesting questions for future research.

DOI
10.36244/icj.2025.4.9

Related papers

Quantum network routing via link prediction

Antal Száva

A network of devices capable of transmitting quantum information called a quantum network has promising applications with vast benefits. One of the most near term achievable application is the quantum key distribution. It could be used for sharing a secret key between two end-users through any insecure authenticated communication channel. Other than sharing a secret key, a quantum network can be used for connecting quantum computers. Quantum computers have the potential to solve computational problems that their classical counterparts would require significantly more time to do so. By connecting such devices, distributed computation problems such as leader election or distributed consensus between nodes can be solved securely. For such applications to be put into practice on a large scale, there are open practical questions still to be answered. In a quantum network, a data qubit containing quantum information is transmitted by an operation called quantum teleportation. For it, two nodes need to share entanglement. Quantum teleportation then ensures the safe transmission of a qubit by using the shared entanglement and the exchange of two classical bits. This operation, however, consumes entanglement between the nodes, changing the network topology with each served request. In quantum networks, certain nodes share entanglement between each other. Routing in quantum networks entails determining which of these shared entanglements are used to transmit quantum information. As this proves to be a difficult task, we study quantum networks and in particular consider the problem of routing entanglement in quantum networks. The average latency for routing entanglement in a quantum network has been studied so far using a distributed routing approach. Thus, we present numerical simulation results of centralised routing for the average latency of demands in two existing entanglement generation models. In the first, shared entanglement between nodes is created on-demand. In the second, certain nodes pre-share entanglement before the demand comes. Our results show the intuition that using a centralised routing approach in the on-demand model results in drastically more average latency than in the model with pre-shared entanglement. Since some nodes might not be informed about the change in topology, we study the effect of the propagation of information about the network topology to nodes in the network. Our observations based on simulation results show that the average latency is significantly higher if the information about the topology is not propagated well in the network. As propagating information to all nodes in a network would be a significant load for the network, we consider information propagation within a radius and still observe a considerable decrease in average latency. At last, we present a technique called link prediction which can be performed by any node without the need for information propagation and still achieve a considerable decrease in average latency. It can be effectively used to predict the change of topology in a quantum network by using knowledge about the network topology for a certain future point in time and previous knowledge about the network traffic.

•Jan 1, 2019•0 citations

Quantum Teleportation toward the Quantum Internet: A Concise Review

Yang-Bin Ma, Yun-Ru Fan, Ri-Yao Song +8 more

Quantum networks play a pivotal role in quantum information science, which not only provide a secure communication platform for remote access to quantum computers but also serve as the strategic core for achieving large-scale quantum information processing, forming the foundational infrastructure for the future global-scale quantum internet. Quantum teleportation, which enables the transmission of unknown quantum states over long distances by employing quantum entanglement together with classical communication, is essential for the distribution of quantum resources in the construction of the global-scale quantum internet. To realize a global-scale quantum internet, quantum repeater protocols represent one of the most promising approaches for enabling quantum communication between any nodes. This concise review presents representative experimental demonstrations of quantum teleportation for constructing quantum networks across different physical platforms. Along this trajectory, the review discusses current challenges, open issues, and future perspectives toward scalable and practical quantum internet.

quant-pharXiv:2607.25395•Jul 29, 2026•0 citations

Shortcuts to quantum network routing

Eddie Schoute, Laura Mančinska, Tanvirul Islam +2 more

A quantum network promises to enable long distance quantum communication, and assemble small quantum devices into a large quantum computing cluster. Each network node can thereby be seen as a small few qubit quantum computer. Qubits can be sent over direct physical links connecting nearby quantum nodes, or by means of teleportation over pre-established entanglement amongst distant network nodes. Such pre-shared entanglement effectively forms a shortcut - a virtual quantum link - which can be used exactly once. Here, we present an abstraction of a quantum network that allows ideas from computer science to be applied to the problem of routing qubits, and manage entanglement in the network. Specifically, we consider a scenario in which each quantum network node can create EPR pairs with its immediate neighbours over a physical connection, and perform entanglement swapping operations in order to create long distance virtual quantum links. We proceed to discuss the features unique to quantum networks, which call for the development of new routing techniques. As an example, we present two simple hierarchical routing schemes for a quantum network of N nodes for a ring and sphere topology. For these topologies we present efficient routing algorithms requiring O(log N) qubits to be stored at each network node, O(polylog N) time and space to perform routing decisions, and O(log N) timesteps to replenish the virtual quantum links in a model of entanglement generation.

arXiv:1610.05238•Oct 17, 2016•95 citations

Realizing Scalability Limits of Quantum Communication Networks

Connor Howe, Ali Anwar

The scalability of quantum communication networks is crucial for enabling secure information exchange and distributed quantum computing across global infrastructures. However, achieving scalability remains a significant challenge due to the effects of decoherence, photon loss, and fidelity degradation over extended distances. This paper performs a critical investigation into the scalability limits of quantum communication networks, focusing on the interplay between entanglement generation rates, end-to-end fidelity, and network parameters such as node separation, noise levels, and total distance. Leveraging the SeQUeNCe simulation framework, we model adaptable trapped-ion repeater networks to uncover fundamental insights into both homogeneous and heterogeneous configurations. Our findings reveal transformative insights that help reshape system designs for near term quantum networks. We identify maximum node separation thresholds critical for practical implementations, illuminate the non-linear degradation of fidelity with increasing distance, and expose how routing and swapping protocols influence entanglement success rates at scale. Most notably, we demonstrate that while additional repeaters can mitigate distance-induced failures, excessive node counts introduce compounding fidelity losses that threaten network viability under certain architectures. These results provide a roadmap for revolutionizing quantum networks, with actionable design strategies such as optimized node placement, advanced routing algorithms, and the adoption of cutting-edge qubit technologies like topological qubits. By addressing key bottlenecks in quantum communication scalability, our work lays the foundation for the next generation of global quantum networks.

IEEE International Conference on Quantum Computing and Engineering (QCE)•Aug 30, 2025•0 citations

Quantum networking and internetworking

Rodney Van Meter

Quantum networks build on entanglement and quantum measurement to bring new capabilities to communication systems. Quantum physical effects can be used to detect eavesdropping, to improve the shared sensitivity of separated astronomical instruments, or to create distributed states that will enable numerical quantum computation over a distance using teleportation. Because quantum data is fragile and some quantum operations are probabilistic, errors and distributed calculations must be managed aggressively and perhaps cooperatively among nodes. Solutions to these problems will have both similarities to and differences from purely classical networks. Architectures for large-scale quantum networking and internetworking are in development, paralleling theoretical and experimental work on physical layers and low-level error management and connection technologies. With unentangled quantum networks already deployed, entangled networks may appear within the next few years and will form a vibrant research topic in the coming decade.

IEEE Network•Jan 1, 2012•57 citations

Multi-Node Quantum Networks with Diamond Qubits

Matteo Pompili

The Internet has revolutionized the way we live. It has enabled applications far beyond what it was originally built for, and it will continue to exceed our expectations for the future. Quantum computers, and the network that will connect them—the Quantum Internet— are likely going to follow the same path. Differently from normal computers, quantum computers can share a property called entanglement, which allows the qubits (quantum bits) to be connected at a much more fundamental level. This property enables a range of new applications that span secure communication to enhanced metrology. Over the past fifteen years, significant progress has been made in connecting rudimentary quantum network nodes via long-distance entanglement. Several quantum platforms have demonstrated entanglement generation between two physically separated qubits. In this thesis we take a significant step forward, both in terms of experimental complexity achieved, and in the abstraction of said complexity for future developments. Moving past two-node experiments required a fundamental redesign of our experimental apparatus, as well as developing the capabilities to control simultaneously the additional node. The first result of this thesis is building a three-node entanglement-based quantum network. We demonstrated distribution of Greenberger-Horne-Zeilinger states over the network, as well as a building block for larger networks: entanglement swapping. Differently from previous multi-node demonstrations, which relied on post-selection, our network is able to perform the entanglement distribution in a heralded fashion: a signal will notify the users that the protocol was successful, and that the state is ready to be used. The second result builds on the first, by adding control over a fifth qubit, improving the quality of the entanglement, and introducing a novel repetitive readout technique, to achieve quantum teleportation of a qubit from the third node to the first—nodes that do not share a direct entanglement channel. The third and final result is the demonstration of entanglement delivery using a quantum network stack. The Internet is built using a plethora of physical platforms: optical fibers, Ethernet cables, Wi-Fi, satellite signals etc. To abstract their functionality, and make applications work regardless of the underlying platform, a layered approach was developed in the 1970s (the Internet protocol). Taking inspiration from classical network stacks, we demonstrate the first two layers of a quantum network stack, the physical layer (where the qubits, lasers and signal generators live), and the link layer, which abstracts the concepts of qubit and entanglement generation such that they can be used by applications at the higher-layers, hiding the complexity of the quantum platform being used.

•Nov 26, 2021•1 citation
Quantum communications promises major changes in today’s communication networks by sending qubits over long distances. These qubits enable large-scale quantum computing or information-theoretically secure distribution of symmetrical keys. One of the main enablers is quantum teleportation, which makes sending quantum information between two nodes possible even when they are far apart. From these nodes, one can build a larger quantum network, but due to the nature of quantum physics, certain tasks that are well understood in classical networks, such as routing, cannot be handled in a similar way. Our work focuses on modifying a previously created model for a ring-like quantum network and assessing the effect of introducing a new node type. Our results show that this node can alter properties of the underlying network. We also look at the possibilities of modeling the capacity of the network as well as the availability of the newly introduced edges, which open interesting questions for future research.
A network of devices capable of transmitting quantum information called a quantum network has promising applications with vast benefits. One of the most near term achievable application is the quantum key distribution. It could be used for sharing a secret key between two end-users through any insecure authenticated communication channel. Other than sharing a secret key, a quantum network can be used for connecting quantum computers. Quantum computers have the potential to solve computational problems that their classical counterparts would require significantly more time to do so. By connecting such devices, distributed computation problems such as leader election or distributed consensus between nodes can be solved securely. For such applications to be put into practice on a large scale, there are open practical questions still to be answered. In a quantum network, a data qubit containing quantum information is transmitted by an operation called quantum teleportation. For it, two nodes need to share entanglement. Quantum teleportation then ensures the safe transmission of a qubit by using the shared entanglement and the exchange of two classical bits. This operation, however, consumes entanglement between the nodes, changing the network topology with each served request. In quantum networks, certain nodes share entanglement between each other. Routing in quantum networks entails determining which of these shared entanglements are used to transmit quantum information. As this proves to be a difficult task, we study quantum networks and in particular consider the problem of routing entanglement in quantum networks. The average latency for routing entanglement in a quantum network has been studied so far using a distributed routing approach. Thus, we present numerical simulation results of centralised routing for the average latency of demands in two existing entanglement generation models. In the first, shared entanglement between nodes is created on-demand. In the second, certain nodes pre-share entanglement before the demand comes. Our results show the intuition that using a centralised routing approach in the on-demand model results in drastically more average latency than in the model with pre-shared entanglement. Since some nodes might not be informed about the change in topology, we study the effect of the propagation of information about the network topology to nodes in the network. Our observations based on simulation results show that the average latency is significantly higher if the information about the topology is not propagated well in the network. As propagating information to all nodes in a network would be a significant load for the network, we consider information propagation within a radius and still observe a considerable decrease in average latency. At last, we present a technique called link prediction which can be performed by any node without the need for information propagation and still achieve a considerable decrease in average latency. It can be effectively used to predict the change of topology in a quantum network by using knowledge about the network topology for a certain future point in time and previous knowledge about the network traffic.
Quantum networks play a pivotal role in quantum information science, which not only provide a secure communication platform for remote access to quantum computers but also serve as the strategic core for achieving large-scale quantum information processing, forming the foundational infrastructure for the future global-scale quantum internet. Quantum teleportation, which enables the transmission of unknown quantum states over long distances by employing quantum entanglement together with classical communication, is essential for the distribution of quantum resources in the construction of the global-scale quantum internet. To realize a global-scale quantum internet, quantum repeater protocols represent one of the most promising approaches for enabling quantum communication between any nodes. This concise review presents representative experimental demonstrations of quantum teleportation for constructing quantum networks across different physical platforms. Along this trajectory, the review discusses current challenges, open issues, and future perspectives toward scalable and practical quantum internet.
A quantum network promises to enable long distance quantum communication, and assemble small quantum devices into a large quantum computing cluster. Each network node can thereby be seen as a small few qubit quantum computer. Qubits can be sent over direct physical links connecting nearby quantum nodes, or by means of teleportation over pre-established entanglement amongst distant network nodes. Such pre-shared entanglement effectively forms a shortcut - a virtual quantum link - which can be used exactly once. Here, we present an abstraction of a quantum network that allows ideas from computer science to be applied to the problem of routing qubits, and manage entanglement in the network. Specifically, we consider a scenario in which each quantum network node can create EPR pairs with its immediate neighbours over a physical connection, and perform entanglement swapping operations in order to create long distance virtual quantum links. We proceed to discuss the features unique to quantum networks, which call for the development of new routing techniques. As an example, we present two simple hierarchical routing schemes for a quantum network of N nodes for a ring and sphere topology. For these topologies we present efficient routing algorithms requiring O(log N) qubits to be stored at each network node, O(polylog N) time and space to perform routing decisions, and O(log N) timesteps to replenish the virtual quantum links in a model of entanglement generation.
The scalability of quantum communication networks is crucial for enabling secure information exchange and distributed quantum computing across global infrastructures. However, achieving scalability remains a significant challenge due to the effects of decoherence, photon loss, and fidelity degradation over extended distances. This paper performs a critical investigation into the scalability limits of quantum communication networks, focusing on the interplay between entanglement generation rates, end-to-end fidelity, and network parameters such as node separation, noise levels, and total distance. Leveraging the SeQUeNCe simulation framework, we model adaptable trapped-ion repeater networks to uncover fundamental insights into both homogeneous and heterogeneous configurations. Our findings reveal transformative insights that help reshape system designs for near term quantum networks. We identify maximum node separation thresholds critical for practical implementations, illuminate the non-linear degradation of fidelity with increasing distance, and expose how routing and swapping protocols influence entanglement success rates at scale. Most notably, we demonstrate that while additional repeaters can mitigate distance-induced failures, excessive node counts introduce compounding fidelity losses that threaten network viability under certain architectures. These results provide a roadmap for revolutionizing quantum networks, with actionable design strategies such as optimized node placement, advanced routing algorithms, and the adoption of cutting-edge qubit technologies like topological qubits. By addressing key bottlenecks in quantum communication scalability, our work lays the foundation for the next generation of global quantum networks.
Quantum networks build on entanglement and quantum measurement to bring new capabilities to communication systems. Quantum physical effects can be used to detect eavesdropping, to improve the shared sensitivity of separated astronomical instruments, or to create distributed states that will enable numerical quantum computation over a distance using teleportation. Because quantum data is fragile and some quantum operations are probabilistic, errors and distributed calculations must be managed aggressively and perhaps cooperatively among nodes. Solutions to these problems will have both similarities to and differences from purely classical networks. Architectures for large-scale quantum networking and internetworking are in development, paralleling theoretical and experimental work on physical layers and low-level error management and connection technologies. With unentangled quantum networks already deployed, entangled networks may appear within the next few years and will form a vibrant research topic in the coming decade.
The Internet has revolutionized the way we live. It has enabled applications far beyond what it was originally built for, and it will continue to exceed our expectations for the future. Quantum computers, and the network that will connect them—the Quantum Internet— are likely going to follow the same path. Differently from normal computers, quantum computers can share a property called entanglement, which allows the qubits (quantum bits) to be connected at a much more fundamental level. This property enables a range of new applications that span secure communication to enhanced metrology. Over the past fifteen years, significant progress has been made in connecting rudimentary quantum network nodes via long-distance entanglement. Several quantum platforms have demonstrated entanglement generation between two physically separated qubits. In this thesis we take a significant step forward, both in terms of experimental complexity achieved, and in the abstraction of said complexity for future developments. Moving past two-node experiments required a fundamental redesign of our experimental apparatus, as well as developing the capabilities to control simultaneously the additional node. The first result of this thesis is building a three-node entanglement-based quantum network. We demonstrated distribution of Greenberger-Horne-Zeilinger states over the network, as well as a building block for larger networks: entanglement swapping. Differently from previous multi-node demonstrations, which relied on post-selection, our network is able to perform the entanglement distribution in a heralded fashion: a signal will notify the users that the protocol was successful, and that the state is ready to be used. The second result builds on the first, by adding control over a fifth qubit, improving the quality of the entanglement, and introducing a novel repetitive readout technique, to achieve quantum teleportation of a qubit from the third node to the first—nodes that do not share a direct entanglement channel. The third and final result is the demonstration of entanglement delivery using a quantum network stack. The Internet is built using a plethora of physical platforms: optical fibers, Ethernet cables, Wi-Fi, satellite signals etc. To abstract their functionality, and make applications work regardless of the underlying platform, a layered approach was developed in the 1970s (the Internet protocol). Taking inspiration from classical network stacks, we demonstrate the first two layers of a quantum network stack, the physical layer (where the qubits, lasers and signal generators live), and the link layer, which abstracts the concepts of qubit and entanglement generation such that they can be used by applications at the higher-layers, hiding the complexity of the quantum platform being used.