Related papers: Non-Local Box Complexity and Secure Function Evalu…
The goal of two-party cryptography is to enable two parties, Alice and Bob, to solve common tasks without the need for mutual trust. Examples of such tasks are private access to a database, and secure identification. Quantum communication…
We prove a general lower bound on the bounded-error entanglement-assisted quantum communication complexity of Boolean functions. The bound is based on the concept that any classical or quantum protocol to evaluate a function on distributed…
Nonlocality, as demonstrated by the violation of Bell inequalities, enables device-independent cryptographic tasks that do not require users to trust their apparatus. In this article, we consider devices whose inputs are spatiotemporal…
We obtain strict upper bounds on the bit transmission rate for communication of Classical bit codewords over Quantum channels. Albeit previous arguments in arXiv: 1804.01797 which have demonstrated that lower bounds can be shown to hold for…
We consider classical and entanglement-assisted versions of a distributed computation scheme that computes nonlinear Boolean functions of a set of input bits supplied by separated parties. Communication between the parties is restricted to…
We consider the multiplicative complexity of Boolean functions with multiple bits of output, studying how large a multiplicative complexity is necessary and sufficient to provide a desired nonlinearity. For so-called $\Sigma\Pi\Sigma$…
An algorithm for computing the nonlinearity of a Boolean function from its algebraic normal form (ANF) is proposed. By generalizing the expression of the weight of a Boolean function in terms of its ANF coefficients, a formulation of the…
Imagine a task in which a group of separated players aim to simulate a statistic that violates a Bell inequality. Given measurement choices the players shall announce an output based solely on the results of local operations -- which they…
Nonlocality is the most characteristic feature of quantum mechanics. John Bell, in his seminal 1964 work, proved that local-realism imposes a bound on the correlations among the measurement statistics of distant observers. Surpassing this…
Quantum nonlocality is often judged by violations of Bell-type inequalities for a given state. The computation of such violations is a global task, requiring evaluation of global correlations and subsequent testing against a Bell…
Non-locality sharing for a three-qubit system via multilateral sequential measurements was deeply discussed. Different from 2-qubit case, it is shown that non-locality sharing between $\mathrm{Alice_{1}-Bob_{1}-Charlie_{1}}$ and…
In standard number-in-hand multi-party communication complexity, performance is measured as the total number of bits transmitted globally in the network. In this paper, we study a variation called local communication complexity in which…
Non-local quantum computation (NLQC) replaces a local interaction between two systems with a single round of communication and shared entanglement. Despite many partial results, it is known that a characterization of entanglement cost in at…
Extremal non-signaling (ENS) boxes are correlations that correspond to vertices of the non-signaling polytope of a Bell scenario. Neither quantum theory nor any theory for ideal measurements allows for ENS boxes. That is, according to…
We explain the mechanism of the quantum speed-up - quantum algorithms requiring fewer computation steps than their classical equivalent - for a family of algorithms. Bob chooses a function and gives to Alice the black box that computes it.…
Standard multiparty Bell experiments involve a single source shared by a set of observers. In contrast, network Bell experiments feature multiple independent sources, and each of them may distribute physical systems to a set of observers…
Understanding the connections between different quantum information protocols has been proven fruitful for both theoretical insights and experimental applications. In this work, we explore the relationship between non-local and…
The mathematical framework of quantum theory, though fundamentally distinct from classical physics, raises the question of whether quantum processes can be efficiently simulated using classical resources. For instance, a sender (Alice)…
We quantify the amount of non-locality contained in n noisy versions of so-called Popescu-Rohrlich boxes (PRBs), i.e., bipartite systems violating the CHSH Bell inequality maximally. Following the approach by Elitzur, Popescu, and Rohrlich,…
Bob hides a ball in one of four drawers. Alice is to locate it. Classically she has to open up to three drawers, quantally just one. The fundamental reason for this quantum speedup is not known. The usual representation of the quantum…