Quantum entanglement switches are a key building block for early quantum networks, and a central design question is whether near-term devices should use only optical components and photonic qubits or also incorporate quantum memories. We compare two architectures: an all-photonic entanglement generation switch (EGS) that repeatedly attempts Bell-state measurements (BSMs) without storing qubits, and a quantum memory-equipped switch that buffers entanglement and triggers measurements only when heralded connectivity is available (herald-then-swap control). These two designs trade off simple, memoryless operation that avoids decoherence and memory-induced latency against heralding-based control that buffers entanglement to use BSMs more efficiently. We formalize both models under a common hardware abstraction and characterize their achievable rate-fidelity regions, yielding a benchmarking methodology that translates hardware and protocol parameters into network-level performance. Numerical evaluation quantifies the rate-fidelity tradeoffs of both models, identifies operating regions in which each architecture dominates, and shows how hardware and protocol knobs can be tuned to meet application-specific targets.
Quantum entanglement switches are a key building block for early quantum networks, and a central design question is whether near-term devices should use only optical components and photonic qubits or also incorporate quantum memories. We compare two architectures: an all-photonic entanglement generation switch (EGS) that repeatedly attempts Bell-state measurements (BSMs) without storing qubits, and a quantum memory-equipped switch that buffers entanglement and triggers measurements only when heralded connectivity is available (herald-then-swap control). These two designs trade off simple, memoryless operation that avoids decoherence and memory-induced latency against heralding-based control that buffers entanglement to use BSMs more efficiently. We formalize both models under a common hardware abstraction and characterize their achievable rate-fidelity regions, yielding a benchmarking methodology that translates hardware and protocol parameters into network-level performance. Numerical evaluation quantifies the rate-fidelity tradeoffs of both models, identifies operating regions in which each architecture dominates, and shows how hardware and protocol knobs can be tuned to meet application-specific targets.
Quantum entanglement switches are a key building block for early quantum networks, and a central design question is whether near-term devices should use only flying photons or also incorporate quantum memories. We compare two architectures: an all-photonic entanglement generation switch (EGS) that repeatedly attempts Bell-state measurements (BSM) without storing qubits, and a quantum memory-equipped switch that buffers entanglement and triggers measurements only when heralded connectivity is available (herald-then-swap control). These two designs trade off simple, memoryless operation that avoids decoherence and memory-induced latency against heralding-based control that buffers entanglement to use BSMs more efficiently. We formalize both models under a common hardware abstraction and characterize their achievable rate-fidelity regions, yielding a benchmarking methodology that translates hardware and protocol parameters into network-level performance. Numerical evaluation quantifies the rate-fidelity tradeoffs of both models, identifies operating regions in which each architecture dominates, and shows how hardware and protocol knobs can be tuned to meet application-specific targets.
Bell state measurements (BSMs) of photonic qubits are used for quantum networking protocols to herald the distribution and transfer of quantum information. However, standard BSMs based on linear optics (LO-BSMs) require identical photons and are susceptible to errors from multiphoton emissions, leading to reduced fidelity of protocols, particularly in the absence of postselection. To overcome these challenges, Bell state measurements based on nonlinear optics (NLO-BSMs) have been proposed and implemented, leveraging sum-frequency generation (SFG) to filter out multiphoton emissions and improve the fidelity without postselection. Here we analyze the fidelity of LO-BSM and NLO-BSM heralded entanglement swapping in lossy channels and compare their performance under realistic conditions. We also explore the impact of state-of-the-art nonlinear photonics platforms on SFG efficiency and highlight how advances in nanophotonics will enable practical, high-fidelity NLO-BSM-based quantum networking applications.
Developing and deploying advanced Quantum Repeater (QR) technologies will be necessary to scale quantum networks at longer distances. Depending on the error mitigation mechanisms adopted to suppress loss and errors, QRs are typically classified into “memory-based” or “all-photonic” QRs, and each type of QR may be best suited for a specific type of underlying quantum technology, a particular scale of quantum network, or a specific regime of operational parameters. Modeling and simulation of quantum repeaters and networks can help in understanding the relative performance and resource requirements of different types of QRs, identify tradeoffs of alternative quantum network architectures, optimize quantum hardware, and assist in the design of a robust control plane. This paper introduces a quantum repeater simulation toolkit based on NetSquid, which includes component models and protocols to study advanced quantum repeater networks. We present our initial research findings on modeling and simulation of “allphotonic” entanglement-based QRs and “memory-based” first generation trapped ion QRs. We study the relative performance and resource requirements of these two different types of QRs and networks. The performance metrics include entanglement generation rate and fidelity between the endpoints of the network. For fair comparison of resource requirements of different types of QRs, entanglement generation rate is normalized by the total number of matter qubits involved.
The all-photonic quantum repeater scheme based on repeater graph states (RGS) offers a promising approach for constructing quantum networks without relying on long-coherence-time quantum memories, which remain a significant technological challenge. Despite substantial progress in defining new schemes for generating RGSs, and in analyzing their performance for the task of secret key generation, the integration of all-photonic schemes with memory-equipped quantum repeaters remains underexplored. We propose an architecture that enables seamless interoperability between all-photonic and memory-based quantum repeaters through an emitter-photon qubit building block, significantly reducing the number of quantum memories required at end nodes from a multiplicative dependence on the trial rate and number of RGS arms to an additive scaling. The core idea of our architecture is to abstract the all-photonic sections of the network as link-level connections between memory-equipped nodes, enabling integration into existing network-level protocols. Additionally, we outline the content and semantics of the messages necessary for a communication protocol based on graph state manipulation rules for computing Pauli frame corrections for obtaining the correct Bell pair. Our approach also provides a simplified method for calculating state fidelity directly from graph state properties.
Generating high fidelity link-level entanglements is essential for the distribution of end-to-end connectivity across quantum communication networks. The efficiency of entanglement buffering is, however, limited by the short lifetime of the required qubits as noise causes a rapid decay in their fidelities. Entanglement purification, which is essentially a probabilistic operation, counteracts this decay. In its simplest form it uses two entanglements to obtain a higher fidelity one. In this paper, we combine entanglement buffering and purification by applying a purification protocol that acts on the stored entanglements beyond their generation time. Considering a link-level system with a few quantum memories to buffer entanglements in addition to application requests for entanglement, we use a Markov Chain model to derive the steady state distribution of the service performance metrics, specifically, (i) the fidelity of the entanglements that are consumed by application requests and (ii) the distribution of their waiting time in the request queue. Our evaluations show a trade-off between the fidelity and the request waiting time, specifically, given purification as well as for different memory sizes.
The quantum switch is a vital component for the development of the quantum internet. In an entanglement distribution network, the function of a quantum switch is to generate elementary entanglement with its clients followed by entanglement swapping to distribute end-to-end entanglement of sufficiently high fidelity between clients. The threshold on entanglement fidelity is any quality of service requirement specified by the clients as dictated by the application they run on the network. We consider a discrete time model for a quantum switch that attempts generation of fresh elementary entanglement with clients in each time step in the form of maximally entangled qubit pairs, or Bell pairs, which succeed probabilistically; the successfully generated Bell pairs are stored in noisy quantum memories until they can be swapped. We focus on establishing the value of entanglement distillation of the stored Bell pairs prior to entanglement swapping in presence of their inevitable aging, i.e., decoherence: For a simple instance of a switch with two clients, an exponential decay of entanglement fidelity, and a wellknown probabilistic but heralded two-to-one distillation protocol, given a threshold end-to-end entanglement fidelity, we use the Markov Decision Processes framework to identify the optimal action policy - to wait, to distill, or to swap that maximizes throughput. We compare the switch's performance under the optimal distillation-enabled policy with that excluding distillation. Simulations of the two policies demonstrate the improvements that are possible in principle via optimal use of distillation with respect to average throughput, average fidelity and jitter of end-to-end entanglement, as functions of fidelity threshold. Our model thus helps capture the role of entanglement distillation in mitigating the effects of decoherence in a quantum switch in an entanglement distribution network, adding to the growing literature on quantum switches.