ﻻ يوجد ملخص باللغة العربية
We present a generic method to construct a product basis exhibiting Nonlocality Without Entanglement with $n$ parties each holding a system of dimension at least $n-1$. This basis is generated via a quantum circuit made of control-Discrete Fourier Transform gates acting on the computational basis. The simplicity of our quantum circuit allows for an intuitive understanding of this new type of nonlocality. We also show how this circuit can be used to construct Unextendible Product Bases and their associated Bound Entangled States. To our knowledge, this is the first method which, given a general Hilbert space $bigotimes_{i=1}^n {cal H}_{d_i}$ with $d_ile n-1$, makes it possible to construct (i) a basis exhibiting Nonlocality Without Entanglement, (ii) an Unextendible Product Basis, and (iii) a Bound Entangled state.
In this paper, we generalize the concept of strong quantum nonlocality from two aspects. Firstly in $mathbb{C}^dotimesmathbb{C}^dotimesmathbb{C}^d$ quantum system, we present a construction of strongly nonlocal quantum states containing $6(d-1)^2$ or
We consider Bell tests in which the distant observers can perform local filtering before testing a Bell inequality. Notably, in this setup, certain entangled states admitting a local hidden variable model in the standard Bell scenario can nevertheles
Entangled systems in experiments may be lost or offline in distributed quantum information processing. This inspires a general problem to characterize quantum operations which result in breaking of entanglement or not. Our goal in this work is to sol
We study the relations between quantum coherence and quantum nonlocality, genuine quantum entanglement and genuine quantum nonlocality. We show that the coherence of a qubit state can be converted to the nonlocality of two-qubit states via incoherent
The nonlocal correlations of multipartite entangled states can be reproduced by a classical model if sufficiently many parties join together or if sufficiently many parties broadcast their measurement inputs. The maximal number m of groups and the mi