Related papers: The Impossibility of Pseudo-Telepathy Without Quan…
We analyze utility of communication channels in absence of any short of quantum or classical correlation shared between the sender and the receiver. To this aim, we propose a class of two-party communication games, and show that the games…
Entanglement swapping between Einstein-Podolsky-Rosen (EPR) pairs can be used to generate the same sequence of random bits in two remote places. A quantum key distribution protocol based on this idea is described. The scheme exhibits the…
A quantum algorithm succeeds not because the superposition principle allows 'the computation of all values of a function at once' via 'quantum parallelism,' but rather because the structure of a quantum state space allows new sorts of…
Quantum resources may provide advantage over their classical counterparts. We say this as quantum advantage. Here we consider a single communication task to study different approaches of observing quantum advantage. We say this setting as a…
Quantum entanglement has been recently demonstrated as a useful resource in conflicting interest games of incomplete information between two players, Alice and Bob [Pappa et al., Phys. Rev. Lett. 114, 020401 (2015)]. General setting for…
We give a (remote) quantum gambling scheme that makes use of the fact that quantum nonorthogonal states cannot be distinguished with certainty. In the proposed scheme, two participants Alice and Bob can be regarded as playing a game of…
Here, we present the quantum version of a very famous statistical decision problem, whose classical version is counter-intuitive to many. The Monty Hall game can be phrased as a two person game between Alice and Bob. In their pioneering…
Quantum teleportation allows one to transmit an arbitrary qubit from point A to point B using a pair of (pre-shared) entangled qubits and classical bits of information. The conventional protocol for teleportation uses two bits of classical…
We explicitly show a protocol in which an arbitrary two qubit a|00> + b|01> + c|10> + d|11> is faithfully and deterministically teleported from Alice to Bob. We construct the 16 orthogonal generalized Bell states which can be used to…
Ideal quantum teleportation transfers an unknown quantum state intact from one party Alice to the other Bob via the use of a maximally entangled state and the communication of classical information. If Alice and Bob do not share…
A fundamental limitation of quantum communication is that a single qubit can carry at most 1 bit of classical information. For an important class of quantum communication channels, known as entanglement-breaking, this limitation holds even…
We consider an application of the mathematical formalism of quantum mechanics (QM) outside physics, namely, to game theory. We present a simple game between macroscopic players, say Alice and Bob (or in a more complex form - Alice, Bob and…
It has long been assumed in physics that for information to travel between two parties in empty space, "Alice" and "Bob", physical particles have to travel between them. Here, using the "chained" quantum Zeno effect, we show how, in the…
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…
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…
We present relation problems whose input size is $n$ such that they can be solved with no communication for entanglement-assisted quantum communication models, but require $\Omega(n)$ qubit communication for $2$-way quantum communication…
This paper considers a two-terminal problem in which Alice and Bob aim to perform a joint measurement on a bipartite quantum system $\rho^{AB}$. Alice transmits the results of her measurements to Bob over a classical channel, and the two…
The cryptographic protocol of coin tossing consists of two parties, Alice and Bob, that do not trust each other, but want to generate a random bit. If the parties use a classical communication channel and have unlimited computational…
We answer an open question about Quantum Key Recycling (QKR): Is it possible to put the message entirely in the qubits without increasing the number of qubits? We show that this is indeed possible. We introduce a prepare-and-measure QKR…
Quantum telepathy is the phenomenon where two non-communicating parties can exhibit correlated behaviors that are impossible to achieve using classical resources. This is also known as Bell inequality violation and is made possible by…