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 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.
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.
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 is essential for quantum communication since it controls the effectiveness, dependability, and scalability of quantum networks. Although research on routing algorithms using quantum memories has been published in the literature, there aren't any quantum memories that can simultaneously achieve high fidelity, long storage duration, wide bandwidth, multimode capacity, and high efficiency. Therefore, in this study, we developed the fidelity-guaranteed MEDIRA routing algorithm, utilizing a distributed routing approach in a memoryless quantum network. As a result of the algorithm, we achieve a throughput of 17.2 qubits per second, for a demand fixed between 1 and 20. To the best of our knowledge, this is the first work that utilizes a queuing approach in a memoryless distributed routing algorithm with fidelity assurance.
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.
Quantum networks can enable various applications such as distributed quantum computing, long-distance quantum communication, and network-based quantum sensing with unprecedented performances. One of the most important building blocks for a quantum network is a photonic quantum memory which serves as the interface between the communication channel and the local functional unit. A programmable quantum memory which can process a large stream of flying qubits and fulfill the requirements of multiple core functions in a quantum network is still to be realized. Here we report a high-performance quantum memory which can simultaneously store 72 optical qubits carried by 144 spatially separated atomic ensembles and support up to a thousand consecutive write or read operations in a random access way, 2 orders of magnitude larger than the previous record. Because of the built-in programmability, this quantum memory can be adapted on demand for several functions. As example applications, we realize quantum queue, stack, and buffer which closely resemble the counterpart devices for classical information processing. We further demonstrate the storage and reshuffle of four entangled pairs of photonic pulses with probabilistic arrival time and arbitrary release order via the memory, which is an essential requirement for the realization of quantum repeaters and efficient routing in quantum networks. Realization of this multipurpose programmable quantum memory thus constitutes a key enabling building block for future large-scale fully functional quantum networks. Published by the American Physical Society 2024
The topology of classical networks is determined by physical links between nodes, and after a network request the links are used to establish the desired connections. Quantum networks offer the possibility to generate different kinds of entanglement prior to network requests, which can substitute links and allow one to fulfill multiple network requests with the same resource state. We utilize this to design entanglement-based quantum networks tailored to their desired functionality, independent of the underlying physical structure. The kind of entanglement to be stored is chosen to fulfill all desired network requests (i.e. parallel bipartite or multipartite communications between specific nodes chosen from some finite set), but in such a way that the storage requirement is minimized. This can be accomplished by using multipartite entangled states shared between network nodes that can be transformed by local operations to different target states. We introduce a clustering algorithm to identify connected clusters in the network for a given desired functionality, i.e. the required network topology of the entanglement-based network, and a merging algorithm that constructs multipartite entangled resource states with reduced memory requirement to fulfill all desired network requests. This leads to a significant reduction in required time and resources, and provides a powerful tool to design quantum networks that is unique to entanglement-based networks.