Markovianizing Cost of Tripartite Quantum States

DOI10.1109/TIT.2016.2639523MaRDI QIDQ2989658zbMATH OpenFDO

Authors Eyuri Wakakuwa, Akihito Soeda, Mio Murao

Publication date 8 June 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Quantum state spaces, operational and probabilistic concepts (81P16)

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 $h{o}^{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 close to a quantum Markov chain. Our results have an application in analyzing the cost of resources for simulating a bipartite unitary gate by local operations and classical communication.

Cited in

(4)

• Entanglement cost of three-level antisymmetric states
• Communication Cost for Non-Markovianity of Tripartite Quantum States: A Resource Theoretic Approach
• Exact exponent for atypicality of random quantum states
• One-shot randomized and nonrandomized partial decoupling

This page was built for publication: Markovianizing Cost of Tripartite Quantum States

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