arXiv subjects

Shelbi L. Jenkins

Publications and source records attributed to Shelbi L. Jenkins.

5 recordsLinked to original sources

arXiv2026

Emulation of Entanglement Distribution Networks on a Quantum Computer

We investigate how quantum computers can be used to emulate quantum networks and study their performance under practical impairments. In particular, we evaluate how degraded entanglement and communication latency affect teleportation-based distributed multipartite-entanglement-state construction. We model imperfect Bell-pair sources using depolarizing noise channels and classical communication delays using thermal relaxation. We implement the depolarization using Stinespring dilation, randomly applied Pauli errors, and quasi-probability decompositions, evaluating the latter two on IQM quantum hardware and all three in simulation. We then study the performance of the entanglement distribution under noise generated by the aforementioned models. Although these noise models are mathematically equivalent, we find that hardware constraints result in profound differences in the corresponding results, highlighting the importance of careful experiment design.

quant-ph↗

arXiv2026

Toward Practical Two-Way Covert Communication

We study two-way covert communication schemes, where information is transmitted by passively modulating a reflected signal back to the source. We consider optical systems, described by quantum bosonic channels. While broadband classical and quantum light sources offer high covert throughput in theory, the associated mode-matching and phase-synchronization requirements make them impractical. Therefore, we employ a narrowband laser source to experimentally demonstrate a proof-of-concept two-way covert communication system, where the adversary is assumed to be quantum-capable. Furthermore, we propose a correlator-based receiver that attains the broadband gain offered by a quantum light source without the need for precise mode matching.

quant-ph↗

arXiv2026

A Zero Added Loss Multiplexing (ZALM) Source Simulation

Zero Added Loss Multiplexing (ZALM) offers broadband, per channel heralded EPR pairs, with a rich parameter space that allows its performance to be tailored for specific applications. We present a modular ZALM simulator that demonstrates how design choices affect output rate and fidelity. Built in NetSquid with QSI controllers, it exposes 20+ tunable parameters, supports IDEAL and REALISTIC modes, and provides reusable components for Spontaneous Parametric Down Conversion (SPDC) sources, interference, Dense Wavelength Division Multiplexing (DWDM) filtering, fiber delay, active polarization gates, detectors, and lossy fiber. Physics based models capture Hong Ou Mandel (HOM) visibility, insertion loss, detector efficiency, gate errors, and attenuation. Using this tool, we map trade offs among fidelity, link distance, and entangled pairs per use, and show how SPDC bandwidth and DWDM grid spacing steer performance. Using the default configuration settings, average fidelity remains constant at 0.83 but the ebit rate decreases from 0.0175 at the source to 0.0 at 50 km; narrowing the SPDC degeneracy bandwidth increases the ebit rate significantly without affecting fidelity. The simulator enables codesign of source, filtering, and feedforward settings for specific quantum memories and integrates as a building block for end to end quantum network studies.

cs.NI↗

arXiv2024

Routing and Spectrum Allocation in Broadband Quantum Entanglement Distribution

We investigate resource allocation for quantum entanglement distribution over an optical network. We characterize and model a network architecture that employs a single broadband quasi-deterministic time-frequency heralded Einstein-Podolsky-Rosen (EPR) pair source, and develop a routing and spectrum allocation scheme for distributing entangled photon pairs over such a network. As our setting allows separately solving the routing and spectrum allocation problems, we first find an optimal polynomial-time routing algorithm. We then employ max-min fairness criterion for spectrum allocation, which presents an NP-hard problem. Thus, we focus on approximately-optimal schemes. We compare their performance by evaluating the max-min and median number of EPR-pair rates assigned by them, and the associated Jain index. We identify two polynomial-time approximation algorithms that perform well, or better than others under these metrics. We also investigate scalability by analyzing how the network size and connectivity affect performance using Watts-Strogatz random graphs. We find that a spectrum allocation approach that achieves higher minimum EPR-pair rate can perform significantly worse when the median EPR-pair rate, Jain index, and computational resources are considered. Additionally, we evaluate the effect of the source node placement on the performance.

cs.NI↗

arXiv2024

Routing and Spectrum Allocation in Broadband Degenerate EPR-Pair Distribution

We investigate resource allocation for quantum entanglement distribution over an optical network. We characterize and model a network architecture that employs a single quasideterministic time-frequency heralded EPR-pair source, and develop a routing scheme for distributing entangled photon pairs over such a network. We focus on fairness in entanglement distribution, and compare both the performance of various spectrum allocation schemes as well as their Jain index.

cs.NI↗