Related papers: Generalized parity-oblivious communication games p…
We describe human-subject laboratory experiments on probabilistic auctions based on previously proposed auction protocols involving the simulated manipulation and communication of quantum states. These auctions are probabilistic in…
In a two-player game, two cooperating but non communicating players, Alice and Bob, receive inputs taken from a probability distribution. Each of them produces an output and they win the game if they satisfy some predicate on their…
Quantum correlations provide dramatic advantage over the corresponding classical resources in several communication tasks. However a broad class of probabilistic theories exists that attributes greater success than quantum theory in many of…
This paper studies incomplete-information games in which an information provider, an oracle, publicly discloses information to the players. One oracle is said to dominate another if, in every game, it can replicate the equilibrium outcomes…
We analyse two party non-local games whose predicate requires Alice and Bob to generate matching bits, and their three party extensions where a third player receives all inputs and is required to output a bit that matches that of the…
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…
The proof of the No-Go Theorem of unconditionally secure quantum bit commitment depends on the assumption that Alice knows every detail of the protocol, including the probability distributions associated with all the random variables…
We give operational meaning to wave-particle duality in terms of discrimination games. Duality arises as a constraint on the probability of winning these games. The games are played with the aid of an n-port interferometer, and involve 3…
Universal contextuality is the leading notion of non-classicality even for single systems, showing its advantage as a more general quantum correlation than Bell non-locality, as well as preparation contextuality. However, a loophole-free…
The characterization of multi-time correlations in open quantum systems is of fundamental importance. In this work, we investigate multi-time processes using the process matrix formalism and show that the presence of a quantum non-Markovian…
A wide variety of goals could cause an AI to disable its off switch because "you can't fetch the coffee if you're dead" (Russell 2019). Prior theoretical work on this shutdown problem assumes that humans know everything that AIs do. In…
Cooperative game theory has diverse applications in contemporary artificial intelligence, including domains like interpretable machine learning, resource allocation, and collaborative decision-making. However, specifying a cooperative game…
Quantum private query (QPQ) is a kind of quantum protocols to protect both users' privacy in their communication. There is an interesting example, that is, Alice wants to buy one item from Bob's database, which is composed of a quantity of…
In quantum weak oblivious transfer, Alice sends Bob two bits and Bob can learn one of the bits at his choice. It was found that the security of such a protocol is bounded by $2P_{Alice}^{\ast }+P_{Bob}^{\ast }\geq 2$, where $P_{Alice}^{\ast…
Oblivious transfer is a fundamental cryptographic primitive in which Bob transfers one of two bits to Alice in such a way that Bob cannot know which of the two bits Alice has learned. We present an optimal security bound for quantum…
In [ PRL, 102, 010401 (2009)], Spekkens et al., have shown that quantum preparation contextuality can power the parity-oblivious multiplexing (POM) task. The bound on the optimal success probability of $n$-bit POM task performed with the…
A random access code (RAC) is a communication task in which the sender encodes a random message into a shorter one to be decoded by the receiver so that a randomly chosen character of the original message is recovered with some probability.…
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…
Using formal tools in computer science to describe games is an interesting problem. We give games, exactly two person games, an axiomatic foundation based on the process algebra ACP (Algebra of Communicating Process). A fresh operator…
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…