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:1707.07769 · Physical Review Letters

Exact Identification of a Quantum Change Point

Gael Sentís, John Calsamiglia, R. Muñoz-Tapia

Published Oct 6, 2017• 32 citations
arXivHTMLPDF

Abstract

The detection of change points is a pivotal task in statistical analysis. In the quantum realm, it is a new primitive where one aims at identifying the point where a source that supposedly prepares a sequence of particles in identical quantum states starts preparing a mutated one. We obtain the optimal procedure to identify the change point with certainty-naturally at the price of having a certain probability of getting an inconclusive answer. We obtain the analytical form of the optimal probability of successful identification for any length of the particle sequence. We show that the conditional success probabilities of identifying each possible change point show an unexpected oscillatory behavior. We also discuss local (online) protocols and compare them with the optimal procedure.

DOI
10.1103/physrevlett.119.140506

Related papers

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

The Identification of a Quantum Change Point

R. Muñoz-Tapia, Gael Sentís, Giulio Chiribella +2 more

We take the paradigmatic change point problem into the quantum realm. Quantum particles produced in a default state suddenly mutate to another state. We compute the optimal probability of identifying the point of mutation.

Quantum Information and Measurement (QIM)•Jan 1, 2017•0 citations

Experimentally detecting a quantum change point via the Bayesian inference

Shang Yu, Chang-Jiang Huang, Jian‐Shun Tang +15 more

Detecting a change point is a crucial task in statistics that has been recently extended to the quantum realm. A source state generator that emits a series of single photons in a default state suffers an alteration at some point and starts to emit photons in a mutated state. The problem consists in identifying the point where the change took place. In this Rapid Communication, we build a pseudo-on-demand single-photon source to prepare the photon sequences, and consider a learning agent that applies Bayesian inference on experimental data to solve this problem. This learning machine adjusts the measurement over each photon according to the past experimental results and finds the change position in an online fashion. Our results show that the local-detection success probability can be largely improved by using such a machine-learning technique. This protocol provides a tool for improvement in many applications where a sequence of identical quantum states is required.

arXiv:1801.07508•Physical Review A•Oct 15, 2018•6 citations

Identification of Quantum Change Points for Hamiltonians

Kenji Nakahira

Detecting sudden changes in the environment is crucial in many statistical applications. We mainly focus on identifying sudden changes in weak signals transmitted by electromagnetic or gravitational waves. Assuming that the Hamiltonians representing the signals before and after the change are known, we aim to find a discrimination strategy that can detect the change point with the best possible accuracy. This problem has potential applications in accurately detecting the precise timing of events such as stellar explosions, foreign object intrusions, specific chemical bonds, and phase transitions. We formulate this problem as a quantum process discrimination problem by discretizing the time evolution of a quantum system as a sequence of unitary channels. However, due to the complexity of the dynamics, solving such a multiple process discrimination problem is typically challenging. We demonstrate that the maximum success probability for the Hamiltonian change point problem with any finite number of candidate change points can be determined and has a simple analytical form.

arXiv:2305.18872•Physical Review Letters•Nov 22, 2023•4 citations

Quantum change point and entanglement distillation

Abhishek Banerjee, Pratapaditya Bej, Somshubhro Bandyopadhyay

In a quantum change point problem, a source emitting particles in a fixed quantum state (default) switches to a different state at some stage, and the objective is to identify when the change happened by measuring a sequence of particles emitted from such a source. Motivated by entanglement-sharing protocols in quantum information, we study this problem within the paradigm of local operations and classical communication (LOCC). Here, we consider a source that emits entangled pairs in a default state, but starts producing another entangled state (mutation) at a later stage. Then, a sequence of entangled pairs prepared from such a source and shared between distant observers cannot be used for quantum information processing tasks as the identity of each entangled pair remains unknown. We show that identifying the change point using LOCC leads to the distillation of free entangled pairs. In particular, if the default and the mutation are mutually orthogonal, there exists an efficient LOCC protocol that identifies the change point without fail and distills a sufficiently large number of pairs. However, if they are nonorthogonal, there is a probability of failure. In this case, we compute the number of entangled pairs that may be obtained on average. We also consider a relaxation of the two-state problem where the mutation is not known a priori, but instead belongs to a known set. Here we show that local distinguishability plays a crucial role: if the default and the possible mutations are locally distinguishable, the problem reduces to the two-state problem with orthogonal states, but if not, one may still identify the mutation, the change point, and distill entanglement, as we illustrate with a concrete example.

arXiv:2308.15148•Physical Review A•Apr 9, 2024•2 citations

Identification of malfunctioning quantum devices

Michalis Skotiniotis, Santiago Llorens, Ronja Hotz +2 more

We consider the problem of correctly identifying a malfunctioning quantum device that forms part of a network of N such devices, which can be considered as the quantum analog of classical anomaly detection. In the case where the devices in question are sources assumed to prepare identical quantum pure states, with the faulty source producing a different anomalous pure state, we show that the optimal probability of successful identification requires a global quantum measurement. We also put forth several local measurement strategies—both adaptive and nonadaptive—that achieve the same optimal probability of success in the limit where the number of devices to be checked is large. In the case where the faulty device performs a known unitary operation, we show that the use of entangled probes provides an improvement that even allows perfect identification for values of the unitary parameter that surpass a certain threshold. Finally, if the faulty device implements a known qubit channel, we find that the optimal probability for detecting the position of rank-one and rank-two Pauli channels can be achieved by product state inputs and separable measurements for any size of network, whereas for rank-three and general amplitude damping channels, optimal identification requires entanglement with N qubit ancillas. Published by the American Physical Society 2024

arXiv:1808.02729•Physical Review Research•Sep 23, 2024•15 citations
The detection of change points is a pivotal task in statistical analysis. In the quantum realm, it is a new primitive where one aims at identifying the point where a source that supposedly prepares a sequence of particles in identical quantum states starts preparing a mutated one. We obtain the optimal procedure to identify the change point with certainty-naturally at the price of having a certain probability of getting an inconclusive answer. We obtain the analytical form of the optimal probability of successful identification for any length of the particle sequence. We show that the conditional success probabilities of identifying each possible change point show an unexpected oscillatory behavior. We also discuss local (online) protocols and compare them with the optimal procedure.
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.
Detecting a change point is a crucial task in statistics that has been recently extended to the quantum realm. A source state generator that emits a series of single photons in a default state suffers an alteration at some point and starts to emit photons in a mutated state. The problem consists in identifying the point where the change took place. In this Rapid Communication, we build a pseudo-on-demand single-photon source to prepare the photon sequences, and consider a learning agent that applies Bayesian inference on experimental data to solve this problem. This learning machine adjusts the measurement over each photon according to the past experimental results and finds the change position in an online fashion. Our results show that the local-detection success probability can be largely improved by using such a machine-learning technique. This protocol provides a tool for improvement in many applications where a sequence of identical quantum states is required.
Detecting sudden changes in the environment is crucial in many statistical applications. We mainly focus on identifying sudden changes in weak signals transmitted by electromagnetic or gravitational waves. Assuming that the Hamiltonians representing the signals before and after the change are known, we aim to find a discrimination strategy that can detect the change point with the best possible accuracy. This problem has potential applications in accurately detecting the precise timing of events such as stellar explosions, foreign object intrusions, specific chemical bonds, and phase transitions. We formulate this problem as a quantum process discrimination problem by discretizing the time evolution of a quantum system as a sequence of unitary channels. However, due to the complexity of the dynamics, solving such a multiple process discrimination problem is typically challenging. We demonstrate that the maximum success probability for the Hamiltonian change point problem with any finite number of candidate change points can be determined and has a simple analytical form.
In a quantum change point problem, a source emitting particles in a fixed quantum state (default) switches to a different state at some stage, and the objective is to identify when the change happened by measuring a sequence of particles emitted from such a source. Motivated by entanglement-sharing protocols in quantum information, we study this problem within the paradigm of local operations and classical communication (LOCC). Here, we consider a source that emits entangled pairs in a default state, but starts producing another entangled state (mutation) at a later stage. Then, a sequence of entangled pairs prepared from such a source and shared between distant observers cannot be used for quantum information processing tasks as the identity of each entangled pair remains unknown. We show that identifying the change point using LOCC leads to the distillation of free entangled pairs. In particular, if the default and the mutation are mutually orthogonal, there exists an efficient LOCC protocol that identifies the change point without fail and distills a sufficiently large number of pairs. However, if they are nonorthogonal, there is a probability of failure. In this case, we compute the number of entangled pairs that may be obtained on average. We also consider a relaxation of the two-state problem where the mutation is not known a priori, but instead belongs to a known set. Here we show that local distinguishability plays a crucial role: if the default and the possible mutations are locally distinguishable, the problem reduces to the two-state problem with orthogonal states, but if not, one may still identify the mutation, the change point, and distill entanglement, as we illustrate with a concrete example.
We consider the problem of correctly identifying a malfunctioning quantum device that forms part of a network of N such devices, which can be considered as the quantum analog of classical anomaly detection. In the case where the devices in question are sources assumed to prepare identical quantum pure states, with the faulty source producing a different anomalous pure state, we show that the optimal probability of successful identification requires a global quantum measurement. We also put forth several local measurement strategies—both adaptive and nonadaptive—that achieve the same optimal probability of success in the limit where the number of devices to be checked is large. In the case where the faulty device performs a known unitary operation, we show that the use of entangled probes provides an improvement that even allows perfect identification for values of the unitary parameter that surpass a certain threshold. Finally, if the faulty device implements a known qubit channel, we find that the optimal probability for detecting the position of rank-one and rank-two Pauli channels can be achieved by product state inputs and separable measurements for any size of network, whereas for rank-three and general amplitude damping channels, optimal identification requires entanglement with N qubit ancillas. Published by the American Physical Society 2024