Strongest quantum nonlocality in $N$-partite systems
Mengying Hu, Ting Gao, Fengli Yan

TL;DR
This paper establishes a necessary and sufficient condition for trivial orthogonality-preserving measurements in N-partite quantum systems, leading to the construction of minimal and more resource-efficient strongly nonlocal entangled sets.
Contribution
It provides a new criterion for trivial measurements, determines minimal sizes of strongly nonlocal sets, and constructs smaller genuinely entangled sets in higher-dimensional systems.
Findings
Minimum size of strongly nonlocal sets in $(\mathbb{C}^3)^{\otimes N}$ identified.
Constructed smaller strongly nonlocal genuinely entangled sets in $(\mathbb{C}^d)^{\otimes N}$ for $d\geq4$.
Enhanced understanding of the structure and resource efficiency of strongest quantum nonlocality.
Abstract
A set of orthogonal states possesses the strongest quantum nonlocality if only a trivial orthogonality-preserving positive operator-valued measure (POVM) can be performed for each bipartition of the subsystems. This concept originated from the strong quantum nonlocality proposed by Halder [Phy. Rev. Lett. , 040403 (2019)], which is a stronger manifestation of nonlocality based on locally indistinguishability and finds more efficient applications in quantum information hiding. However, demonstrating the triviality of orthogonality-preserving local measurements (OPLMs) is not straightforward. In this paper, we present a sufficient and necessary condition for trivial OPLMs in -partite systems under certain conditions. By using our proposed condition, we deduce the minimum size of set with the strongest nonlocality in system , where…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Information and Cryptography · Quantum Computing Algorithms and Architecture · Quantum Mechanics and Applications
