Related papers: Entanglement assisted random access codes
We present Authenticated Multiuser Quantum Direct Communication(MQDC) protocols using entanglement swapping. Quantum direct communication is believed to be a safe way to send a secret message without quantum key distribution. The…
Conventional quantum routing operates under the entrenched assumption that pathfinding is a prerequisite for routing. This classical-inspired routing model imposes a restricting design option, which prevents scaling the quantumness to the…
In a variant of communication tasks, players cooperate in choosing their local strategies to compute a given task later, working separately. Utilizing quantum bits for communication and sharing entanglement between parties is a recognized…
We introduce a protocol for quantum secret sharing based on reusable entangled states. The entangled state between the sender and the receiver acts only as a carrier to which data bits are entangled by the sender and disentangled from it by…
We address the problem of coding for classical multiple-access channels (MACs) with the assistance of non-signaling correlations between parties. It is well-known that non-signaling assistance does not change the capacity of classical…
We present a general theory of entanglement-assisted quantum convolutional coding. The codes have a convolutional or memory structure, they assume that the sender and receiver share noiseless entanglement prior to quantum communication, and…
We propose a novel random multiple access (RMA) scheme with quality of service (QoS) guarantees for machine-to-machine (M2M) communications. We consider a slotted uncoordinated data transmission period during which machine type…
Communication networks have multiple users, each sending and receiving messages. A multiple access channel (MAC) models multiple senders transmitting to a single receiver, such as the uplink from many mobile phones to a single base station.…
We study a problem of interconvertibility of two supra-quantum resources: one is so called PR-box, which violates CHSH inequality up to maximal algebraic bound, and second is so called random access code (RAC). The latter is a functionality…
This paper studies information-theoretically secure quantum homomorphic encryption (QHE) schemes of classical data. Previous works on information-theoretically secure QHE schemes (like Childs'05, Liang'13, and others) are typically based on…
A new channel coding approach was proposed in [1] for random multiple access communication over the discrete-time memoryless channel. The coding approach allows users to choose their communication rates independently without sharing the…
A key goal of quantum communication is to determine the maximum number of bits shared between two quantum systems. An important example of this is in entanglement based quantum key distribution (QKD) schemes. A realistic treatment of this…
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.
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…
We show how nonclassical correlations in local bipartite states can act as a resource for quantum information processing. Considering the task of quantum random access codes (RAC) through separable Bell-diagonal states, we demonstrate the…
All communication channels are at bottom quantum mechanical. Quantum mechanics contributes both obstacles to communication in the form of noise, and opportunities in the use of intrinsically quantum representations for information. This…
Entanglement is unanimously recognized as the key communication resource of the Quantum Internet. Yet, the possibility of implementing novel network functionalities by exploiting the marvels of entanglement has been poorly investigated so…
We show how entanglement-assisted codes can be constructed from arbitrary quantum codes by associating them with quantum codes for erasure channels. If a subset of physical qubits is correctable for an erasure error, then it naturally forms…
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…
I introduce a new notion, that extends the mutually unbiased bases (MUB) conditons to more than two bases. These, I call the nUB conditions, and the corresponding bases $n$-fold unbiased. They naturally appear while optimizing generic…