Unambiguous discrimination of the change point for quantum channels

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteur principal: Nakahira, Kenji
Format: Preprint
Publié: 2025
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866915935545196544
author Nakahira, Kenji
author_facet Nakahira, Kenji
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_2508_06785
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Unambiguous discrimination of the change point for quantum channels
Nakahira, Kenji
Quantum Physics
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.
title Unambiguous discrimination of the change point for quantum channels
topic Quantum Physics
url https://arxiv.org/abs/2508.06785