Flexible constrained de Finetti reductions and applications
arXiv:1605.09013 · doi:10.1063/1.5003633
Abstract
De Finetti theorems show how sufficiently exchangeable states are well-approximated by convex combinations of i.i.d. states. Recently, it was shown that in many quantum information applications a more relaxed de Finetti reduction (i.e. only a matrix inequality between the symmetric state and one of de Finetti form) is enough, and that it leads to more concise and elegant arguments. Here we show several uses and general flexible applicability of a constrained de Finetti reduction in quantum information theory, which was recently discovered by Duan, Severini and Winter. In particular we show that the technique can accommodate other symmetries commuting with the permutation action, and permutation-invariant linear constraints. We then demonstrate that, in some cases, it is also fruitful with convex constraints, in particular separability in a bipartite setting. This is a constraint particularly interesting in the context of the complexity class of interactive quantum Merlin-Arthur games with unentangled provers, and our results relate to the soundness gap amplification of protocols by parallel repetition. It is also relevant for the regularization of certain entropic channel parameters. Finally, we explore an extension to infinite-dimensional systems, which usually pose inherent problems to de Finetti techniques in the quantum case.
arXiv comment19 pages
References in corpus (21)
- Superadditivity of communication capacity using entangled inputs
- "Squashed Entanglement" - An Additive Entanglement Measure
- Induced measures in the space of mixed quantum states
- A de Finetti representation theorem for infinite dimensional quantum systems and applications to quantum cryptography
- Post-selection technique for quantum channels with applications to quantum cryptography
- Largest separable balls around the maximally mixed bipartite quantum state
- Quantum conditional mutual information and approximate Markov chains
- Security of continuous-variable quantum key distribution against general attacks
- One-and-a-half quantum de Finetti theorems
- Parallel repetition: simplifications and the no-signaling case
- Optimal sequence of quantum measurements in the sense of Stein's lemma in quantum hypothesis testing
- Counterexamples to the maximal p-norm multiplicativity conjecture for all p > 1
- Irreversibility in asymptotic manipulations of entanglement
- Relative Entropy of Entanglement and Restricted Measurements
- An additive and operational entanglement measure: conditional entanglement of mutual information
- Squashed entanglement, k-extendibility, quantum Markov chains, and recovery maps
- Entanglement of the Antisymmetric State
- Distinguishing multi-partite states by local measurements
- Weak multiplicativity for random quantum channels
- Parallel repetition and concentration for (sub-)no-signalling games via a flexible constrained de Finetti reduction
- On zero-error communication via quantum channels in the presence of noiseless feedback