Skip to content

Author

Matheus Guedes de Andrade

1 paper indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Aug 2026

Quantum-Classical Coexistence Network Tomography

Quantum-classical coexistence networks (QCNs) share optical fiber between quantum and classical signals via wavelength-division multiplexing, offering a practical path to quantum communication over existing telecom infrastructure. However, co- and counter-propagating classical traffic introduce distinct depolarization noise, complicating channel characterization. We develop a tomography framework that infers per-link channel parameters of a QCN from end-to-end measurements alone. We first model each coexisting fiber by decomposing the signal evolution into photon loss, successful transmission, and three direction-dependent depolarization components. We then derive closed-form link-level estimators, and extend the approach to star-topology networks through a system of multiplicative equations across end-node pairs, together with a simple classical-signal-direction-switching protocol that resolves the remaining unknowns. On single-link experimental testbed data, we recover per-link depolarization probabilities accurately, with estimated process fidelities closely tracking the Bayesian-process-tomography baseline across multiple fiber lengths and wavelengths; residual gaps reflect the depolarization-only approximation. Absent a multi-link coexistence testbed, we validate the star-network estimators on emulated paths built from measured single-link channels. We further extend the framework in two directions: (i) a channel model that factorizes the coexisting fiber into a depolarizing-with-loss signal channel and a Raman-noise-injection channel on separate optical modes -- a completely-positive, trace-preserving tensor product -- whose link observables reduce exactly to our basic model; and (ii) a generalization to arbitrary topologies via a peeling algorithm (trees) and a least-squares estimator (meshes), validated by Monte-Carlo simulations on tree and cyclic-mesh networks.

Xuchuang Wang, Joseph C. Chapman, Aneesh Ramaswamy et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.