Deterministic versus probabilistic quantum information masking

We investigate quantum information masking for arbitrary dimensional quantum states. We show that mutually orthogonal quantum states can always be served for deterministic masking of quantum information. We further construct a probabilistic masking machine for linearly independent states. It is shown that a set of d dimensional states, $\{ |a_1 \rangle_A, |t a_2 \rangle_A, \dots, |a_n \rangle_A \}$, $n \leq d$, can be probabilistically masked by a general unitary-reduction operation if they are linearly independent. The maximal successful probability of probabilistic masking is analyzed and derived for the case of two initial states.