English
Related papers

Related papers: Algebra of Nonlocal Boxes and the Collapse of Comm…

200 papers

We propose a class of nonlocal boxes named functional boxes which include a generalization of the Popescu-Rohrlich(PR) box as a special case. We show that every functional box corresponding to an additively inseparable function can make…

Quantum Physics · Physics 2011-09-30 Guoming Wang

Non-signalling boxes (NS) are theoretical resources defined by the principle of no-faster-than-light communication. They generalize quantum correlations, and some of them are known to collapse communication complexity (CC). However, this…

Quantum Physics · Physics 2024-02-19 Pierre Botteron , Anne Broadbent , Marc-Olivier Proulx

One of the most intriguing features of quantum physics is the non-locality of correlations that can be obtained by measuring entangled particles. Recently, it has been noticed that non-locality can be studied without reference to the…

Quantum Physics · Physics 2009-11-13 Valerio Scarani

A set of nonlocal correlations that have come to be known as a PR box suggest themselves as a natural unit of nonlocality, much as a singlet is a natural unit of entanglement. We present two results relevant to this idea. One is that a wide…

Quantum Physics · Physics 2007-10-22 Jonathan Barrett , Stefano Pironio

It has long been known that the existence of certain superquantum nonlocal correlations would cause communication complexity to collapse. The absurdity of a world in which any nonlocal binary function could be evaluated with a constant…

Information Theory · Computer Science 2023-05-03 Noah Shutty , Mary Wootters , Patrick Hayden

A non-local box is an abstract device into which Alice and Bob input bits x and y respectively and receive outputs a and b respectively, where a, b are uniformly distributed and the parity of a+b equals xy. Such boxes have been central to…

Quantum Physics · Physics 2011-08-11 Marc Kaplan , Iordanis Kerenidis , Sophie Laplante , Jérémie Roland

A black box with two input bits and two output bits is called a non-local PR box, if the XOR of the output bits equals the AND of the input bits. In a recent article, Cerf et al. show that Alice and Bob, using such a PR box, can effectively…

Quantum Physics · Physics 2007-05-23 Sven Aerts

We first present a protocol for deterministically distilling non-locality, building upon a recent result of Forster et al. [Phys. Rev. Lett. 102, 120401 (2009)]. Our protocol, which is optimal for two-copy distillation, works efficiently…

Quantum Physics · Physics 2009-04-28 Nicolas Brunner , Paul Skrzypczyk

In instantaneous nonlocal quantum computation, two parties cooperate in order to perform a quantum computation on their joint inputs, while being restricted to a single round of simultaneous communication. Previous results showed that…

Quantum Physics · Physics 2016-08-24 Anne Broadbent

In a no-signaling world, the outputs of a nonlocal box cannot be completely predetermined, a feature that is exploited in many quantum information protocols exploiting non-locality, such as device-independent randomness generation and…

Quantum Physics · Physics 2018-11-15 Boris Bourdoncle , Stefano Pironio , Antonio Acin

In this paper we study the correlations that arise when two separated parties perform measurements on systems they hold locally. We restrict ourselves to those correlations with which arbitrarily fast transmission of information is…

Quantum Physics · Physics 2009-11-11 Nick S. Jones , Lluis Masanes

A non-local box is a virtual device that has the following property: given that Alice inputs a bit at her end of the device and that Bob does likewise, it produces two bits, one at Alice's end and one at Bob's end, such that the XOR of the…

Quantum Physics · Physics 2012-02-22 A. Broadbent , A. A. Methot

Quantum information processing is the emerging field that defines and realizes computing devices that make use of quantum mechanical principles, like the superposition principle, entanglement, and interference. In this review we study the…

Quantum Physics · Physics 2015-05-13 Harry Buhrman , Richard Cleve , Serge Massar , Ronald de Wolf

Communication complexity is the amount of communication needed to compute a function when the function inputs are distributed over multiple parties. In its simplest form, one-way communication complexity, Alice and Bob compute a function…

Computational Complexity · Computer Science 2023-05-24 Naresh Goud Boddu , Rahul Jain , Han-Hsuan Lin

We study the consequences of 'super-quantum non-local correlations' as represented by the PR-box model of Popescu and Rohrlich, and show PR-boxes can enhance the capacity of noisy interference channels between two senders and two receivers.…

Quantum Physics · Physics 2017-05-24 Yihui Quek , Peter Shor

For the bipartite Bell scenario with two inputs and two outputs, a nonlinear witness of dimensionally restricted nonlocality is introduced. Popescu-Rohrlich (PR) box fraction of dimensionally restricted nonlocality is then introduced and…

Quantum Physics · Physics 2026-03-06 Chellasamy Jebarathinam

Non-local correlations are among the most fascinating features of quantum theory from the point of view of information: Such correlations, although not allowing for signaling, are unexplainable by pre-shared information. The correlations…

Quantum Physics · Physics 2014-01-21 Helen Ebbe , Stefan Wolf

It is known that there exist non-local correlations that respect no-signaling criterion, but violate Bell-type inequalities more than quantum-mechanical correlations. Such super quantum correlations were introduced as the Popescu-Rohrlich…

Quantum Physics · Physics 2014-12-15 Indranil Chakrabarty , Tanumoy Pramanik , Arun K Pati , Pankaj Agrawal

For any $n$-bit boolean function $f$, we show that the randomized communication complexity of the composed function $f\circ g^n$, where $g$ is an index gadget, is characterized by the randomized decision tree complexity of $f$. In…

Computational Complexity · Computer Science 2017-03-23 Mika Göös , Toniann Pitassi , Thomas Watson

Data complexity is an important concept in the natural sciences and related areas, but lacks a rigorous and computable definition. In this paper, we focus on a particular sense of complexity that is high if the data is structured in a way…

Computer Vision and Pattern Recognition · Computer Science 2025-03-21 Louis Mahon
‹ Prev 1 2 3 10 Next ›