Discrimination of genuinely nonlocal sets without entanglement in multipartite systems

• URL: http://arxiv.org/abs/2606.20380v1
• Date: Thu, 18 Jun 2026 15:39:14 GMT
• Title: Discrimination of genuinely nonlocal sets without entanglement in multipartite systems
• Abstract summary: We present entanglement-assisted discrimination schemes for genuinely nonlocal sets that use minimal resources.<n>For low-dimensional cases, Type I sets require only a single EPR pair, whereas Type II sets necessitate only one GHZ state.<n>These results provide a robust framework for the efficient discrimination of genuinely nonlocal sets using minimal quantum resources.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Genuine nonlocality arises when a set of multipartite orthogonal states is locally indistinguishable under any bipartition of the subsystems. The entanglement-assisted discrimination of such genuinely nonlocal orthogonal product sets has attracted significant attention in quantum information. Based on the criterion of local irreducibility, genuine nonlocality is classified into Type I (reducible) and Type II (irreducible). We present entanglement-assisted discrimination schemes for both types of genuinely nonlocal sets that use minimal resources. For low-dimensional cases, Type I sets require only a single EPR pair, whereas Type II sets necessitate only one GHZ state. We extend these protocols to higher-dimensional systems: the discrimination of Type I sets requires only one maximally entangled state in a two-qutrit system, while that of Type II sets similarly demands a single maximally entangled state in a three-qutrit system. For $n$-partite ($n > 3$) systems, Type I sets continue to require only one maximally entangled state, whereas Type II sets necessitate just one additional EPR pair compared to their Type I counterparts. These results provide a robust framework for the efficient discrimination of genuinely nonlocal sets using minimal quantum resources.

Related papers

• Inclusion-Minimal local indistinguishability: a weak form of nonlocality [3.6232799647768594]
  Local discrimination of quantum states is a fundamental task in distributed quantum information processing.<n>We show that local indistinguishability can be nontrivial at the single-copy level yet fragile under either the removal of candidate states or a modest increase in copy resources.
  arXiv  Detail & Related papers  (2026-08-23T12:40:58Z)
• Error bounds for splitting methods in unitary problems [45.88028371034407]
  We present a systematic analysis of both local and global errors arising from arbitrary splitting methods applied to unitary problems.<n>The first is expressed in terms of operator norms, while the second is formulated using norms of commutators and can, under suitable assumptions, be extended to certain classes of operators.
  arXiv  Detail & Related papers  (2026-04-01T15:33:05Z)
• Entanglement-Assisted Discrimination of Nonlocal Sets of Orthogonal States [0.0]
  Entanglement-assisted discrimination of quantum states exhibiting quantum nonlocality is a frontier topic in quantum information theory.<n>We investigate the role of multipartite entanglement and develop resource-efficient LOCC discrimination protocols.
  arXiv  Detail & Related papers  (2026-03-13T00:27:08Z)
• Local models and Bell inequalities for the minimal triangle network [78.45663456116702]
  Nonlocal correlations enable surprising phenomena in quantum information and quantum foundations.<n>We study one of the simplest scenarios, namely that of distributions invariant under permutations of parties in the minimal triangle network.<n>We provide insights on the existence of a classical-quantum gap in the triangle network with binary outcomes.
  arXiv  Detail & Related papers  (2025-03-20T19:11:06Z)
• Pure state entanglement and von Neumann algebras [41.94295877935867]
  We develop the theory of local operations and classical communication (LOCC) for bipartite quantum systems represented by commuting von Neumann algebras.<n>Our central result is the extension of Nielsen's Theorem, stating that the LOCC ordering of bipartite pure states is equivalent to the majorization of their restrictions.<n>In the appendix, we provide a self-contained treatment of majorization on semifinite von Neumann algebras and $sigma$-finite measure spaces.
  arXiv  Detail & Related papers  (2024-09-26T11:13:47Z)
• Unextendibility, uncompletability, and many-copy indistinguishable ensembles [49.1574468325115]
  We show that the complement of any bipartite pure entangled state is spanned by product states which form a nonorthogonal unextendible product basis (nUPB) of maximum cardinality.<n>We also report a class of multipartite many-copy indistinguishable ensembles for which local indistinguishability property increases with decreasing number of mixed states.
  arXiv  Detail & Related papers  (2023-03-30T16:16:41Z)
• Distinguishability-based genuine nonlocality with genuine multipartite entanglement [0.0]
  We study the distinguishability-based genuine nonlocality of a typical type of genuine multipartite entangled states. We show that the cardinality can at least scale down to linear in the local dimension d, with the linear factor l = 1.
  arXiv  Detail & Related papers  (2022-11-04T11:44:30Z)
• Reusing the Task-specific Classifier as a Discriminator: Discriminator-free Adversarial Domain Adaptation [55.27563366506407]
  We introduce a discriminator-free adversarial learning network (DALN) for unsupervised domain adaptation (UDA) DALN achieves explicit domain alignment and category distinguishment through a unified objective. DALN compares favorably against the existing state-of-the-art (SOTA) methods on a variety of public datasets.
  arXiv  Detail & Related papers  (2022-04-08T04:40:18Z)
• Threshold size for the emergence of a classical-like behaviour [68.8204255655161]
  We design a procedure to estimate the minimum size beyond which a system is amenable to a classical-like description. The specific case of a magnetic system is considered, with details of a gedanken experiment presented and thoroughly commented.
  arXiv  Detail & Related papers  (2022-03-25T11:31:14Z)
• Binary Classification from Multiple Unlabeled Datasets via Surrogate Set Classification [94.55805516167369]
  We propose a new approach for binary classification from m U-sets for $mge2$. Our key idea is to consider an auxiliary classification task called surrogate set classification (SSC)
  arXiv  Detail & Related papers  (2021-02-01T07:36:38Z)
• Local distinguishability based genuinely quantum nonlocality without entanglement [4.175755620596097]
  We consider a weaker form of nonlocality called local distinguishability based genuine nonlocality. We present an elegant set of product states in bipartite systems that is locally indistinguishable. We obtain that genuinely nonlocal sets of fully product states exist for all possible multipartite quantum systems.
  arXiv  Detail & Related papers  (2020-11-20T09:10:51Z)
• Multi-copy adaptive local discrimination: Strongest possible two-qubit nonlocal bases [0.0]
  In this letter, we provide examples of orthonormal bases in two-qubit Hilbert space whose adaptive discrimination require 3 copies of the state. We also come up with ensembles whose discrimination under adaptive separable scheme require less number of copies than adaptive local schemes. Our construction finds important application in multipartite secret sharing tasks and indicates towards an intriguing super-additivity phenomenon for locally accessible information.
  arXiv  Detail & Related papers  (2020-11-18T13:49:51Z)
• Fermionic state discrimination by local operations and classical communication [68.8204255655161]
  Local operations and classical communication (LOCC) discrimination between two bipartite pure states of fermionic systems is studied. We show that, contrary to the case of quantum systems, for fermionic systems it is generally not possible to achieve the ideal state discrimination performances.
  arXiv  Detail & Related papers  (2020-02-24T12:25:36Z)
• Learn to Predict Sets Using Feed-Forward Neural Networks [63.91494644881925]
  This paper addresses the task of set prediction using deep feed-forward neural networks. We present a novel approach for learning to predict sets with unknown permutation and cardinality. We demonstrate the validity of our set formulations on relevant vision problems.
  arXiv  Detail & Related papers  (2020-01-30T01:52:07Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.