Simple upper and lower bounds on the ultimate success probability for discriminating arbitrary finite-dimensional quantum processes
arXiv:2012.13844 · doi:10.1103/PhysRevLett.126.200502
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 (45)
- Advances in Photonic Quantum Sensing
- Quantum Illumination with Gaussian States
- Probabilistic theories with purification
- Quantum Circuits Architecture
- Transforming quantum operations: quantum supermaps
- Statistical distinguishability between unitary operations
- Entanglement enhanced information transmission over a quantum channel with correlated noise
- Quantum Channels with Memory
- Quantum Reading of a Classical Digital Memory
- Optimal discrimination of quantum operations
- Memory effects in quantum channel discrimination
- Asymptotic teleportation scheme as a universal programmable quantum processor
- Entanglement can enhance the distinguishability of entanglement-breaking channels
- Toward a general theory of quantum games
- Fundamental limits to quantum channel discrimination
- Adaptive versus non-adaptive strategies for quantum channel discrimination
- Reexamination of Quantum Bit Commitment: the Possible and the Impossible
- Quantum teleportation scheme by selecting one of multiple output ports
- Ultimate Precision of Adaptive Noise Estimation
- Time correlated quantum amplitude damping channel
- Discrimination of two channels by adaptive methods and its application to quantum system
- Multiple copy 2-state discrimination with individual measurements
- Quantum channels with a finite memory
- Generalized Probabilistic Theories Without the No-Restriction Hypothesis
- Spin chains and channels with memory
- Minimum Decision Cost for Quantum Ensembles
- Minimum-error discrimination between mixed quantum states
- Ultimate limits for multiple quantum channel discrimination
- Revisiting the Dolinar Receiver through Multiple-Copy State Discrimination Theory
- Identification and Distance Measures of Measurement Apparatus
- Entanglement-enhanced testing of multiple quantum hypotheses
- Strategies for optimal single-shot discrimination of quantum measurements
- A lower bound on the probability of error in quantum state discrimination
- Optimal networks for Quantum Metrology: semidefinite programs and product rules
- Parallel distinguishability of quantum operations
- 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
- Conditions for optimal input states for discrimination of quantum channels
- Unambiguous comparison of quantum measurements
- Optimal discrimination between quantum operations
- Discrimination of POVMs with rank-one effects
- Multiple-shot and unambiguous discrimination of von Neumann measurements
- Multiple-copy state discrimination of noisy qubits
- 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