Simple upper and lower bounds on the ultimate success probability for discriminating arbitrary finite-dimensional quantum processes

Abstract

We consider the problem of discriminating finite-dimensional quantum processes, also called quantum supermaps, that can consist of multiple time steps. Obtaining the ultimate performance for discriminating quantum processes is of fundamental importance, but is challenging mainly due to the necessity of considering all discrimination strategies allowed by quantum mechanics, including entanglement-assisted strategies and adaptive strategies. In the case in which the processes to be discriminated have internal memories, the ultimate performance would generally be more difficult to analyze. In this paper, 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 if the number of channel evaluations increases by one. We also present a lower bound based on Bayesian updating, which has a low computational cost. Our numerical experiments demonstrate that the proposed bounds are reasonably tight. The proposed bounds do not explicitly depend on any quantum phenomena, and can be readily extended to a general operational probabilistic theory.

References in corpus (14)

• Quantum Illumination with Gaussian States
• Quantum Circuits Architecture
• Transforming quantum operations: quantum supermaps
• Asymptotic teleportation scheme as a universal programmable quantum processor
• Quantum teleportation scheme by selecting one of multiple output ports
• Spin chains and channels with memory
• Minimum-error discrimination between mixed quantum states
• Ultimate limits for multiple quantum channel discrimination
• Entanglement-enhanced testing of multiple quantum hypotheses
• Optimal single shot strategies for discrimination of quantum measurements
• Error rates of Belavkin weighted quantum measurements and a converse to Holevo's asymptotic optimality theorem
• Discrimination of quantum observables using limited resources
• Unambiguous comparison of quantum measurements
• Perfect discrimination of quantum measurements using entangled systems

Cited by in corpus (7)

• Quantum Network Discrimination
• Identifying quantum change points for Hamiltonians
• Analytical Bounds for Dynamic Multi-Channel Discrimination
• Universal bounds for quantum metrology in the presence of correlated noise
• Single-shot Distinguishability and Anti-distinguishability of Quantum Measurements
• Improving quantum channel discrimination with resourceful states
• Entanglement and Optimal Timing in Discriminating Quantum Dynamical Processes