← Back to papers
Asymptotically Optimal Quantum Universal Quickest Change Detection
Arick Grootveld, Haodong Yang, Nandan Sriranga, Biao Chen, Venkata Gandikota, Jason Pollack·February 3, 2026
Quantum Physicscs.IT
AI Breakdown
Get a structured breakdown of this paper — what it's about, the core idea, and key takeaways for the field.
Abstract
This paper investigates the quickest change detection of quantum states in a universal setting: specifically, where the post-change quantum state is not known a priori. We establish the asymptotic optimality of a two-stage approach in terms of worst average delay to detection. The first stage employs block POVMs with classical outputs that preserve quantum relative entropy to arbitrary precision. The second stage leverages a recently proposed windowed-CUSUM algorithm that is known to be asymptotically optimal for quickest change detection with an unknown post-change distribution in the classical setting.