On a measure of distance for quantum strategies
arXiv:1008.4636 · doi:10.1063/1.3693621
Abstract
The present paper studies an operator norm that captures the distinguishability of quantum strategies in the same sense that the trace norm captures the distinguishability of quantum states or the diamond norm captures the distinguishability of quantum channels. Characterizations of its unit ball and dual norm are established via strong duality of a semidefinite optimization problem. A full, formal proof of strong duality is presented for the semidefinite optimization problem in question. This norm and its properties are employed to generalize a state discrimination result of Ref. [GW05]. The generalized result states that for any two convex sets S,T of strategies there exists a fixed interactive measurement scheme that successfully distinguishes any choice of s in S from any choice of t in T with bias proportional to the minimal distance between the sets S and T as measured by this norm. A similar discrimination result for channels then follows as a special case.
25 pages: 17 main body, 6 appendix, 2 references. Final version, minor changes
References in corpus (1)
Cited by in corpus (37)
- Security in Quantum Cryptography
- Amortized Channel Divergence for Asymptotic Quantum Channel Discrimination
- Composable security of delegated quantum computation
- Quantum metrology for non-Markovian processes
- Resource theory of asymmetric distinguishability for quantum channels
- Optimal quantum networks and one-shot entropies
- Dynamical Entanglement
- Entanglement of a bipartite channel
- Entanglement cost and quantum channel simulation
- Entropy of a quantum channel
- Geometric distinguishability measures limit quantum channel estimation and discrimination
- Causal Boxes: Quantum Information-Processing Systems Closed under Composition
- Estimating distinguishability measures on quantum computers
- Resource theories of multi-time processes: A window into quantum non-Markovianity
- Optimal networks for Quantum Metrology: semidefinite programs and product rules
- Process tomography for unitary quantum channels
- Jordan products of quantum channels and their compatibility
- Base norms and discrimination of generalized quantum channels
- Fast Quantum Algorithms for Trace Distance Estimation
- Usefulness of adaptive strategies in asymptotic quantum channel discrimination
- Conditions for optimal input states for discrimination of quantum channels
- Composable security in relativistic quantum cryptography
- Virtual quantum resource distillation: General framework and applications
- Incompatible measurements on quantum causal networks
- Entanglement-breaking superchannels
- Memory Effects in Quantum Processes
- Classical Cryptographic Protocols in a Quantum World
- Exact entanglement cost of quantum states and channels under PPT-preserving operations
- Evaluating the Advantage of Adaptive Strategies for Quantum Channel Distinguishability
- Composable and Finite Computational Security of Quantum Message Transmission
- Efficient diagnostics for quantum error correction
- Distance to boundary and minimum-error discrimination
- No-signalling constrains quantum computation with indefinite causal structure
- Identifying quantum change points for Hamiltonians
- Universal bounds for quantum metrology in the presence of correlated noise
- Extremal generalized quantum measurements
- Process tensor distinguishability measures