Application of Ramsey theory to localization of set of product states via multicopies
arXiv:2208.13357 · doi:10.1140/epjp/s13360-023-03656-4
Abstract
It is well known that any orthogonal pure states can always be perfectly distinguished under local operation and classical communications (LOCC) if copies of the state are available [Phys. Rev. Lett. 85, 4972 (2000)]. It is important to reduce the number of quantum state copies that ensures the LOCC distinguishability in terms of resource saving and nonlocality strength characterization. Denote the least number of copies needed to LOCC distinguish any orthogonal -partite product states. This work will be devoted to the estimation of the upper bound of . In fact, we first relate this problem with Ramsey theory, a branch of combinatorics dedicated to studying the conditions under which orders must appear. Subsequently, we prove , which is better than obtained in [Eur. Phys. J. Plus 136, 1172 (2021)] when . We further exhibit that for arbitrary , always holds for sufficiently large .
13 pages
References in corpus (13)
- Quantum secret sharing based on local distinguishability
- Distinguishing Arbitrary Multipartite Basis Unambiguously Using Local Operations and Classical Communication
- Distinguishability of Quantum States by Separable Operations
- Strong Quantum Nonlocality without Entanglement in Multipartite Quantum Systems
- Nonlocal sets of orthogonal product states in arbitrary multipartite quantum system
- Strong quantum nonlocality with entanglement
- Strongly nonlocal unextendible product bases do exist
- locally indistinguishable maximally entangled states in
- Multi-copy adaptive local discrimination: Strongest possible two-qubit nonlocal bases
- Locally distinguishing quantum states with limited classical communication
- Alternative method for deriving nonlocal multipartite product states
- Finding out all locally indistinguishable sets of generalized Bell states
- Locality of Orthogonal Product States via Multiplied Copies