vix.ing · top · new · best · stats · spec

Masking quantum information in multipartite scenario

2018/12/05 by Mao-Sheng Li, Yan-Ling Wang
Computer Science · Mathematics · Physics and Astronomy · #Bipartite graph #Dimension (graph theory) #Discrete mathematics #Masking (illustration) #Mathematics #Multipartite #Physics #Pure mathematics #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum channel #Quantum entanglement #Quantum information #Quantum mechanics #Quantum state #Quantum-Dot Cellular Automata #quant-ph

paper · pdf · doi:10.1103/physreva.98.062306

published as Published in Phys. Rev. A 98 062306 (2018) · 6 pages, 0 figure

openalex publication_date 2018/12/05 · arxiv created 2019/02/21 · arxiv updated 2019/02/27 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05

Abstract

Recently, Modi et al. [Phys. Rev. Lett. 120, 230501 (2018)] found that masking quantum information is impossible in a bipartite scenario. This adds another item to the no-go theorems. In this paper, we present some 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 highlights some differences between the no-masking theorem and the classical no-cloning theorem or no-deleting theorem.

Citations