Local distinguishability of five six-partite orthogonal product states

The local distinguishability of a set of orthogonal quantum states can be used to reduce the amount of quantum state transmission in quantum protocols and lower system operational costs and quantum resource overhead. In this paper, we investigate the local distinguishability of five six-partite orthogonal product states (OPSs), where any two states are orthogonal on only one subsystem. We classify all feasible sets of five six-partite OPSs into five categories with 249 cases in total, and prove that these sets can be perfectly distinguished by local operations and classical communication, except for two cases. For five six-partite OPSs corresponding to these two exceptional cases, we further discuss their local distinguishability. Our work fully characterizes the local distinguishability of all feasible sets of five six-partite OPSs.

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-11-17
DOI
https://doi.org/10.48550/arxiv.2611.22553
Primary Topic
Quantum Information and Cryptography
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Local distinguishability of five six-partite orthogonal product states

Ben-Hao Zhao, Yuguang Yang, Guang-Bao Xu, Dong-Huan Jiang
arXiv (Cornell University)
Quantum Information and Cryptography
preprint

Local distinguishability of five six-partite orthogonal product states

Ben-Hao Zhao, Yuguang Yang, Guang-Bao Xu, Dong-Huan Jiang
preprint en

Abstract

The local distinguishability of a set of orthogonal quantum states can be used to reduce the amount of quantum state transmission in quantum protocols and lower system operational costs and quantum resource overhead. In this paper, we investigate the local distinguishability of five six-partite orthogonal product states (OPSs), where any two states are orthogonal on only one subsystem. We classify all feasible sets of five six-partite OPSs into five categories with 249 cases in total, and prove that these sets can be perfectly distinguished by local operations and classical communication, except for two cases. For five six-partite OPSs corresponding to these two exceptional cases, we further discuss their local distinguishability. Our work fully characterizes the local distinguishability of all feasible sets of five six-partite OPSs.

arXiv (Cornell University)
Quantum Information and Cryptography
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon