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

IEEE Network

Leveraging Network Structure to Emulate Quantum Memory

Hilal Sultan Duranoglu Tunc, Joy Halder, Riccardo Bassoli, Gerhard Paul Fettweis, Frank H. P. Fitzek

Published Dec 19, 2025• 1 citation
Publisher

Abstract

Quantum memories, which play a critical role in various aspects of quantum networks—such as timing synchronization, fidelity preservation, network performance continuity, and efficient resource management—are not well-suited for practical deployment due to their high cost and complex implementation requirements. For this reason, in our study, we propose a low-cost and easy-to-implement alternative method called soft memory, which does not require any physical quantum memory hardware and is based on a delay-aware routing strategy. Under varying threshold and request time window values, we evaluate two key performance metrics—mean time difference and request success rate—across three types of quantum networks: (i) memoryless quantum networks, (ii) quantum networks equipped with fixed qubit storage time, and (iii) the proposed soft memory architecture. Despite requiring no additional physical hardware, the soft memory approach achieves a request success rate nearly equivalent to that of a quantum memory with 0.15-second storage time, while providing a lower mean time difference.

DOI
10.1109/mnet.2025.3636661

Related papers

Fidelity-Preserving Routing without Memory for Practical Quantum Network Implementation

Hilal Sultan Duranoglu Tunc, Joy Halder, Riccardo Bassoli +2 more

Routing plays a pivotal role in quantum communication as it directly impacts the efficiency, reliability, and scalability of quantum networks. While several studies in the literature have explored routing algorithms leveraging quantum memories, current quantum memory technologies are unable to simultaneously achieve high fidelity, extended storage durations, wide bandwidths, multimode capacity, and high efficiency. To address this limitation, our study focuses on fidelity-guaranteed entanglement routing within a memoryless network architecture, employing both distributed and centralized routing approaches. Utilizing our proposed routing algorithm, MEFID, we achieved a throughput of 72 qubits per second under a fidelity threshold of 0.8 and within three iterative rounds. By integrating a purification process to ensure that the final fidelity consistently exceeds the specified threshold, our algorithm facilitates the development of robust and high-performance quantum networks.

IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)•Sep 1, 2025•2 citations

Routing in Memoryless Quantum Networks: A Lexicographic Approach with Fidelity Guarantee

Hilal Sultan Duranoglu Tunc, Milad Ghadimi, Riccardo Bassoli +1 more

While routing methods in the literature often assume the use of quantum memory, this study proposes a routing algorithm designed for memoryless quantum networks. The algorithm leverages lexicographic optimization principles to hierarchically prioritize and optimize multiple objectives such as distance and capacity. This approach identifies the shortest paths between source-destination pairs within the decoherence time and selects a path that satisfies the minimum capacity require ments. To prevent entanglement fidelity from dropping below the desired threshold, purification is applied. Simulation results demonstrate the algorithm’s ability to manage latency while enhancing throughput effectively. The study comprehensively analyzes performance metrics under varying capacity values, request numbers, and threshold fidelity levels. Additionally, to the best of our knowledge, it is the first study to calculate latency, including queuing delay, in the context of quantum networks. Future research aims to explore optimal threshold fidelity values that balance throughput and latency performance.

IEEE Symposium on Computers and Communications (ISCC)•Jul 2, 2025•0 citations

Routing in Bufferless Quantum Networks

Hilal Sultan Duranoglu Tunc, Joy Halder, Muhammad Idham Habibie +4 more

Quantum memories, which are expensive and often require cryogenic systems, are not yet sufficiently suitable for practical quantum network applications because they cannot provide high efficiency, multimode capacity, and long storage time simultaneously. On the other hand, in networks that do not use quantum memory, a significant decrease in the request success rate (RSR) is observed due to the lack of buffering and synchronization. As a remedy to this problem, we propose an algorithm that enables buffering of qubits by using the network itself as a memory. For this purpose, the approach defined as "network as a memory" partitions the network into several regions. Each region is considered as a virtual node, and instead of a physical quantum memory, the qubits are stored in these virtual nodes by being circulated over the real nodes inside the virtual node. We propose two algorithms, referred to as memory-assisted quantum network (Algorithm A) and network as a memory (Algorithm B): Algorithm A describes the memory-assisted routing approach, while Algorithm B presents the network-as-memory approach. It is demonstrated that Algorithm B, when the parameter (γ) for partitioning the topology into regions is chosen as 1, exhibits higher performance than the case in Algorithm A, where the memory duration (mem) is chosen as 0.1s.

IEEE Conference on Computer Communications (INFOCOM)•May 18, 2026•0 citations

Resource allocation in quantum networks

Shahrooz Pouryousef

Quantum computing promises computational capabilities beyond those of classical systems by exploiting superposition, entanglement, and quantum interference. However, the scalability of current noisy intermediate-scale quantum (NISQ) devices is limited by physical and engineering constraints, restricting the number of available qubits. Distributed quantum computing (DQC) mitigates this limitation by interconnecting multiple quantum processing units (QPUs) via quantum networks capable of distributing high-fidelity entanglement. Realizing such networks requires overcoming probabilistic entanglement generation, finite memory coherence, photon loss, and architectural constraints. This dissertation conducts an in-depth and comprehensive study of resource allocation in quantum networks, aiming to support high-throughput and high-fidelity entanglement distribution over lossy infrastructures. Our work spans the quantum networking stack, from physical-layer entanglement distribution protocols to network planning, quantum storage architectures, and distributed quantum computing. We begin by introducing two asynchronous entanglement distribution protocols-Sequential and Parallel-designed for early-stage quantum networks without global synchronization. Unlike many prior models, our protocols account for classical communication delays and quantum memory decoherence, reflecting practical constraints. Through simulations on real-world topologies such as SURFnet, we show that simple mechanisms such as cutoff-based memory management and sequential asynchronous entanglement distribution protocols can deliver competitive performance while significantly simplifying coordination, narrowing the gap between theoretical proposals and deployable protocols. Next, we formulate quantum network planning as a utility maximization problem that jointly considers entanglement distribution rate and fidelity, treating repeater and memory placement as optimization variables. We propose scalable heuristics and mixed-integer formulations, evaluating them under realistic conditions such as finite coherence time of quantum memories, limited number of memories per repeaters and end nodes, and real network topologies such as ESNet. Our findings offer practical design guidance and highlight how optimal placements depend on underlying physical constraints. To support dynamic workloads and respond to traffic bursts, we propose the Quantum Storage Network (QSN) architecture, where storage nodes buffer EPR pairs in advance of demand as an overlay network. This temporal decoupling improves responsiveness and throughput. Simulations across multiple topologies show that QSNs reduce entanglement distribution service latency by up to 40% and provide improved robustness compared to non-overlay designs, underscoring the value of storage-aware planning in future quantum networks. Finally, we focus on DQC, where large-scale quantum circuits are executed across networked QPUs. We propose a window-based circuit partitioning algorithm that minimizes nonlocal gate execution while balancing load across QPUs. Building on this partitioning, we design an adaptive, dependency-aware entanglement generation scheduler that opportunistically initiates remote entanglement as soon as dependent gates are ready, while accounting for realistic constraints such as coherence limits, probabilistic link generation, and Bell-state measurement (BSM) contention. Applied to benchmark circuits such as QAOA and QFT, this joint approach reduces execution delay by up to 35%. We further perform a two-qubit gate fidelity-sensitivity analysis under to show when the distributed quantum computing can be beneficial. Results show that the number of QPUs significantly impacts sensitivity to non-local gate fidelity: with fewer QPUs, distributed execution can outperform monolithic execution under looser fidelity constraints, whereas with more QPUs, achieving the same advantage requires substantially higher non-local gate fidelities relative to local gate fidelities. These findings identify the parameter regimes in which distributed quantum computing is beneficial, mapping break-even regions (as a function of number of QPUs) and quantifying how much cross-QPU (non-local) gate fidelity must improve—or, equivalently, how much per-QPU local gate fidelity must improve under modularization—for distributed execution to outperform a monolithic baseline. Together, these contributions form a cohesive framework for resource allocation in quantum networks in order to build scalable, delay-tolerant quantum networks and distributed computing systems. By grounding architectural design in realistic physical assumptions, this work advances the state of the art from theoretical modeling to practical, deployable quantum infrastructure.

•Jan 1, 2025•0 citations

Towards QoS-Aware Quantum Networks

Ruilin Zhou, Yuhang Gan, Yi Liu +2 more

Quality of Service (QoS) has been studied in classic networks to support various applications. Due to the unique prop-erties of quantum networks, like entanglement and superposition, the definition and requirements of QoS in quantum networks differ significantly from classical networks. Limited work has been done from the application side to investigate these differences. Moreover, quantum applications exhibit distinct service requirements compared to traditional network applications, such as the need for quantum state preservation and fidelity requirements. Therefore, this work aims to analyze and model various quantum applications to identify the fundamental services required in quantum networks to provide application-specific QoS. We further propose a novel QoS routing framework, called Q2R, for quantum networks to demonstrate a possible method to achieve QoS via routing. Q2R computes feasible paths for each request and meets the fidelity and number of qubits requirements. With our framework, we can allocate resources more efficiently and our scheduling algorithm also considers fairness among different requests.

International Conference on Quantum Communications, Networking, and Computing (QCNC)•Jul 1, 2024•4 citations

On-demand storing time-bin qubit states with optical quantum memory

Ming-Shuo Sun, Chunhui Zhang, Yi-Zhen Luo +4 more

Quantum memory, serving as a crucial device for storing and releasing quantum states, holds significant importance in long-distance quantum communications. To date, quantum memories have been realized in many different systems. However, most of them have complex structures and high cost. Besides, it is not easy to simultaneously achieve both high storage efficiency and fidelity. In this paper, we experimentally demonstrate a low-cost optical quantum memory with high efficiency and high fidelity, by utilizing a butterfly-shaped cavity consisting of one polarization beam splitter, two reflecting mirrors, and one pockels cell crystal. In order to quantify the quality of the quantum memory, we carry out tomography measurements on the time-bin qubits encoded with weak coherent states after storage for N rounds. The storage efficiency per round can reach up to 95.0%, and the overall state fidelity can exceed 99.1%. It thus seems very promising for practical implementation in quantum communication and networks.

arXiv:2502.13494•Applied Physics Letters•Mar 1, 2025•4 citations
Quantum memories, which play a critical role in various aspects of quantum networks—such as timing synchronization, fidelity preservation, network performance continuity, and efficient resource management—are not well-suited for practical deployment due to their high cost and complex implementation requirements. For this reason, in our study, we propose a low-cost and easy-to-implement alternative method called soft memory, which does not require any physical quantum memory hardware and is based on a delay-aware routing strategy. Under varying threshold and request time window values, we evaluate two key performance metrics—mean time difference and request success rate—across three types of quantum networks: (i) memoryless quantum networks, (ii) quantum networks equipped with fixed qubit storage time, and (iii) the proposed soft memory architecture. Despite requiring no additional physical hardware, the soft memory approach achieves a request success rate nearly equivalent to that of a quantum memory with 0.15-second storage time, while providing a lower mean time difference.
Routing plays a pivotal role in quantum communication as it directly impacts the efficiency, reliability, and scalability of quantum networks. While several studies in the literature have explored routing algorithms leveraging quantum memories, current quantum memory technologies are unable to simultaneously achieve high fidelity, extended storage durations, wide bandwidths, multimode capacity, and high efficiency. To address this limitation, our study focuses on fidelity-guaranteed entanglement routing within a memoryless network architecture, employing both distributed and centralized routing approaches. Utilizing our proposed routing algorithm, MEFID, we achieved a throughput of 72 qubits per second under a fidelity threshold of 0.8 and within three iterative rounds. By integrating a purification process to ensure that the final fidelity consistently exceeds the specified threshold, our algorithm facilitates the development of robust and high-performance quantum networks.
While routing methods in the literature often assume the use of quantum memory, this study proposes a routing algorithm designed for memoryless quantum networks. The algorithm leverages lexicographic optimization principles to hierarchically prioritize and optimize multiple objectives such as distance and capacity. This approach identifies the shortest paths between source-destination pairs within the decoherence time and selects a path that satisfies the minimum capacity require ments. To prevent entanglement fidelity from dropping below the desired threshold, purification is applied. Simulation results demonstrate the algorithm’s ability to manage latency while enhancing throughput effectively. The study comprehensively analyzes performance metrics under varying capacity values, request numbers, and threshold fidelity levels. Additionally, to the best of our knowledge, it is the first study to calculate latency, including queuing delay, in the context of quantum networks. Future research aims to explore optimal threshold fidelity values that balance throughput and latency performance.
Quantum memories, which are expensive and often require cryogenic systems, are not yet sufficiently suitable for practical quantum network applications because they cannot provide high efficiency, multimode capacity, and long storage time simultaneously. On the other hand, in networks that do not use quantum memory, a significant decrease in the request success rate (RSR) is observed due to the lack of buffering and synchronization. As a remedy to this problem, we propose an algorithm that enables buffering of qubits by using the network itself as a memory. For this purpose, the approach defined as "network as a memory" partitions the network into several regions. Each region is considered as a virtual node, and instead of a physical quantum memory, the qubits are stored in these virtual nodes by being circulated over the real nodes inside the virtual node. We propose two algorithms, referred to as memory-assisted quantum network (Algorithm A) and network as a memory (Algorithm B): Algorithm A describes the memory-assisted routing approach, while Algorithm B presents the network-as-memory approach. It is demonstrated that Algorithm B, when the parameter (γ) for partitioning the topology into regions is chosen as 1, exhibits higher performance than the case in Algorithm A, where the memory duration (mem) is chosen as 0.1s.
Quantum computing promises computational capabilities beyond those of classical systems by exploiting superposition, entanglement, and quantum interference. However, the scalability of current noisy intermediate-scale quantum (NISQ) devices is limited by physical and engineering constraints, restricting the number of available qubits. Distributed quantum computing (DQC) mitigates this limitation by interconnecting multiple quantum processing units (QPUs) via quantum networks capable of distributing high-fidelity entanglement. Realizing such networks requires overcoming probabilistic entanglement generation, finite memory coherence, photon loss, and architectural constraints. This dissertation conducts an in-depth and comprehensive study of resource allocation in quantum networks, aiming to support high-throughput and high-fidelity entanglement distribution over lossy infrastructures. Our work spans the quantum networking stack, from physical-layer entanglement distribution protocols to network planning, quantum storage architectures, and distributed quantum computing. We begin by introducing two asynchronous entanglement distribution protocols-Sequential and Parallel-designed for early-stage quantum networks without global synchronization. Unlike many prior models, our protocols account for classical communication delays and quantum memory decoherence, reflecting practical constraints. Through simulations on real-world topologies such as SURFnet, we show that simple mechanisms such as cutoff-based memory management and sequential asynchronous entanglement distribution protocols can deliver competitive performance while significantly simplifying coordination, narrowing the gap between theoretical proposals and deployable protocols. Next, we formulate quantum network planning as a utility maximization problem that jointly considers entanglement distribution rate and fidelity, treating repeater and memory placement as optimization variables. We propose scalable heuristics and mixed-integer formulations, evaluating them under realistic conditions such as finite coherence time of quantum memories, limited number of memories per repeaters and end nodes, and real network topologies such as ESNet. Our findings offer practical design guidance and highlight how optimal placements depend on underlying physical constraints. To support dynamic workloads and respond to traffic bursts, we propose the Quantum Storage Network (QSN) architecture, where storage nodes buffer EPR pairs in advance of demand as an overlay network. This temporal decoupling improves responsiveness and throughput. Simulations across multiple topologies show that QSNs reduce entanglement distribution service latency by up to 40% and provide improved robustness compared to non-overlay designs, underscoring the value of storage-aware planning in future quantum networks. Finally, we focus on DQC, where large-scale quantum circuits are executed across networked QPUs. We propose a window-based circuit partitioning algorithm that minimizes nonlocal gate execution while balancing load across QPUs. Building on this partitioning, we design an adaptive, dependency-aware entanglement generation scheduler that opportunistically initiates remote entanglement as soon as dependent gates are ready, while accounting for realistic constraints such as coherence limits, probabilistic link generation, and Bell-state measurement (BSM) contention. Applied to benchmark circuits such as QAOA and QFT, this joint approach reduces execution delay by up to 35%. We further perform a two-qubit gate fidelity-sensitivity analysis under to show when the distributed quantum computing can be beneficial. Results show that the number of QPUs significantly impacts sensitivity to non-local gate fidelity: with fewer QPUs, distributed execution can outperform monolithic execution under looser fidelity constraints, whereas with more QPUs, achieving the same advantage requires substantially higher non-local gate fidelities relative to local gate fidelities. These findings identify the parameter regimes in which distributed quantum computing is beneficial, mapping break-even regions (as a function of number of QPUs) and quantifying how much cross-QPU (non-local) gate fidelity must improve—or, equivalently, how much per-QPU local gate fidelity must improve under modularization—for distributed execution to outperform a monolithic baseline. Together, these contributions form a cohesive framework for resource allocation in quantum networks in order to build scalable, delay-tolerant quantum networks and distributed computing systems. By grounding architectural design in realistic physical assumptions, this work advances the state of the art from theoretical modeling to practical, deployable quantum infrastructure.
Quality of Service (QoS) has been studied in classic networks to support various applications. Due to the unique prop-erties of quantum networks, like entanglement and superposition, the definition and requirements of QoS in quantum networks differ significantly from classical networks. Limited work has been done from the application side to investigate these differences. Moreover, quantum applications exhibit distinct service requirements compared to traditional network applications, such as the need for quantum state preservation and fidelity requirements. Therefore, this work aims to analyze and model various quantum applications to identify the fundamental services required in quantum networks to provide application-specific QoS. We further propose a novel QoS routing framework, called Q2R, for quantum networks to demonstrate a possible method to achieve QoS via routing. Q2R computes feasible paths for each request and meets the fidelity and number of qubits requirements. With our framework, we can allocate resources more efficiently and our scheduling algorithm also considers fairness among different requests.
Quantum memory, serving as a crucial device for storing and releasing quantum states, holds significant importance in long-distance quantum communications. To date, quantum memories have been realized in many different systems. However, most of them have complex structures and high cost. Besides, it is not easy to simultaneously achieve both high storage efficiency and fidelity. In this paper, we experimentally demonstrate a low-cost optical quantum memory with high efficiency and high fidelity, by utilizing a butterfly-shaped cavity consisting of one polarization beam splitter, two reflecting mirrors, and one pockels cell crystal. In order to quantify the quality of the quantum memory, we carry out tomography measurements on the time-bin qubits encoded with weak coherent states after storage for N rounds. The storage efficiency per round can reach up to 95.0%, and the overall state fidelity can exceed 99.1%. It thus seems very promising for practical implementation in quantum communication and networks.