Factorizability of multi-party quantum sequence discrimination under local operations and classical communication
Abstract
We consider multi-party quantum sequence discrimination under local operations and classical communication(LOCC), and provide conditions under which the optimal LOCC discrimination of a multi-party quantum sequence ensemble can be factorized into that of each individual ensemble. In other words, the optimal LOCC discrimination of a multi-party quantum sequence ensemble can be achieved just by performing optimal LOCC discrimination independently at each step of the quantum sequence. We also illustrate through examples of multi-party quantum states that such factorizability of optimal LOCC discrimination is possible. We further establish a necessary and sufficient condition under which the optimal LOCC discrimination of a multi-party quantum state ensemble can be realized just by guessing the state with the largest probability. Our results can provide a useful application to investigate the fundamental limits of quantum data hiding.
Cite
@article{arxiv.2508.05050,
title = {Factorizability of multi-party quantum sequence discrimination under local operations and classical communication},
author = {Donghoon Ha and Jeong San Kim},
journal= {arXiv preprint arXiv:2508.05050},
year = {2025}
}
Comments
14 pages, 1 figure