Search

Quantum nonlocality, pioneered in Bell's seminal work and subsequently verified through a series of experiments, has drawn substantial attention due to its practical applications in various protocols. Evaluating and comparing the extent of nonlocality within distinct quantum correlations holds significant practical relevance. Within the resource theoretic framework this can be achieved by assessing the interconversion rate among different nonlocal correlations under free local operations and shared randomness. In this study we, however, present instances of quantum nonlocal correlations that are incomparable in the strongest sense. Specifically, when starting with an arbitrary many copies of one nonlocal correlation, it becomes impossible to obtain even a single copy of the other correlation, and this incomparability holds in both directions. Such incomparable quantum correlations can be obtained even in the simplest Bell scenario, which involves two parties, each having two dichotomic measurements setups. Notably, there exist an uncountable number of such incomparable correlations. Our result challenges the notion of a "unique gold coin," often referred to as the "maximally resourceful state," within the framework of the resource theory of quantum nonlocality. To this end, we provide examples of isotropic quantum correlations that cannot be distilled up to the Tsirelson point, and thus partially answer a long-standing open question in nonlocality distillation.

Ensembles of composite quantum states can exhibit nonlocal behavior in the sense that their optimal discrimination may require global operations. Such an ensemble containing N pairwise orthogonal pure states, however, can always be perfectly distinguished under an adaptive local scheme if (N-1) copies of the state are available. In this Letter, we provide examples of orthonormal bases in two-qubit Hilbert space whose adaptive discrimination require three copies of the state. For this composite system, we analyze multicopy adaptive local distinguishability of orthogonal ensembles in full generality which, in turn, assigns varying nonlocal strength to different such ensembles. We also come up with ensembles whose discrimination under an adaptive separable scheme require less numbers of copies than adaptive local schemes. Our construction finds important application in multipartite secret sharing tasks and indicates toward an intriguing superadditivity phenomenon for locally accessible information.

More than two multipartite orthogonal states cannot always be discriminated if only local operations and classical communication (LOCC) are allowed. We show that four Bell states cannot be discriminated by LOCC, even probabilistically, using the separability properties of a four-party unlockable bound entangled state. Using an existing inequality among the measures of entanglement, we show that any three Bell states cannot be discriminated with certainty by LOCC. Exploiting the inequality, we calculate the distillable entanglement of a certain class of 4 multiply sign in circle 4 mixed states.