Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2208.03265 · Physical Review Letters

Ultimate Limits for Quickest Quantum Change-Point Detection

Marco Fanizza, Christoph Hirche, John Calsamiglia

Published Jul 14, 2023• 19 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1103/physrevlett.131.020602

Related papers

Quickest Change-point Detection With Continuous-Variable Quantum States

Tiju Cherian John, Christos N. Gagatsos, Boulat A. Bash

We generalize the quantum CUSUM (QUSUM) algorithm for quickest change-point detection, analyzed in finite dimensions by Fanizza, Hirche, and Calsamiglia (Phys. Rev. Lett. 131, 020602, 2023), to infinite-dimensional quantum systems. We employ a novel generalization of Hayashi’s theorem (Hayashi, J. Phys. A: Math. Gen. 34, 3413, 2001) concerning the asymptotics of quantum relative entropy, which we adapt to the infinite-dimensional setting. This enables us to prove that the QUSUM strategy retains its asymptotic optimality, characterized by the relationship between the expected detection delay and the average false alarm time for any pair of states with finite relative entropy. Thus, our findings apply broadly, including continuous-variable systems (e.g., Gaussian states), facilitating the development of optimal change-point detection schemes in quantum optics and other physical platforms, and rendering experimental verification feasible.

arXiv:2504.16259•IEEE Information Theory Workshop (ITW)•Sep 29, 2025•4 citations

Online strategies for exactly identifying a quantum change point

Gael Sentís, Esteban Martínez-Vargas, R. Muñoz-Tapia

We consider online detection strategies for identifying a change point in a stream of quantum particles allegedly prepared in identical states. We show that the identification of the change point can be done without error via sequential local measurements while attaining the optimal performance bound set by quantum mechanics. In this way, we establish the task of exactly identifying a quantum change point as an instance where local protocols are as powerful as global ones. The optimal online detection strategy requires only one bit of memory between subsequent measurements, and it is amenable to experimental realization with current technology.

arXiv:1802.00280•Physical Review A•Nov 5, 2018•15 citations

Asymptotically Optimal Quantum Universal Quickest Change Detection

Arick Grootveld, Haodong Yang, Nandan Sriranga +3 more

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.

quant-pharXiv:2602.02950•IEEE International Symposium on Information Theory (ISIT)•Feb 4, 2026•2 citations

Sequential analysis in a continuous spin-noise quantum sensor

Elisabet Roda-Salichs, Giulio Gasbarri, Antoni Alou +5 more

Many control and detection applications require real-time analysis of signals from sensors, in order to quickly and accurately act upon events revealed by the sensors. Such signal analysis benefits from statistical models of signal and sensor behavior. This creates a need for data analysis methods that are simultaneously model based, computationally efficient, and causal, in the sense that they employ only sensor data available prior to a specific point in time. In this work, we implement sequential data analysis techniques on a spin-noise-based quantum sensor to perform two key tasks: hypothesis testing and quickest change-point detection. These online protocols allow us to detect weak magnetic fields by adaptively collecting measurement data until a predefined confidence threshold is reached. We demonstrate these methods in a realistic experimental setting and derive performance bounds for the achievable precision and response time. Our approach has potential utility when detecting small perturbations to the magnetic field, in both applied and fundamental contexts including biomagnetism, geophysical surveys, detection of concealed materials, searches for dark matter candidates, and exotic spin interactions. Our results demonstrate that sequential techniques enable faster and more sensitive detection, making them a powerful tool for quantum sensing.

arXiv:2509.16177•Physical Review Research•Jun 10, 2026•1 citation

Universal Sequential Changepoint Detection of Quantum Observables via Classical Shadows

Matteo Zecchin, Osvaldo Simeone, Aaditya Ramdas

We study sequential quantum changepoint detection in settings where the pre- and post-change regimes are specified through constraints on the expectation values of a finite set of observables. We consider an architecture with separate measurement and detection modules, and assume that the observables relevant to the detector are unknown to the measurement device. For this scenario, we introduce shadow-based sequential changepoint e-detection (eSCD), a novel protocol that combines a universal measurement strategy based on classical shadows with a nonparametric sequential test built on e-detectors. Classical shadows provide universality with respect to the detector's choice of observables, while the e-detector framework enables explicit control of the average run length (ARL) to false alarm. Under an ARL constraint, we establish finite-sample guarantees on the worst-case expected detection delay of eSCD. Numerical experiments validate the theory and demonstrate that eSCD achieves performance competitive with observable-specific measurement strategies, while retaining full measurement universality.

quant-pharXiv:2602.11846•Feb 13, 2026•1 citation

Quantum Sequential Hypothesis Testing

Esteban Martínez-Vargas, Christoph Hirche, Gael Sentís +4 more

We introduce sequential analysis in quantum information processing, by focusing on the fundamental task of quantum hypothesis testing. In particular, our goal is to discriminate between two arbitrary quantum states with a prescribed error threshold ε when copies of the states can be required on demand. We obtain ultimate lower bounds on the average number of copies needed to accomplish the task. We give a block-sampling strategy that allows us to achieve the lower bound for some classes of states. The bound is optimal in both the symmetric as well as the asymmetric setting in the sense that it requires the least mean number of copies out of all other procedures, including the ones that fix the number of copies ahead of time. For qubit states we derive explicit expressions for the minimum average number of copies and show that a sequential strategy based on fixed local measurements outperforms the best collective measurement on a predetermined number of copies. Whereas for general states the number of copies increases as log1/ε, for pure states sequential strategies require a finite average number of samples even in the case of perfect discrimination, i.e., ε=0.

arXiv:2011.10773•Physical Review Letters•May 6, 2021•37 citations
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.
We generalize the quantum CUSUM (QUSUM) algorithm for quickest change-point detection, analyzed in finite dimensions by Fanizza, Hirche, and Calsamiglia (Phys. Rev. Lett. 131, 020602, 2023), to infinite-dimensional quantum systems. We employ a novel generalization of Hayashi’s theorem (Hayashi, J. Phys. A: Math. Gen. 34, 3413, 2001) concerning the asymptotics of quantum relative entropy, which we adapt to the infinite-dimensional setting. This enables us to prove that the QUSUM strategy retains its asymptotic optimality, characterized by the relationship between the expected detection delay and the average false alarm time for any pair of states with finite relative entropy. Thus, our findings apply broadly, including continuous-variable systems (e.g., Gaussian states), facilitating the development of optimal change-point detection schemes in quantum optics and other physical platforms, and rendering experimental verification feasible.
We consider online detection strategies for identifying a change point in a stream of quantum particles allegedly prepared in identical states. We show that the identification of the change point can be done without error via sequential local measurements while attaining the optimal performance bound set by quantum mechanics. In this way, we establish the task of exactly identifying a quantum change point as an instance where local protocols are as powerful as global ones. The optimal online detection strategy requires only one bit of memory between subsequent measurements, and it is amenable to experimental realization with current technology.
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.
Many control and detection applications require real-time analysis of signals from sensors, in order to quickly and accurately act upon events revealed by the sensors. Such signal analysis benefits from statistical models of signal and sensor behavior. This creates a need for data analysis methods that are simultaneously model based, computationally efficient, and causal, in the sense that they employ only sensor data available prior to a specific point in time. In this work, we implement sequential data analysis techniques on a spin-noise-based quantum sensor to perform two key tasks: hypothesis testing and quickest change-point detection. These online protocols allow us to detect weak magnetic fields by adaptively collecting measurement data until a predefined confidence threshold is reached. We demonstrate these methods in a realistic experimental setting and derive performance bounds for the achievable precision and response time. Our approach has potential utility when detecting small perturbations to the magnetic field, in both applied and fundamental contexts including biomagnetism, geophysical surveys, detection of concealed materials, searches for dark matter candidates, and exotic spin interactions. Our results demonstrate that sequential techniques enable faster and more sensitive detection, making them a powerful tool for quantum sensing.
We study sequential quantum changepoint detection in settings where the pre- and post-change regimes are specified through constraints on the expectation values of a finite set of observables. We consider an architecture with separate measurement and detection modules, and assume that the observables relevant to the detector are unknown to the measurement device. For this scenario, we introduce shadow-based sequential changepoint e-detection (eSCD), a novel protocol that combines a universal measurement strategy based on classical shadows with a nonparametric sequential test built on e-detectors. Classical shadows provide universality with respect to the detector's choice of observables, while the e-detector framework enables explicit control of the average run length (ARL) to false alarm. Under an ARL constraint, we establish finite-sample guarantees on the worst-case expected detection delay of eSCD. Numerical experiments validate the theory and demonstrate that eSCD achieves performance competitive with observable-specific measurement strategies, while retaining full measurement universality.
We introduce sequential analysis in quantum information processing, by focusing on the fundamental task of quantum hypothesis testing. In particular, our goal is to discriminate between two arbitrary quantum states with a prescribed error threshold ε when copies of the states can be required on demand. We obtain ultimate lower bounds on the average number of copies needed to accomplish the task. We give a block-sampling strategy that allows us to achieve the lower bound for some classes of states. The bound is optimal in both the symmetric as well as the asymmetric setting in the sense that it requires the least mean number of copies out of all other procedures, including the ones that fix the number of copies ahead of time. For qubit states we derive explicit expressions for the minimum average number of copies and show that a sequential strategy based on fixed local measurements outperforms the best collective measurement on a predetermined number of copies. Whereas for general states the number of copies increases as log1/ε, for pure states sequential strategies require a finite average number of samples even in the case of perfect discrimination, i.e., ε=0.