5
views
0
recommends
+1 Recommend
0 collections
0
shares
• Record: found
• Abstract: found
• Article: found
Is Open Access

# Markovianizing Cost of Tripartite Quantum States

Preprint

Bookmark
There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

### Abstract

We introduce and analyze a task that we call Markovianization, in which a tripartite quantum state is transformed to a quantum Markov chain by a randomizing operation on one of the three subsystems. We consider cases where the initial state is the tensor product of $$n$$ copies of a tripartite state $$\rho^{ABC}$$, and is transformed to a quantum Markov chain conditioned by $$B^n$$ with a small error, using a random unitary operation on $$A^n$$. In an asymptotic limit of infinite copies and vanishingly small error, we analyze the Markovianizing cost, that is, the minimum cost of randomness per copy required for Markovianization. For tripartite pure states, we derive a single-letter formula for the Markovianizing costs. Counterintuitively, the Markovianizing cost is not a continuous function of states, and can be arbitrarily large even if the state is an approximate quantum Markov chain. Our results have an application for distributed quantum computation and distributed compression.

### Author and article information

###### Journal
2015-04-22
2016-02-18
1504.05805