A new quantum data processing inequality

DOI10.1063/1.4818985MaRDI QIDQ5407667zbMATH OpenOpenAlexFDO

Authors Salman Beigi

Publication date 7 April 2014

Published in Journal of Mathematical Physics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1210.1689

Mathematics Subject Classification ID

Quantum measurement theory, state operations, state preparations (81P15) Quantum coherence, entanglement, quantum correlations (81P40) Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Quantum coding (general) (81P70) Measures of information, entropy (94A17) Coding theorems (Shannon theory) (94A24)

Abstract: Quantum data processing inequality bounds the set of bipartite states that can be generated by two far apart parties under local operations; Having access to a bipartite state as a resource, two parties cannot locally transform it to another bipartite state with a mutual information greater than that of the resource state. But due to the additivity of quantum mutual information under tensor product, the data processing inequality gives no bound when the parties are provided with arbitrary number of copies of the resource state. In this paper we introduce a measure of correlation on bipartite quantum states, called maximal correlation, that is not additive and gives the same number when computed for multiple copies. Then by proving a data processing inequality for this measure, we find a bound on the set of states that can be generated under local operations even when an arbitrary number of copies of the resource state is available.

Recommendations

• Tsirelson's bound from a generalized data processing inequality
• Quantum correlations beyond entanglement and their role in quantum information theory
• scientific article; zbMATH DE number 6096580
• Strong subadditivity lower bound and quantum channels
• Correlation distance and bounds for mutual information

Cites work

• A New Data Processing Inequality and Its Applications in Distributed Source and Channel Coding
• New version of the probabilistic generalization of the large sieve
• On measures of dependence
• On Sequences of Pairs of Dependent Random Variables

Cited in

(8)

• scientific article; zbMATH DE number 6096580 (Why is no real title available?)
• Impossibility of local state transformation via hypercontractivity
• Nonlocal Games with Noisy Maximally Entangled States are Decidable
• Tsirelson's bound from a generalized data processing inequality
• Arbitrarily small amounts of correlation for arbitrarily varying quantum channels
• The computational advantage of MIP* vanishes in the presence of noise
• The computational advantage of MIP* vanishes in the presence of noise
• Decidability of fully quantum nonlocal games with noisy maximally entangled states

This page was built for publication: A new quantum data processing inequality

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5407667)