Related papers: Quantum advantages of communication complexity fro…
The communication complexity of a quantum channel is the minimal amount of classical communication required for classically simulating the process of preparation, transmission through the channel, and subsequent measurement of a quantum…
We consider relations between communication complexity problems and detecting correlations (violating local realism) with no local hidden variable model. We show first universal equivalence between characteristics of protocols used in that…
A Bell test separates quantum mechanics from a classical, local realist theory of physics. However, a Bell test cannot separate quantum physics from all classical theories. Classical devices supplemented with non-signaling correlations,…
Recently, Brassard et. al. conjectured that the fact that the maximal possible correlations between two non-local parties are the quantum-mechanical ones is linked to a reasonable restriction on communication complexity. We provide further…
Communication scenarios between two parties can be implemented by first encoding messages into some states of a physical system which acts as the physical medium of the communication and then decoding the messages by measuring the state of…
The study of ontology (hidden variables) provides for a vital ground on which significant non-classical features of quantum theory are revealed. One such non-classical ontic-feature is preparation contextuality (PC) and advantage in…
We consider a variation of the multi-party communication complexity scenario where the parties are supplied with an extra resource: particles in an entangled quantum state. We show that, although a prior quantum entanglement cannot be used…
This paper investigates the powers and limitations of quantum entanglement in the context of cooperative games of incomplete information. We give several examples of such nonlocal games where strategies that make use of entanglement…
Bell inequalities limit the possible observations of non-communicating parties. Here, we present analogous inequalities for any number of communicating parties under the causal constraints of static causal order, definite causal order, and…
Since the seminal work of Paturi and Simon \cite[FOCS'84 & JCSS'86]{PS86}, the unbounded-error classical communication complexity of a Boolean function has been studied based on the arrangement of points and hyperplanes. Recently,…
As a consequence of Bell's theorem, the statistics of measurements on some entangled states cannot be simulated with local hidden variables alone. The amount of communication that must be supplied is an intuitive quantifier of…
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…
Entanglement is known to boost the efficiency of classical communication. In distributed computation, for instance, exploiting entanglement can reduce the number of communicated bits or increase the probability to obtain a correct answer.…
We study nondeterministic multiparty quantum communication with a quantum generalization of broadcasts. We show that, with number-in-hand classical inputs, the communication complexity of a Boolean function in this communication model…
I show that a simple multi-party communication task can be performed more efficiently with quantum communication than with classical communication, even with low detection efficiency $\eta$. The task is a communication complexity problem in…
Contextuality is arguably the fundamental property that makes quantum mechanics different from classical physics. It is responsible for quantum computational speedups in both magic-state-injection-based and measurement-based models of…
We present a multipartite nonlocal game in which each player must guess the input received by his neighbour. We show that quantum correlations do not perform better than classical ones at this game, for any prior distribution of the inputs.…
We consider communication scenarios with multiple senders and a single receiver. Focusing on communication tasks where the distinguishability or anti-distinguishability of the sender's input is bounded, we show that quantum strategies…
In this letter we show that communication when restricted to a single information carrier (i.e. single particle) and finite speed of propagation is fundamentally limited for classical systems. On the other hand, quantum systems can surpass…
A problem in quantum information theory is to find the experimental setup that maximizes the nonlocality of correlations with respect to some suitable measure such as the violation of Bell inequalities. The latter has however some…