Related papers: Random-Receiver Quantum Communication
The multi-access channels in quantum information theory are considered. Classical messages from independent sources, which are represented as some quantum states, are transported by a channel to one address. The messages can interact with…
Quantum networks are composed of nodes which can send and receive quantum states by exchanging photons. Their goal is to facilitate quantum communication between any nodes, something which can be used to send secret messages in a secure…
Communication in a network generally takes place through a sequence of intermediate nodes connected by communication channels. In the standard theory of communication, it is assumed that the communication network is embedded in a classical…
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…
Quantum communication employs the counter-intuitive features of quantum physics to perform tasks that are im- possible in the classical world. It is crucial for testing the foundations of quantum theory and promises to rev- olutionize our…
We establish a universal complementarity relation between the capacity of classical information transmission by employing a multiparty quantum state as a multiport quantum channel, and the genuine multipartite entanglement of the quantum…
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…
We show that quantum entanglement can be used as a substitute for communication when the goal is to compute a function whose input data is distributed among remote parties. Specifically, we show that, for a particular function among three…
Quantum cryptography allows one to distribute a secret key between two remote parties using the fundamental principles of quantum mechanics. The well-known established paradigm for the quantum key distribution relies on the actual…
This paper considers a problem of quantum communication between parties that are connected through a network of quantum channels. The model in this paper assumes that there is no prior entanglement shared among any of the parties, but that…
A classical one-time pad allows two parties to send private messages over a public classical channel -- an eavesdropper who intercepts the communication learns nothing about the message. A quantum one-time pad is a shared quantum state…
We consider the problem of hiding sender and receiver of classical and quantum bits (qubits), even if all physical transmissions can be monitored. We present a quantum protocol for sending and receiving classical bits anonymously, which is…
As our main result we show that, in order to achieve the randomness assisted message - and entanglement transmission capacities of a finite arbitrarily varying quantum channel it is not necessary that sender and receiver share…
In this paper we propose a new model for arbitrarily varying classical-quantum channels. In this model a jammer has side information. We consider two scenarios. In the first scenario the jammer knows the channel input, while in the second…
We study an analog of the well-known Gel'fand Pinsker Channel which uses quantum states for the transmission of the data. We consider the case where both the sender's inputs to the channel and the channel states are to be taken from a…
A quantum network, which involves multiple parties pinging each other with quantum messages, could revolutionize communication, computing and basic sciences. The future internet will be a global system of various packet switching quantum…
We investigate how a classical private key can be used by two players, connected by an insecure one-way quantum channel, to perform private communication of quantum information. In particular we show that in order to transmit n qubits…
Using random Gaussian vectors and an information-uncertainty relation, we give a proof that the coherent information is an achievable rate for entanglement transmission through a noisy quantum channel. The codes are random subspaces…
We consider quantum channels with one sender and two receivers, used in several different ways for the simultaneous transmission of independent messages. We begin by extending the technique of superposition coding to quantum channels with a…
Distributed computing, involving multiple servers collaborating on designated computations, faces a critical challenge in optimizing inter-server communication -- an issue central to the study of communication complexity. Quantum resources…