Efficient achievability for quantum protocols using decoupling theorems
arXiv:1401.6945 · doi:10.1109/ISIT.2014.6874890
Abstract
Proving achievability of protocols in quantum Shannon theory usually does not consider the efficiency at which the goal of the protocol can be achieved. Nevertheless it is known that protocols such as coherent state merging are efficiently achievable at optimal rate. We aim to investigate this fact further in a general one-shot setting, by considering certain classes of decoupling theorems and give exact rates for these classes. Moreover we compare results of general decoupling theorems using Haar distributed unitaries with those using smaller sets of operators, in particular -approximate 2-designs. We also observe the behavior of our rates in special cases such as approaching zero and the asymptotic limit.
arXiv comment5 pages, double column, v2: added reference
References in corpus (9)
- On quantum Renyi entropies: a new generalization and some properties
- Random Quantum Circuits are Approximate 2-designs
- The mother of all protocols: Restructuring quantum information's family tree
- Sandwiched Rényi Divergence Satisfies Data Processing Inequality
- Monotonicity of a relative Rényi entropy
- The Quantum Reverse Shannon Theorem based on One-Shot Information Theory
- A family of quantum protocols
- Decoupling with unitary approximate two-designs
- The apex of the family tree of protocols: Optimal rates and resource inequalities