Unambiguous discrimination of the change point for quantum channels

• URL: http://arxiv.org/abs/2508.06785v1
• Date: Sat, 09 Aug 2025 02:26:58 GMT
• Title: Unambiguous discrimination of the change point for quantum channels
• Authors: Kenji Nakahira,
• Abstract summary: Identifying the precise moment when a quantum channel undergoes a change is a fundamental problem in quantum information theory.<n>We study how accurately one can determine the time at which a channel transitions to another.
• Score: 0.5439020425818999
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• 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.

Related papers

• Quantum-Classical Separation in Bounded-Resource Tasks Arising from Measurement Contextuality [107.84586711462556]
  We show that quantum contextuality enables certain tasks to be performed with success probabilities beyond classical limits.<n>Our work proposes novel ways to benchmark quantum processors using contextuality-based algorithms.
  arXiv  Detail & Related papers  (2025-12-01T23:54:32Z)
• Optimizing entanglement distribution via noisy quantum channels [44.99833362998488]
  Entanglement distribution is a crucial problem in quantum information science.<n>We investigate strategies for distributing quantum entanglement between two distant parties through noisy quantum channels.
  arXiv  Detail & Related papers  (2025-06-06T13:48:20Z)
• Bounds for Revised Unambiguous Discrimination Tasks of Quantum Resources [0.9790236766474201]
  Quantum state discrimination is a fundamental task that is meaningful in quantum information theory. We show an upper bound of the success probability for a revised discrimination task in the unasymptotic and unambiguous scenarios. We also show the advantage of the quantum by considering a quantifier on a set of semidefinite positive operators.
  arXiv  Detail & Related papers  (2024-10-06T14:52:17Z)
• Normal quantum channels and Markovian correlated two-qubit quantum errors [77.34726150561087]
  We study general normally'' distributed random unitary transformations. On the one hand, a normal distribution induces a unital quantum channel. On the other hand, the diffusive random walk defines a unital quantum process.
  arXiv  Detail & Related papers  (2023-07-25T15:33:28Z)
• Simple Tests of Quantumness Also Certify Qubits [69.96668065491183]
  A test of quantumness is a protocol that allows a classical verifier to certify (only) that a prover is not classical. We show that tests of quantumness that follow a certain template, which captures recent proposals such as (Kalai et al., 2022) can in fact do much more. Namely, the same protocols can be used for certifying a qubit, a building-block that stands at the heart of applications such as certifiable randomness and classical delegation of quantum computation.
  arXiv  Detail & Related papers  (2023-03-02T14:18:17Z)
• Quantum machine learning channel discrimination [0.0]
  In the problem of quantum channel discrimination, one distinguishes between a given number of quantum channels. This work studies applications of variational quantum circuits and machine learning techniques for discriminating such channels.
  arXiv  Detail & Related papers  (2022-06-20T18:00:05Z)
• Stochastic approximate state conversion for entanglement and general quantum resource theories [41.94295877935867]
  An important problem in any quantum resource theory is to determine how quantum states can be converted into each other. Very few results have been presented on the intermediate regime between probabilistic and approximate transformations. We show that these bounds imply an upper bound on the rates for various classes of states under probabilistic transformations. We also show that the deterministic version of the single copy bounds can be applied for drawing limitations on the manipulation of quantum channels.
  arXiv  Detail & Related papers  (2021-11-24T17:29:43Z)
• Towards the ultimate limits of quantum channel discrimination and quantum communication [9.513467246615642]
  This work advances the understanding of quantum channel discrimination and its fundamental limits.<n>We develop new tools for quantum divergences, including sharper bounds on the quantum hypothesis testing relative entropy.<n>We recast quantum communication tasks as discrimination problems, uncovering deep connections between channel capacities, channel discrimination, and the mathematical structure of channel divergences.
  arXiv  Detail & Related papers  (2021-10-28T01:48:13Z)
• Excluding false negative error in certification of quantum channels [68.8204255655161]
  This work focuses on the scenario when the false negative error cannot occur, even if it leads to the growth of the probability of false positive error. We establish a condition when it is possible to exclude false negative error after a finite number of queries to the quantum channel in parallel.
  arXiv  Detail & Related papers  (2021-06-04T09:41:11Z)
• Simple upper and lower bounds on the ultimate success probability for discriminating arbitrary finite-dimensional quantum processes [2.538209532048866]
  We present a simple upper bound on the ultimate success probability for discriminating arbitrary quantum processes. In the special case of multi-shot channel discrimination, it can be shown that the ultimate success probability increases by at most a constant factor determined by the given channels. We also present a lower bound based on Bayesian updating, which has a low computational cost.
  arXiv  Detail & Related papers  (2020-12-27T01:14:23Z)
• Ultimate limits for multiple quantum channel discrimination [0.966840768820136]
  This paper studies the problem of hypothesis testing with quantum channels. We establish a lower limit for the ultimate error probability affecting the discrimination of an arbitrary number of quantum channels. We also show that this lower bound is achievable when the channels have certain symmetries.
  arXiv  Detail & Related papers  (2020-07-29T03:08:48Z)
• Boundaries of quantum supremacy via random circuit sampling [69.16452769334367]
  Google's recent quantum supremacy experiment heralded a transition point where quantum computing performed a computational task, random circuit sampling. We examine the constraints of the observed quantum runtime advantage in a larger number of qubits and gates.
  arXiv  Detail & Related papers  (2020-05-05T20:11:53Z)
• Coherent Quantum Channel Discrimination [6.345523830122166]
  Coherent quantum channel discrimination is a quantum interactive proof system between a verifier and a prover. I prove that this success probability does not increase under the action of a quantum superchannel. I provide an explicit semi-definite program that can compute the success probability.
  arXiv  Detail & Related papers  (2020-01-08T18:47:08Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.