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. (C) 2013 AIP Publishing LLC. |
Year | DOI | Venue |
---|---|---|
2012 | 10.1063/1.4818985 | JOURNAL OF MATHEMATICAL PHYSICS |
Field | DocType | Volume |
Quantum no-deleting theorem,Discrete mathematics,One-way quantum computer,Combinatorics,Quantum entanglement,Quantum mutual information,Quantum mechanics,Quantum algorithm,Quantum information science,Quantum information,Quantum capacity,Mathematics | Journal | 54 |
Issue | ISSN | Citations |
8 | 0022-2488 | 2 |
PageRank | References | Authors |
0.50 | 1 | 1 |
Name | Order | Citations | PageRank |
---|---|---|---|
Salman Beigi | 1 | 56 | 11.43 |