Analytical modeling of a quantum communication link is based on a photonic swap in the middle architecture. The effect of network and hardware nonidealities on the distributed entangled state is analyzed with the density operator formalism and with implications on the choice of distillation circuits of heralded states.
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.
Quantum entanglement serves as a foundational resource for various quantum technologies. In optical systems, entanglement distribution relies on the indistinguishability and spatial overlap of photons. Heralded schemes play a crucial role in ensuring the reliability of entanglement generation by detecting ancillary photons to signal the creation of desired entangled states. However, photon losses in quantum channels remain a significant challenge, limiting the distance and capacity of entanglement distributions. This study suggests three heralded schemes for distributing multipartite Greenberger-Horne-Zeilinger (GHZ) states via lossy quantum channels. These schemes differ both qualitatively in their network architecture (centralized or decentralized) and photon source requirements (Bell states or single-photons), and quantitatively in their success probabilities and heralding efficiency. Through comprehensive analysis incorporating both practical implementation considerations and theoretical performance metrics, we find that each scheme offers distinct advantages depending on the number of parties, channel distance, and security requirements. The decentralized scheme proves particularly advantageous for networks requiring balanced information distribution, while centralized schemes may offer better performance for smaller networks. This analysis provides insights into designing resilient heralded circuits for quantum information processing over lossy channels, considering both architectural constraints and performance requirements.
Abstract Distributing quantum states and entanglement between multiple pairs of nodes is a fundamental task in quantum communication and distributed quantum computing on large-scale quantum networks. In particular, the simultaneous distribution of quantum states or entanglement among multiple source-destination pairs (quantum k -pair communication task) is an emerging demand for scalable quantum networks. Here, we propose a quantum network architecture based on the Beneš switching topology that provides a universal switching framework for such pairwise communications. Our network architecture requires only O ( k log k ) pre-established entangled resources to accomplish the k -pair communication task, and offers advantages of non-blocking and low latency. We develop routing protocols for concurrent entanglement distribution and analyze their performance under ideal operating assumptions, while also discussing the effects of nonideal entanglement generation, quantum memory decoherence, photon loss, and finite Bell state measurement (BSM) success probability. The proposed framework requires local BSMs and entanglement swapping operations and is compatible in principle with quantum platforms supporting these capabilities. In particular, photonic implementations can benefit from mature photonic components and be compatible with existing telecommunications infrastructure.