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

Quantum Information and Measurement (QIM)

The Identification of a Quantum Change Point

R. Muñoz-Tapia, Gael Sentís, Giulio Chiribella, John Calsamigia, E. Bagán

Published Jan 1, 2017• 0 citations
Publisher

Abstract

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.
DOI
10.1364/qim.2017.qw3b.3

Related papers

Exact Identification of a Quantum Change Point

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

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.

arXiv:1707.07769•Physical Review Letters•Oct 6, 2017•32 citations

Discrimination of the change point in a quantum setting

Daiki Akimoto, Masahito Hayashi

In the change point problem, we determine when the observed distribution has changed to another one. We expand this problem to a quantum case where copies of an unknown pure state are being distributed. That is, we estimate when the distributed quantum pure state is changed. As the most fundamental case, we treat the problem of deciding the true change point ${t}_{c}$ between the two given candidates ${t}_{1}$ and ${t}_{2}$. Our problem is mathematically equal to identifying a given state with one of the two unknown states when multiple copies of the states are provided. The minimum of the averaged error probability is given and the optimal positive operator-valued measure (POVM) is given to obtain it when the initial and final quantum pure states are subject to the invariant prior. We also compute the error probability for deciding the change point under the above POVM when the initial and final quantum pure states are fixed. These analytical results allow us to calculate the value in the asymptotic case.

arXiv:1102.2555•Physical Review A•May 27, 2011•24 citations

Quantum Change Point

Gael Sentís, E. Bagán, John Calsamiglia +2 more

Sudden changes are ubiquitous in nature. Identifying them is crucial for a number of applications in biology, medicine, and social sciences. Here we take the problem of detecting sudden changes to the quantum domain. We consider a source that emits quantum particles in a default state, until a point where a mutation occurs that causes the source to switch to another state. The problem is then to find out where the change occurred. We determine the maximum probability of correctly identifying the change point, allowing for collective measurements on the whole sequence of particles emitted by the source. Then, we devise online strategies where the particles are measured individually and an answer is provided as soon as a new particle is received. We show that these online strategies substantially underperform the optimal quantum measurement, indicating that quantum sudden changes, although happening locally, are better detected globally.

arXiv:1605.01916•Physical Review Letters•Oct 7, 2016•48 citations

When Is a Non-Markovian Quantum Process Classical?

Simon Milz, Dario Egloff, Philip Taranto +4 more

A new paradigm for separating what is inherently quantum from what is classical relies solely on observable quantities and makes it possible to identify the mechanisms leading to nonclassicality in a wide range of situations.

arXiv:1907.05807•Physical Review X•Dec 10, 2020•119 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

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
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.
In the change point problem, we determine when the observed distribution has changed to another one. We expand this problem to a quantum case where copies of an unknown pure state are being distributed. That is, we estimate when the distributed quantum pure state is changed. As the most fundamental case, we treat the problem of deciding the true change point tc{t}_{c}tc​ between the two given candidates t1{t}_{1}t1​ and t2{t}_{2}t2​. Our problem is mathematically equal to identifying a given state with one of the two unknown states when multiple copies of the states are provided. The minimum of the averaged error probability is given and the optimal positive operator-valued measure (POVM) is given to obtain it when the initial and final quantum pure states are subject to the invariant prior. We also compute the error probability for deciding the change point under the above POVM when the initial and final quantum pure states are fixed. These analytical results allow us to calculate the value in the asymptotic case.
Sudden changes are ubiquitous in nature. Identifying them is crucial for a number of applications in biology, medicine, and social sciences. Here we take the problem of detecting sudden changes to the quantum domain. We consider a source that emits quantum particles in a default state, until a point where a mutation occurs that causes the source to switch to another state. The problem is then to find out where the change occurred. We determine the maximum probability of correctly identifying the change point, allowing for collective measurements on the whole sequence of particles emitted by the source. Then, we devise online strategies where the particles are measured individually and an answer is provided as soon as a new particle is received. We show that these online strategies substantially underperform the optimal quantum measurement, indicating that quantum sudden changes, although happening locally, are better detected globally.
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.
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.