A Quantum Advantage in Localizing Transmission Loss Change in Optical Networks

• URL: http://arxiv.org/abs/2504.10882v1
• Date: Tue, 15 Apr 2025 05:24:51 GMT
• Title: A Quantum Advantage in Localizing Transmission Loss Change in Optical Networks
• Authors: Yufei Zheng, Yu-Zhen Janice Chen, Prithwish Basu, Don Towsley,
• Abstract summary: We present a scheme for quickly detecting the links that have suffered a sudden drop in transmissivity.<n>Since quantum probes lose their sensitivity with increasing loss in the channel, we first propose a probe construction algorithm.<n>We then introduce new cumulative sum statistics with a stopping rule, which allows us to run the CUSUM algorithm to quickly localize the lossy links.
• Score: 10.613089120892724
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The ability to localize transmission loss change to a subset of links in optical networks is crucial for maintaining network reliability, performance and security. \emph{Quantum probes}, implemented by sending blocks of $n$ coherent-state pulses augmented with continuous-variable (CV) squeezing ($n=1$) or weak temporal-mode entanglement ($n>1$) over a lossy channel to a receiver with homodyne detection capabilities, are known to be more sensitive than their quasi-classical counterparts in detecting a sudden increase in channel loss. The enhanced sensitivity can be characterized by the increased Kullback-Leibler (KL) divergence of the homodyne output, before and after the loss change occurs. When combined with the theory of quickest change detection (QCD), the increase in KL divergence translates into a decrease in detection latency. In this work, we first revisit quantum probes over a channel, generalizing previous results on $n=1$ (CV squeezed states) to arbitrary values of $n$. Assuming a subset of nodes in an optical network is capable of sending and receiving such probes through intermediate nodes with all-optical switching capabilities, we present a scheme for quickly detecting the links that have suffered a sudden drop in transmissivity. Since quantum probes lose their sensitivity with increasing loss in the channel, we first propose a probe construction algorithm that makes the set of links suffering transmission loss change identifiable, while minimizing the longest distance a probe traverses. We then introduce new cumulative sum (CUSUM) statistics with a stopping rule, which allows us to run the CUSUM algorithm to quickly localize the lossy links using our constructed probes. Finally, we show that the proposed scheme achieves a quantum advantage in decreasing the detection delay.

Related papers

• Quantum-Enhanced Change Detection and Joint Communication-Detection [1.1567011102709834]
  We demonstrate that pre-shared entanglement using two-mode squeezed vacuum states significantly reduces detection latency. The change detection latency is inversely proportional to the quantum relative entropy (QRE), which goes to infinity in the absence of thermal noise.
  arXiv  Detail & Related papers  (2025-04-24T04:17:55Z)
• Quantum-enhanced quickest change detection of transmission loss [0.9633494094538018]
  A sudden increase of loss in an optical communications channel can be caused by a malicious wiretapper, or for a benign reason such as inclement weather in a free-space channel or an unintentional bend in an optical fiber.<n>We show that adding a small amount of squeezing to bright phase-modulated coherent-state pulses can dramatically increase the homodyne detection receiver's sensitivity to change detection in channel loss, without affecting the communications rate.
  arXiv  Detail & Related papers  (2025-03-15T22:18:43Z)
• Enhancing Dispersive Readout of Superconducting Qubits Through Dynamic Control of the Dispersive Shift: Experiment and Theory [47.00474212574662]
  A superconducting qubit is coupled to a large-bandwidth readout resonator. We show a beyond-state-of-the-art two-state-readout error of only 0.25,%$ in 100 ns integration time. The presented results are expected to further boost the performance of new and existing algorithms and protocols.
  arXiv  Detail & Related papers  (2023-07-15T10:30:10Z)
• Joint Channel Estimation and Feedback with Masked Token Transformers in Massive MIMO Systems [74.52117784544758]
  This paper proposes an encoder-decoder based network that unveils the intrinsic frequency-domain correlation within the CSI matrix. The entire encoder-decoder network is utilized for channel compression. Our method outperforms state-of-the-art channel estimation and feedback techniques in joint tasks.
  arXiv  Detail & Related papers  (2023-06-08T06:15:17Z)
• Qubit readouts enabled by qubit cloaking [49.1574468325115]
  Time-dependent drives play a crucial role in quantum computing efforts. They enable single-qubit control, entangling logical operations, as well as qubit readout. Qubit cloaking was introduced in Lled'o, Dassonneville, et al.
  arXiv  Detail & Related papers  (2023-05-01T15:58:25Z)
• Deep Quantum Error Correction [73.54643419792453]
  Quantum error correction codes (QECC) are a key component for realizing the potential of quantum computing. In this work, we efficiently train novel emphend-to-end deep quantum error decoders. The proposed method demonstrates the power of neural decoders for QECC by achieving state-of-the-art accuracy.
  arXiv  Detail & Related papers  (2023-01-27T08:16:26Z)
• Reinforcement-learning calibration of coherent-state receivers on variable-loss optical channels [0.0]
  We study the problem of calibrating a quantum receiver for optical coherent states when transmitted on a quantum optical channel with variable transmissivity. We optimize the error probability of legacy adaptive receivers, such as Kennedy's and Dolinar's, on average with respect to the channel transmissivity distribution.
  arXiv  Detail & Related papers  (2022-03-18T09:12:19Z)
• Opportunities and Limitations in Broadband Sensing [5.86336038845426]
  We introduce the integrated quantum Fisher information and derive inequality bounds that embody fundamental tradeoffs in any sensing protocol. These inequalities show that sensitivity in one frequency range must come at a cost of reduced sensitivity elsewhere. protocols may allow the very rapid detection of a signal with unknown frequency over a very wide bandwidth.
  arXiv  Detail & Related papers  (2022-03-10T18:18:09Z)
• Blind Coherent Preamble Detection via Neural Networks [2.2063018784238984]
  We propose a neural network (NN) sequence detector and timing advanced estimator. We do not replace the whole process of preamble detection by a NN. We propose to use NN only for textitblind coherent combining of the signals in the detector to compensate for the channel effect.
  arXiv  Detail & Related papers  (2021-09-30T09:53:49Z)
• Group Fisher Pruning for Practical Network Compression [58.25776612812883]
  We present a general channel pruning approach that can be applied to various complicated structures. We derive a unified metric based on Fisher information to evaluate the importance of a single channel and coupled channels. Our method can be used to prune any structures including those with coupled channels.
  arXiv  Detail & Related papers  (2021-08-02T08:21:44Z)
• Subexponential rate versus distance with time-multiplexed quantum repeaters [0.9634859579172252]
  Quantum communications capacity using direct transmission over length-$L$ optical fiber scales as $R sim e-alpha L$, where $alpha$ is the fiber's loss coefficient. We show that temporal multiplexing leads to a sub-exponential rate-vs.-distance scaling, i.e., $R sim e-tsqrtalpha L$, which is not attainable with just spatial or spectral multiplexing.
  arXiv  Detail & Related papers  (2021-05-03T16:48:07Z)
• Fault-tolerant Coding for Quantum Communication [71.206200318454]
  encode and decode circuits to reliably send messages over many uses of a noisy channel. For every quantum channel $T$ and every $eps>0$ there exists a threshold $p(epsilon,T)$ for the gate error probability below which rates larger than $C-epsilon$ are fault-tolerantly achievable. Our results are relevant in communication over large distances, and also on-chip, where distant parts of a quantum computer might need to communicate under higher levels of noise.
  arXiv  Detail & Related papers  (2020-09-15T15:10:50Z)
• SADet: Learning An Efficient and Accurate Pedestrian Detector [68.66857832440897]
  This paper proposes a series of systematic optimization strategies for the detection pipeline of one-stage detector. It forms a single shot anchor-based detector (SADet) for efficient and accurate pedestrian detection. Though structurally simple, it presents state-of-the-art result and real-time speed of $20$ FPS for VGA-resolution images.
  arXiv  Detail & Related papers  (2020-07-26T12:32:38Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.