Details
| Original language | English |
|---|---|
| Article number | 020602 |
| Journal | Physical review letters |
| Volume | 131 |
| Issue number | 2 |
| Publication status | Published - 14 Jul 2023 |
| Externally published | Yes |
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.
ASJC Scopus subject areas
- Physics and Astronomy(all)
- General Physics and Astronomy
Cite this
- Standard
- Harvard
- Apa
- Vancouver
- BibTeX
- RIS
In: Physical review letters, Vol. 131, No. 2, 020602, 14.07.2023.
Research output: Contribution to journal › Article › Research › peer review
}
TY - JOUR
T1 - Ultimate Limits for Quickest Quantum Change-Point Detection
AU - Fanizza, Marco
AU - Hirche, Christoph
AU - Calsamiglia, John
N1 - Funding Information: We thank Andreas Winter and Milán Mosonyi for useful discussions. This work was supported by the QuantERA grant C’MON-QSENS!, by Spanish MICINN PCI2019-111869-2 and Spanish Agencia Estatal de Investigación, project PID2019–107609GB-I00/AEI/10.13039/501100011033 and cofunded by the European Union Regional Development Fund within the ERDF Operational Program of Catalunya (project QuantumCat, ref. 001-P-001644). C. H. has received funding from the European Union’s Horizon 2020 research and innovation program under the Marie Sklodowska-Curie Grant Agreement No. H2020-MSCA-IF-2020-101025848. J. C. also acknowledges support from ICREA Academia award. M. F. is supported by Juan de la Cierva—Formaciòn (Spanish MICIN project FJC2021-047404-I), with funding from MCIN/AEI/10.13039/501100011033 and European Union “NextGenerationEU”/PRTR.
PY - 2023/7/14
Y1 - 2023/7/14
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=85164943995&partnerID=8YFLogxK
U2 - 10.1103/PhysRevLett.131.020602
DO - 10.1103/PhysRevLett.131.020602
M3 - Article
C2 - 37505971
AN - SCOPUS:85164943995
VL - 131
JO - Physical review letters
JF - Physical review letters
SN - 0031-9007
IS - 2
M1 - 020602
ER -