Monotone Measures for Non-Local Correlations
نویسندگان
چکیده
منابع مشابه
Entanglement swapping for generalized non-local correlations
We consider an analogue of entanglement-swapping for a set of black boxes with the most general non-local correlations consistent with relativity (including correlations which are stronger than any attainable in quantum theory). In an attempt to incorporate this phenomenon, we consider expanding the space of objects to include not only correlated boxes, but ‘couplers’, which are an analogue for...
متن کاملMonotone and Boolean Convolutions for Non-compactly Supported Probability Measures
Abstract. The equivalence of the characteristic function approach and the probabilistic approach to monotone and boolean convolutions is proven for non-compactly supported probability measures. A probabilistically motivated definition of the multiplicative boolean convolution of probability measures on the positive half-line is proposed. Unlike Bercovici’s multiplicative boolean convolution it ...
متن کاملSecure positioning and quantum non-local correlations
Recently, the problem of quantum position-verification has been extensively analyzed in the formal notion but all existing ceremonial single-round position-verification schemes are insecure. We propose here a different notion for position-verification where distant verifiers determine the actions of the prover through quantum non-local correlations generated by local measurements at the provers...
متن کاملMaximally Non-Local and Monogamous Quantum Correlations
We introduce a version of the chained Bell inequality for an arbitrary number of measurement outcomes and use it to give a simple proof that the maximally entangled state of two d-dimensional quantum systems has no local component. That is, if we write its quantum correlations as a mixture of local correlations and general (not necessarily quantum) correlations, the coefficient of the local cor...
متن کاملBit Commitment from Non-Local Correlations
Central cryptographic functionalities such as encryption, authentication, or secure two-party computation cannot be realized in an information-theoretically secure way from scratch. This serves as a motivation to study what (possibly weak) primitives they can be based on. We consider as such starting points general two-party input-output systems that do not allow for message transmission, and s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2015
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2015.2452253