论文标题
最快量子更改点检测的最终限制
Ultimate limits for quickest quantum change-point detection
论文作者
论文摘要
检测数据流的突然变化至关重要，因为它们通常是由无人看管的重要后果触发的。最快的更改点检测已成为一个重要的顺序分析原始分析，旨在设计程序，以最大程度地减少受限制的预期错误警报时间的预期检测延迟。我们提出了量子数据流的基本原始性的量子对应物。在最通用的量子检测策略下，当预期的错误警报的预期时间渐近较大时，我们给出了平均最小延迟的较低限制，这是由一系列自适应集体（潜在弱）测量的序列对量子数据不断增长的串。此外，我们基于对独立样本块的重复测量的重复测量提供了特定的策略，这些策略渐近地达到了下限，从而确定了最快变化点检测的最终量子限制。最后，我们讨论量子通道中的在线变更点检测。
Detecting abrupt changes in data streams is crucial because they are often triggered by events that have important consequences if left unattended. Quickest change point detection has become a vital sequential analysis primitive that aims at designing procedures that minimize the expected detection delay of a change subject to a bounded expected false alarm time. We put forward the quantum counterpart of this fundamental primitive on streams of quantum data. We give a lower-bound on the mean minimum delay when the expected time of a false alarm is asymptotically large, under the most general quantum detection strategy, which is given by a sequence of adaptive collective (potentially weak) measurements on the growing string of quantum data. In addition, we give particular strategies based on repeated measurements on independent blocks of samples, that asymptotically attain the lower-bound, and thereby establish the ultimate quantum limit for quickest change point detection. Finally, we discuss online change point detection in quantum channels.
