Weak multiplicativity for random quantum channels
arXiv:1112.5271 · doi:10.1007/s00220-013-1680-7
Abstract
It is known that random quantum channels exhibit significant violations of multiplicativity of maximum output p-norms for any p>1. In this work, we show that a weaker variant of multiplicativity nevertheless holds for these channels. For any constant p>1, given a random quantum channel N (i.e. a channel whose Stinespring representation corresponds to a random subspace S), we show that with high probability the maximum output p-norm of n copies of N decays exponentially with n. The proof is based on relaxing the maximum output infinity-norm of N to the operator norm of the partial transpose of the projector onto S, then calculating upper bounds on this quantity using ideas from random matrix theory.
arXiv comment21 pages; v2: corrections and additional remarks
References in corpus (15)
- Integration with respect to the Haar measure on unitary, orthogonal and symplectic group
- Superadditivity of communication capacity using entangled inputs
- Counterexamples to the maximal p-norm multiplicativity conjecture for all p > 1
- Random quantum channels I: graphical calculus and the Bell state phenomenon
- Hastings' additivity counterexample via Dvoretzky's theorem
- Entanglement of the Antisymmetric State
- Counterexamples to additivity of minimum output p-Renyi entropy for p close to 0
- Random quantum channels II: Entanglement of random subspaces, Renyi entropy estimates and additivity problems
- Gaussianization and eigenvalue statistics for random quantum channels (III)
- Non-additivity of Renyi entropy and Dvoretzky's Theorem
- Highly Entangled States With Almost No Secrecy
- Constructive counterexamples to additivity of minimum output Rényi entropy of quantum channels for all p>2
- The absolute positive partial transpose property for random induced states
- Towards a state minimizing the output entropy of a tensor product of random quantum channels
- Eigenvalue and Entropy Statistics for Products of Conjugate Random Quantum Channels
Cited by in corpus (20)
- Models of quantum complexity growth
- Random matrix techniques in quantum information theory
- Unbounded number of channel uses are required to see quantum capacity
- Superadditivity of private information for any number of uses of the channel
- One-shot entanglement distillation beyond local operations and classical communication
- Superadditivity of the Classical Capacity with Limited Entanglement Assistance
- Correlation length in random MPS and PEPS
- On convex optimization problems in quantum information theory
- Exponential bounds for the support convergence in the Single Ring Theorem
- Revisiting additivity violation of quantum channels
- Asymptotically well-behaved input states do not violate additivity for conjugate pairs of random quantum channels
- -extendibility of high-dimensional bipartite quantum states
- Canonical form of three-fermion pure-states with six single particle states
- Flexible constrained de Finetti reductions and applications
- Additivity rates and PPT property for random quantum channels
- On the minimum output entropy of random orthogonal quantum channels
- Additive bounds of minimum output entropies for unital channels and an exact qubit formula
- Coherent information of a quantum channel or its complement is generically positive
- Random private quantum states
- An upper bound on quantum capacity of unital channels