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, $\{ \vert a_1 \rangle_A, \vert a_2 \rangle_A, \dots, \vert 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.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, $\{ \vert a_1 \rangle_A, \vert a_2 \rangle_A, \dots, \vert 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.

Jul 30, 20192 citations

Optimal entanglement manipulation for an arbitrary state of two qubits

Li-Xiang Cen, Fuli Li, Shi‐Yao Zhu

Physics Letters AOct 1, 20003 citations

Deterministic versus probabilistic quantum information masking

Bo Li, Shuhan Jiang, Xiao-Bin Liang +3 more

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}\ensuremath{\rangle}}_{A},|{a}_{2}{\ensuremath{\rangle}}_{A},\ensuremath{\cdots},|{a}_{n}{\ensuremath{\rangle}}_{A}}, n\ensuremath{\le}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.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}\ensuremath{\rangle}}_{A},|{a}_{2}{\ensuremath{\rangle}}_{A},\ensuremath{\cdots},|{a}_{n}{\ensuremath{\rangle}}_{A}}, n\ensuremath{\le}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.

arXiv:1905.00540Physical Review AMay 28, 201929 citations

Selection of unitary operations in quantum secret sharing without entanglement

Juan Xu, Hanwu Chen, Wenjie Liu +1 more

Science China Information SciencesApr 29, 201110 citations

\{ \vert a_1 \rangle_A, \vert a_2 \rangle_A, \dots, \vert 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.

d

-dimensional states, ${{|{a}_{1}\ensuremath{\rangle}}_{A},|{a}_{2}{\ensuremath{\rangle}}_{A},\ensuremath{\cdots},|{a}_{n}{\ensuremath{\rangle}}_{A}}, n\ensuremath{\le}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.