Related papers: The Impossibility of Pseudo-Telepathy Without Quan…
Quantum resources may provide advantage over their classical counterparts. Theoretically, in certain tasks, this advantage can be very high. In this work, we construct such a task based on a game, mediated by Referee and played between…
We consider the problem of teleporting an unknown information state within a quantum network by a sender, say, Alice to any given receiver out of several receivers, say, Bob(1), Bob(2), ...., Bob(n). For this task, we suggest two schemes…
Quantum teleportation is a primitive foundational protocol for exchanging quantum information in a quantum network as well as infrastructural operational strategy in the measurement-based quantum computation. Designing an efficient scheme…
Pseudo-telepathy is the most recent form of rejection of locality. Many of its properties have already been discovered: for instance, the minimal entanglement, as well as the minimal cardinality of the output sets, have been characterized.…
A user, Alice, wants to get server Bob to implement a quantum computation for her. However, she wants to leave him blind to what she's doing. What are the minimal communication resources Alice must use in order to achieve…
Communication complexity is the amount of communication needed to compute a function when the function inputs are distributed over multiple parties. In its simplest form, one-way communication complexity, Alice and Bob compute a function…
Suppose two distant observers Alice and Bob share a pure bipartite quantum state. By applying local operations and communicating with each other using a classical channel, Alice and Bob can manipulate it into some other states. Previous…
We present a scheme for quantum communication, where a set of EPR pairs, initially shared by the sender Alice and the receiver Bob, functions as a quantum channel. After insuring the safety of the quantum channel, Alice applies local…
We show that with the fourpartite quantum channel used to teleport an arbitrary two qubit state, we can construct a superdense coding protocol where it is possible to transmit 4 bits of classical information sending only 2 qubits. Alice and…
Two schemes for quantum secure conditional direct communication are proposed, where a set of EPR pairs of maximally entangled particles in Bell states, initially made by the supervisor Charlie, but shared by the sender Alice and the…
We propose an entanglement sharing protocol based on separable states. Initially, two parties, Alice and Bob, share a two-mode separable Gaussian state. Alice then splits her mode into two separable modes and distributes them between two…
If Alice must communicate with Bob over a channel shared with the adversarial Eve, then Bob must be able to validate the authenticity of the message. In particular we consider the model where Alice and Eve share a discrete memoryless…
We present a quantum scheme for signing contracts between two clients (Alice and Bob) using entangled states and the services of a third trusted party (Trent). The trusted party is only contacted for the initialization of the protocol, and…
This paper introduces two information-theoretically secure protocols that achieve quantum secure direct communication between Alice and Bob in the first case, and among Alice, Bod and Charlie in the second case. Both protocols use the same…
The quantum channel subject to local interaction with two-level environment is studied. The two-level environment is regarded as a quantum bit (qubit) as well as a pair of particles owned by Alice and Bob. The amount of entanglement…
A locking protocol between two parties is as follows: Alice gives an encrypted classical message to Bob which she does not want Bob to be able to read until she gives him the key. If Alice is using classical resources, and she wants to…
In this paper we quantize the Card Game. In the classical version of this game, one player (Alice) can always win with propability 2/3. But when the other player (Bob) is allowed to apply quantum strategy, the original unfair game turns…
Cyclic quantum teleportation schemes requires at least the existence of three collaborators acting all as senders and receivers of quantum information, each one of them has an information to be transmitted to the next neighbour in a…
Shared entanglement is a resource available to parties communicating over a quantum channel, much akin to public coins in classical communication protocols. Whereas shared randomness does not help in the transmission of information, or…
We proposed a new scheme for quantum key distribution based on entanglement swapping. By this protocol \QTR{em}{Alice} can securely share a random quantum key with \QTR{em}{Bob}, without transporting any particle.