Pith. sign in

REVIEW 3 cited by

Entanglement Swapping in Quantum Switches: Protocol Design and Stability Analysis

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2110.04116 v2 pith:24VZEMFJ submitted 2021-10-08 quant-ph cs.NI

Wenhan Dai , Anthony Rinaldi , Don Towsley This is my paper · ORCID
classification quant-phcs.NI
keywords entanglementquantumswappingprotocolsrequestsswitchswitchesdesign
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Quantum switches are critical components in quantum networks, distributing maximally entangled pairs among end nodes by entanglement swapping. In this work, we design protocols that schedule entanglement swapping operations in quantum switches. Entanglement requests randomly arrive at the switch, and the goal of an entanglement swapping protocol is to stabilize the quantum switch so that the number of unfinished entanglement requests is bounded with a high probability. We determine the capacity region for the rates of entanglement requests and develop entanglement swapping protocols to stabilize the switch. Among these protocols, the on-demand protocols are not only computationally efficient, but also achieve high fidelity and low latency demonstrated by results obtained using a quantum network discrete event simulator.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Learning Best Paths in Quantum Networks

    cs.NI 2025-06 conditional novelty 6.0 of 10

    The paper introduces BeQuP-Link and BeQuP-Path, two algorithms that identify the highest-fidelity (or highest-SKF) path in a quantum network with high probability while using fewer quantum resources than baselines.

  2. Scheduling Concurrent Entanglement Requests in Quantum Networks

    quant-ph 2026-05 unverdicted novelty 5.0 of 10

    PPO-based scheduling balances low delay and high success rates better than classical methods in simulations of multi-channel quantum entanglement distribution.

  3. QPing: a Quantum Ping Primitive for Quantum Networks

    quant-ph 2025-08 conditional novelty 5.0 of 10

    QPing defines quantum-network connectivity as a sequential-fidelity hypothesis test and proposes active path-based, segment-based, and passive resource-based variants.

Pith tools