Related papers: A scheme for quantum communication using EPR pairs…
In recent years, neural networks have been used to implement symmetric cryptographic functions for secure communications. Extending this domain, the proposed approach explores the application of asymmetric cryptography within a neural…
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)…
The possibility of attaining current position of the message sender without person's consent seriously compromises the secrecy of correspondence. Classical communication systems cannot guarantee the security of communication against…
We show how to create maximally entangled EPR pairs between spatially distant atoms, each of them inside a high-Q optical cavity, by sending photons through a general, noisy channel, such as a standard optical fiber. An error correction…
A notion of asymmetric quantum dialogue (AQD) is introduced. Conventional protocols of quantum dialogue are essentially symmetric as both the users (Alice and Bob) can encode the same amount of classical information. In contrast, the scheme…
We consider entanglement-assisted (EA) private communication over a quantum broadcast channel, in which there is a single sender and multiple receivers. We divide the receivers into two sets: the decoding set and the malicious set. The…
Data multiplexing within a quantum computer can allow for the simultaneous transfer of multiple streams of information over a shared medium thereby minimizing the number of channels needed for requisite data transmission. Here, we…
Suppose that a transmitter Alice potentially wishes to communicate with a receiver Bob over an adversarially jammed binary channel. An active adversary James eavesdrops on their communication over a binary symmetric channel (BSC(q)), and…
Quantum secret sharing (QSS) is a protocol to split a message into several parts so that no subset of parts is sufficient to read the message, but the entire set is. In the scheme, three parties Alice, Bob and Charlie first share a…
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…
Quantum communication typically involves a linear chain of repeater stations, each capable of reliable local quantum computation and connected to their nearest neighbors by unreliable communication links. The communication rate in existing…
Since a quantum measurement generally disturbs the state of a quantum system, one might think that it should not be possible for a sender and receiver to communicate reliably when the receiver performs a large number of sequential…
We investigate the possibility of eavesdropping on a quantum key distribution network by local sequential quantum unsharp measurement attacks by the eavesdropper. In particular, we consider a pure two-qubit state shared between two parties…
Implementations of many quantum communication protocols require sources of photon pairs. However, optimization of the properties of these photons for specific applications is an open problem. We theoretically demonstrate the possibility of…
We study general teleportation scheme with an arbitrary state of the pair of particles (2 and 3) shared by Alice and Bob, and arbitrary measurements on the input particle 1 and one of the members (2) of the pair on Alice's side. We find an…
A simple protocol is described for transferring spatial direction from Alice to Bob (two spatially separated observers) up to inversion. The two observers are assumed to share quantum singlet states and classical communication. The protocol…
A quantum key distribution protocol based on quantum encryption is presented in this Brief Report. In this protocol, the previously shared Einstein-Podolsky-Rosen pairs act as the quantum key to encode and decode the classical cryptography…
We give a proof that entanglement purification, even with noisy apparatus, is sufficient to disentangle an eavesdropper (Eve) from the communication channel. In the security regime, the purification process factorises the overall initial…
In the quantum compression scheme proposed by Schumacher, Alice compresses a message that Bob decompresses. In that approach, there is some probability of failure and, even when successful, some distortion of the state. For sufficiently…
We present a scheme for quantum secure direct communication with quantum encryption. The two authorized users use repeatedly a sequence of the pure entangled pairs (quantum key) shared for encrypting and decrypting the secret message…