The role of completely positive--indivisibility (CP-indivisibility) and incompatibility as valuable resources for various information-theoretic tasks is widely acknowledged. This study delves into the intricate relationship between CP-divisibility and channel compatibility. Our investigation focuses on the behavior of incompatibility robustness of quantum channels for a pair of generic dynamical maps. We show that the incompatibility robustness of channels is monotonically nonincreasing for a pair of generic CP-divisible dynamical maps. Further, our explicit study of the behavior of incompatibility robustness with time for some specific dynamical maps reveals nonmonotonic behavior in the CP-indivisible regime. Additionally, we propose a measure of CP-indivisibility based on the incompatibility robustness of quantum channels. Our investigation provides valuable insights into the nature of quantum dynamical maps and their relevance in information-theoretic applications.
Incompatibility of quantum devices is one of the cornerstones of quantum theory, and the incompatibility of quantum measurements and channels has been linked to quantum advantage in certain information-theoretic tasks. In this work, we focus on the less well explored question of the incompatibility of quantum instruments, that is, devices that describe the measurement process in its entirety, accounting for both the classical measurement outcome and the quantum postmeasurement state. In particular, we focus on the recently introduced notion of parallel compatibility of instruments, which has been argued to be a natural notion of instrument compatibility. We introduce, in a manner similar to the case of measurements and channels, the incompatibility robustness of quantum instruments and derive universal bounds on it. We then prove that postprocessing of quantum instruments is a free operation for parallel compatibility. Last, we provide families of instruments for which our bounds are tight and families of compatible indecomposable instruments.
Incompatibility of quantum devices is a useful resource in various quantum information theoretical tasks, and it is at the heart of some fundamental features of quantum theory. While the incompatibility of measurements and quantum channels is well studied, the incompatibility of quantum instruments has not been explored in much detail. In this work, we revise a notion of instrument compatibility introduced in the literature that we call traditional compatibility. Then, we introduce the notion of parallel compatibility and show that these two notions are inequivalent. We then argue that the notion of traditional compatibility is conceptually incomplete and prove that, while parallel compatibility captures measurement and channel compatibility, traditional compatibility does not capture channel compatibility. Hence, we propose parallel compatibility as the conceptually complete definition of the compatibility of quantum instruments.
Measurement compatibility asks whether a family of quantum measurements can be simulated by one parent measurement followed by classical post-processing. We extend this measurement compatibility to the notion of \emph{
d-compatibility} for measurements, channels, and instruments whose parent passes a
d-dimensional quantum system and unlimited classical information to the post-processing. We formulate
d-compatibility as a common linear factorization of operator spaces and operator systems and show that
d-compatible families form a closed set, even with infinitely many settings and a separable infinite-dimensional input. To certify
d-incompatibility, we define the compatibility functional as the smallest product of completely bounded norms over common factorizations through a
d-dimensional register. Using factorization theory of operator spaces, we show that measure-and-prepare channels defined in terms of mutually unbiased bases and pinching channels defined in terms of Heisenberg-Weyl operators are
d-incompatible in certain regimes of
d. We also link
d-compatibility of multi-instruments to the preparability of Choi assemblages using channel-state duality, and use this connection to show that for bipartite states the (in)compatibility of instruments can be used to certify Schmidt numbers and the implementability of the instrument using one-way LOCC protocols. Finally, our compatibility functional also bounds the generalized robustness of compatibility, which we interpret through a memory-bounded nontransient preparation game.