Online optimal exact identification of a quantum change point

Abstract

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.

References in corpus (4)

• Optimal conclusive discrimination of two states can be achieved locally
• Quantum change point
• Exact Identification of a Quantum Change Point
• Experimentally detecting a quantum change point via Bayesian inference

Cited by in corpus (11)

• Quantum Anomaly Detection with Density Estimation and Multivariate Gaussian Distribution
• Quantum Sequential Hypothesis Testing
• Ultimate limits for quickest quantum change-point detection
• Local unambiguous discrimination of symmetric ternary states
• Certified answers for ordered quantum discrimination problems
• Identification of malfunctioning quantum devices
• Quantum-enhanced quickest change detection of transmission loss
• Multi-partite subspaces containing no locally inaccessible information
• Quantum change point and entanglement distillation
• Testing identity of collections of quantum states: sample complexity analysis
• Online identification of symmetric pure states