Equivalence between completely-positive-divisibility and information flow
Bogna Bylicka, Markus Johansson, Antonio Acín
Abstract
We prove the equivalence between two approaches to the characterisation of quantum Markovianity, divisibility and lack of information backflow. We show that a dynamical map is completely-positive-divisible if and only if a monotonic non-increase of distinguishability is observed for two equiprobable states of the evolving system and an ancilla. Moreover our proof is constructive for invertible dynamical maps: given any such a map that is not completely-positive-divisible, we give an explicit construction of two states that exhibit information backflow. Finally, while an ancilla is necessary for the equivalence to hold in general, we show that it is always possible to witness the non-Markovianity of maps without using any entanglement between system and ancilla.