English
Related papers

Related papers: Non-Local Box Complexity and Secure Function Evalu…

200 papers

Quantum nonlocality is presented often as the most remarkable and inexplicable phenomenon known to modern science which was confirmed in the experiments proving the violation of Bell Inequalities (BI). It has been known already for a long…

Quantum Physics · Physics 2021-06-09 Marian Kupczynski

We consider the scenario where Alice wants to send a secret (classical) $n$-bit message to Bob using a classical key, and where only one-way transmission from Alice to Bob is possible. In this case, quantum communication cannot help to…

Quantum Physics · Physics 2007-05-23 Ivan Damgaard , Thomas Pedersen , Louis Salvail

We propose a protocol for Alice to implement a multiqubit quantum operation from the restricted sets on distant qubits possessed by Bob, and then we investigate the communication complexity of the task in different communication scenarios.…

Quantum Physics · Physics 2012-10-11 Haozhen Situ , Daowen Qiu

Alice and Bob are given $n$-bit integer pairs $(x,y)$ and $(a,b)$, respectively, and they must decide if $y=ax+b$. We prove that the randomised communication complexity of this Point--Line Incidence problem is $\Theta(\log n)$. This…

Computational Complexity · Computer Science 2026-04-07 Mika Göös , Nathaniel Harms , Florian K. Richter , Anastasia Sofronova

Fingerprinting is a technique in communication complexity in which two parties (Alice and Bob) with large data sets send short messages to a third party (a referee), who attempts to compute some function of the larger data sets. For the…

Quantum Physics · Physics 2016-09-08 J. Niel de Beaudrap

Bell nonlocality is a valuable resource in quantum information processing tasks. Scientists are interested in whether a single entangled state can generate a long sequence of nonlocal correlations. Previous work has accomplished sequential…

Quantum Physics · Physics 2024-06-27 Yiyang Xu , Hao Sun , Fenzhuo Guo , Haifeng Dong , Qiaoyan Wen

We introduce a gossip-like protocol for covert message passing between Alice and Bob as they move in an area watched over by a warden Willie. The area hosts a multitude of Internet of (Battlefield) Things (Io\b{eta}T) objects. Alice and Bob…

Information Theory · Computer Science 2021-12-23 Pei Peng , Emina Soljanin

Entanglement appears under two different forms in quantum theory, namely as a property of states of joint systems and as a property of measurement eigenstates in joint measurements. By combining these two aspects of entanglement, it is…

Alice and Bob each have half of a pair of entangled qubits. Bob measures his half and then passes his qubit to a second Bob who measures again and so on. The goal is to maximize the number of Bobs that can have an expected violation of the…

Quantum Physics · Physics 2020-09-02 Peter J. Brown , Roger Colbeck

We consider the problem of zero-error function computation with side information. Alice and Bob have correlated sources $X,Y$ with joint p.m.f. $p_{XY}(\cdot, \cdot)$. Bob wants to calculate $f(X,Y)$ with zero error. Alice encodes…

Information Theory · Computer Science 2025-12-24 Ruoyu Meng , Aditya Ramamoorthy

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…

Quantum Physics · Physics 2016-08-30 Sacha Schwarz , Andre Stefanov , Stefan Wolf , Alberto Montina

In coin tossing two remote participants want to share a uniformly distributed random bit. At the least in the quantum version, each participant test whether or not the other has attempted to create a bias on this bit. It is requested that,…

Quantum Physics · Physics 2018-02-28 Dominic Mayers , Louis Salvail , Yoshie Chiba-Kohno

We study the computation complexity of Boolean functions in the quantum black box model. In this model our task is to compute a function $f:\{0,1\}\to\{0,1\}$ on an input $x\in\{0,1\}^n$ that can be accessed by querying the black box.…

Quantum Physics · Physics 2017-01-25 Andris Ambainis , Janis Iraids

After carrying out a protocol for quantum key agreement over a noisy quantum channel, the parties Alice and Bob must process the raw key in order to end up with identical keys about which the adversary has virtually no information. In…

Quantum Physics · Physics 2013-01-22 N. Gisin , S. Wolf

Quantum mechanical effects have enabled the construction of cryptographic primitives that are impossible classically. For example, quantum copy-protection allows for a program to be encoded in a quantum state in such a way that the program…

Quantum Physics · Physics 2022-09-07 Alexandru Gheorghiu , Tony Metger , Alexander Poremba

Many quantum information tasks rely on entanglement, which is used as a resource, for example, to enable efficient and secure communication. Typically, noise, accompanied by loss of entanglement, reduces the efficiency of quantum protocols.…

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

Quantum Physics · Physics 2013-11-22 Helen Ebbe , Stefan Wolf

In a recent work (Ghazi et al., SODA 2016), the authors with Komargodski and Kothari initiated the study of communication with contextual uncertainty, a setup aiming to understand how efficient communication is possible when the…

Information Theory · Computer Science 2017-05-03 Badih Ghazi , Madhu Sudan

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

We further study the keyless authentication problem in a noisy model in our previous work, where no secret setup is available for sender Alice and receiver Bob while there is DMC $W_1$ from Alice to Bob and a two-way noiseless but insecure…

Information Theory · Computer Science 2014-09-08 Shaoquan Jiang