# Masking quantum information in multipartite scenario

## TL;DR

This paper explores the possibility of masking quantum information in multipartite systems, demonstrating new schemes that enable masking with more participants and establishing conditions for masking all d-level quantum states.

## Contribution

It introduces novel masking schemes beyond error correction codes and shows how all d-level states can be masked using orthogonal Latin squares in tripartite systems.

## Key findings

- Masking is impossible in bipartite systems.
- New masking schemes are possible with more participants.
- All d-level states can be masked into tripartite systems using Latin squares.

## Abstract

Recently, Kavan Modi \emph{et al.} found that masking quantum information is impossible in bipartite scenario in [Phys. Rev. Lett. \textbf{120}, 230501 (2018)]. This adds another item of the no-go theorems. In this paper, we present some new schemes different from error correction codes, which show that quantum states can be masked when more participants are allowed in the masking process. Moreover, using a pair of mutually orthogonal Latin squares of dimension $d$, we show that all the $d$ level quantum states can be masked into tripartite quantum systems whose local dimensions are $d$ or $d+1$. This highlight some difference between the no-masking theorem and the classical no-cloning theorem or no-deleting theorem.