Characterization of linear maps on whose multiplicity maps have maximal norm, with an application in quantum information
arXiv:1710.03281 · doi:10.22331/q-2018-02-05-51
Abstract
Given a linear map , its multiplicity maps are defined as the family of linear maps , where denotes the identity on . Let denote the trace-norm on matrices, as well as the induced trace-norm on linear maps of matrices, i.e. . A fact of fundamental importance in both operator algebras and quantum information is that can grow with . In general, the rate of growth is bounded by , and matrix transposition is the canonical example of a map achieving this bound. We prove that, up to an equivalence, the transpose is the unique map achieving this bound. The equivalence is given in terms of complete trace-norm isometries, and the proof relies on a particular characterization of complete trace-norm isometries regarding preservation of certain multiplication relations. We use this result to characterize the set of single-shot quantum channel discrimination games satisfying a norm relation that, operationally, implies that the game can be won with certainty using entanglement, but is hard to win without entanglement. Specifically, we show that the well-known example of such a game, involving the Werner-Holevo channels, is essentially the unique game satisfying this norm relation. This constitutes a step towards a characterization of single-shot quantum channel discrimination games with maximal gap between optimal performance of entangled and unentangled strategies.
arXiv commentAccepted by Quantum
References in corpus (11)
- A computable measure of entanglement
- Separability of Mixed States: Necessary and Sufficient Conditions
- Optimal discrimination of quantum operations
- Counterexample to an additivity conjecture for output purity of quantum channels
- All entangled states are useful for channel discrimination
- Entanglement can enhance the distinguishability of entanglement-breaking channels
- Multivariate Trace Inequalities
- Reversibility conditions for quantum operations
- Conditions for optimal input states for discrimination of quantum channels
- Ancilla dimension in quantum channel discrimination
- Distinguishing Short Quantum Computations