The concept of divisibility of dynamical maps is used to introduce an analogous concept for quantum channels by analyzing the simulability of channels by means of dynamical maps. In particular, this is addressed for Lindblad divisible, completely positive divisible and positive divisible dynamical maps. The corresponding L-divisible, CP-divisible and P-divisible subsets of channels are characterized (exploiting the results by Wolf et al. and visualized for the case of qubit channels. We discuss the general inclusions among divisibility sets and show several equivalences for qubit channels. To this end we study the conditions of L-divisibility for finite dimensional channels, especially the cases with negative eigenvalues, extending and completing the known results. Furthermore we show that transitions between every two of the defined divisibility sets are allowed. We explore particular examples of dynamical maps to compare these concepts. Finally, we show that every divisible but not infinitesimal divisible qubit channel (in positive maps) is entanglement-breaking, and open the question if something similar occurs for higher dimensions.

We address the question of quantum memory storage for quantum dynamics. In particular, we design an optimal protocol for N -> 1 probabilistic storage and retrieval of unitary channels on D-dimensional quantum systems. If we access the unknown unitary gate only N times, the optimal success probability of perfect single-use retrieval is N/(N−1+d²). The derived size of the memory system exponentially improves the known upper bound on the size of the program register needed for probabilistic programmable quantum processors. Our results are closely related to probabilistic perfect alignment of reference frames and probabilistic port-based teleportation.