On a measure of distance for quantum strategies
From MaRDI portal
Publication:2861769
Semidefinite programming (90C22) Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68) Variational principles of physics (49S05) Quantum state estimation, approximate cloning (81P50) Channel models (including quantum) in information and communication theory (94A40)
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.
Recommendations
- Base norms and discrimination of generalized quantum channels
- A family of norms with applications in quantum information theory. II
- On the complexity of approximating the diamond norm
- Asymptotic state discrimination and a strict hierarchy in distinguishability norms
- General strategies for discrimination of quantum states
Cites work
- scientific article; zbMATH DE number 1849957 (Why is no real title available?)
- Completely Bounded Maps between C∗ -Algebras
- Cones of positive maps and their duality relations
- Matrix Analysis
- Minimal and maximal operator spaces and operator systems in entanglement theory
- Norms and CB norms of Jordan elementary operators.
- Quantum computations: algorithms and error correction
- Semidefinite programs for completely bounded norms
- Theoretical framework for quantum networks
- Towards a general theory of quantum games
Cited in
(13)- On the complexity of approximating the diamond norm
- Experimentally feasible measures of distance between quantum operations
- Amortized channel divergence for asymptotic quantum channel discrimination
- Fidelity of quantum strategies with applications to cryptography
- Conditions for optimal input states for discrimination of quantum channels
- Composable and finite computational security of quantum message transmission
- Trace distance from the viewpoint of quantum operation techniques
- Extremal generalized quantum measurements
- Geometric distinguishability measures limit quantum channel estimation and discrimination
- Base norms and discrimination of generalized quantum channels
- Optimal networks for quantum metrology: semidefinite programs and product rules
- Process tomography for unitary quantum channels
- Optimal quantum networks and one-shot entropies
This page was built for publication: On a measure of distance for quantum strategies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2861769)
