# Deterministic versus probabilistic quantum information masking

## TL;DR

This paper explores methods for masking quantum information in arbitrary dimensional states, demonstrating deterministic masking for orthogonal states and probabilistic masking for linearly independent states, with analysis of success probabilities.

## Contribution

It introduces a framework for deterministic masking of orthogonal states and probabilistic masking of linearly independent states in arbitrary dimensions, including success probability analysis.

## Key findings

- Deterministic masking possible for orthogonal states.
- Probabilistic masking achievable for linearly independent states.
- Derived maximal success probability for two-state masking.

## Abstract

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.