Unambiguous discrimination of the change point for quantum channels
arXiv:2508.06785 · doi:10.1103/k7tf-j2cb
Abstract
Identifying the precise moment when a quantum channel undergoes a change is a fundamental problem in quantum information theory. We study how accurately one can determine the time at which a channel transitions to another. We investigate the quantum limit of the average success probability in unambiguous discrimination, in which errors are completely avoided by allowing inconclusive results with a certain probability. This problem can be viewed as a quantum process discrimination task, where the process consists of a sequence of quantum channels; however, obtaining analytical solutions for quantum process discrimination is generally extremely challenging. In this paper, we propose a method to derive lower and upper bounds on the maximum average success probability in unambiguous discrimination. In particular, when the channels before and after the change are unitary, we show that the maximum average success probability can be analytically expressed in terms of the length of the channel sequence and the discrimination limits for the two channels.
References in corpus (9)
- Theoretical framework for quantum networks
- Quantum Circuits Architecture
- Using entanglement improves precision of quantum measurements
- Unambiguous state discrimination in quantum cryptography with weak coherent states
- Exact Identification of a Quantum Change Point
- Single-shot discrimination of quantum unitary processes
- Identification of a reversible quantum gate: assessing the resources
- Generalized quantum process discrimination problems
- Identifying quantum change points for Hamiltonians