Asymptotically Optimal Quantum Universal Quickest Change Detection
Summarize this article with:
Quantum Physics arXiv:2602.02950 (quant-ph) [Submitted on 3 Feb 2026] Title:Asymptotically Optimal Quantum Universal Quickest Change Detection Authors:Arick Grootveld, Haodong Yang, Nandan Sriranga, Biao Chen, Venkata Gandikota, Jason Pollack View a PDF of the paper titled Asymptotically Optimal Quantum Universal Quickest Change Detection, by Arick Grootveld and 5 other authors View PDF HTML (experimental) 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. Subjects: Quantum Physics (quant-ph); Information Theory (cs.IT) Cite as: arXiv:2602.02950 [quant-ph] (or arXiv:2602.02950v1 [quant-ph] for this version) https://doi.org/10.48550/arXiv.2602.02950 Focus to learn more arXiv-issued DOI via DataCite (pending registration) Submission history From: Arick Grootveld [view email] [v1] Tue, 3 Feb 2026 00:49:05 UTC (87 KB) Full-text links: Access Paper: View a PDF of the paper titled Asymptotically Optimal Quantum Universal Quickest Change Detection, by Arick Grootveld and 5 other authorsView PDFHTML (experimental)TeX Source view license Current browse context: quant-ph new | recent | 2026-02 Change to browse by: cs cs.IT math math.IT References & Citations INSPIRE HEP NASA ADSGoogle Scholar Semantic Scholar export BibTeX citation Loading... BibTeX formatted citation × loading... Data provided by: Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer (What is the Explorer?) Connected Papers Toggle Connected Papers (What is Connected Papers?) Litmaps Toggle Litmaps (What is Litmaps?) scite.ai Toggle scite Smart Citations (What are Smart Citations?) Code, Data, Media Code, Data and Media Associated with this Article alphaXiv Toggle alphaXiv (What is alphaXiv?) Links to Code Toggle CatalyzeX Code Finder for Papers (What is CatalyzeX?) DagsHub Toggle DagsHub (What is DagsHub?) GotitPub Toggle Gotit.pub (What is GotitPub?) Huggingface Toggle Hugging Face (What is Huggingface?) Links to Code Toggle Papers with Code (What is Papers with Code?) ScienceCast Toggle ScienceCast (What is ScienceCast?) Demos Demos Replicate Toggle Replicate (What is Replicate?) Spaces Toggle Hugging Face Spaces (What is Spaces?) Spaces Toggle TXYZ.AI (What is TXYZ.AI?) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower (What are Influence Flowers?) Core recommender toggle CORE Recommender (What is CORE?) Author Venue Institution Topic About arXivLabs arXivLabs: experimental projects with community collaborators arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs. Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)