Related papers: Non-Local Box Complexity and Secure Function Evalu…
We prove that there is no finite-alphabet nonlocal box that generates exactly those correlations that can be generated using a maximally entangled pair of qubits. More generally, we prove that if some finite-alphabet nonlocal box is strong…
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…
We present decidability results for a sub-class of "non-interactive" simulation problems, a well-studied class of problems in information theory. A non-interactive simulation problem is specified by two distributions $P(x,y)$ and $Q(u,v)$:…
Quantum resources can be more powerful than classical resources - a quantum computer can solve certain problems exponentially faster than a classical computer, and computing a function of two people's inputs can be done with exponentially…
There is an ongoing search for a physical or operational definition for quantum mechanics. Several informational principles have been proposed which are satisfied by a theory less restrictive than quantum mechanics. Here, we introduce the…
The notions of entanglement and nonlocality are among the most striking ingredients found in quantum information theory. One tool to better understand these notions is the model of nonlocal games; a mathematical framework that abstractly…
Nonlocality and its connections to entanglement are fundamental features of quantum mechanics that have found numerous applications in quantum information science. A set of correlations is said to be nonlocal if it cannot be reproduced by…
We investigate the feasibility of quantum seals. A quantum seal is a state provided by Alice to Bob along with information which Bob can use to make a measurement, "break the seal," and read the classical message stored inside. There are…
Understanding the structure of nonlocal correlations is important in many fields ranging from fundamental questions of physics to device-independent cryptography. We present a protocol that can convert extremal two-party--two-input nonlocal…
A number of complexity measures for Boolean functions have previously been introduced. These include (1) sensitivity, (2) block sensitivity, (3) witness complexity, (4) subcube partition complexity and (5) algorithmic complexity. Each of…
We study the communication complexity of computing functions $F:\{0,1\}^n\times \{0,1\}^n \rightarrow \{0,1\}$ in the memoryless communication model. Here, Alice is given $x\in \{0,1\}^n$, Bob is given $y\in \{0,1\}^n$ and their goal is to…
This paper illustrates a direct connection between quantum steering and non-trivial preparation contextuality. In two party-two measurement per party-two outcomes per measurement $(2-2-2)$ Bell scenario, any argument of Bell nonlocality is…
Inspired from quantum key distribution, we consider wireless communication between Alice and Bob when the intermediate space between Alice and Bob is controlled by Eve. That is, our model divides the channel noise into two parts, the noise…
We provide an interesting two-party parity oblivious communication game whose success probability is solely determined by the Bell expression. The parity-oblivious condition in an operational quantum theory implies the preparation…
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…
It has recently been shown that all causal correlations between two parties which output each one bit, a and b, when receiving each one bit, x and y, can be expressed as convex combinations of local correlations (i.e., correlations that can…
We have implemented an experimental set-up in order to demonstrate the feasibility of time-coding protocols for quantum key distribution. Alice produces coherent 20 ns faint pulses of light at 853 nm. They are sent to Bob with delay 0 ns…
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…
Oblivious transfer is a fundamental cryptographic primitive which is useful for secure multiparty computation. There are several variants of oblivious transfer. We consider 1 out of 2 oblivious transfer, where a sender sends two bits of…
Unconditionally secure non-relativistic bit commitment is known to be impossible in both the classical and the quantum worlds. But when committing to a string of n bits at once, how far can we stretch the quantum limits? In this paper, we…