Random-Receiver Quantum Communication
- URL: http://arxiv.org/abs/2012.15459v1
- Date: Thu, 31 Dec 2020 05:57:15 GMT
- Title: Random-Receiver Quantum Communication
- Authors: Some Sankar Bhattacharya, Ananda G. Maity, Tamal Guha, Giulio
Chiribella, Manik Banik
- Abstract summary: We introduce the task of random-receiver quantum communication, in which a sender transmits a quantum message to a receiver chosen from a list of n spatially separated parties.
The choice of receiver is unknown to the sender, but is known by the n parties, who coordinate their actions by exchanging classical messages.
- Score: 0.4893345190925177
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: We introduce the task of random-receiver quantum communication, in which a
sender transmits a quantum message to a receiver chosen from a list of n
spatially separated parties. The choice of receiver is unknown to the sender,
but is known by the n parties, who coordinate their actions by exchanging
classical messages. In normal conditions, random-receiver quantum communication
requires a noiseless quantum communication channel from the sender to each of
the n receivers. In contrast, we show that random-receiver quantum
communication can take place through entanglement-breaking channels if the
order of such channels is controlled by a quantum bit that is accessible
through quantum measurements. Notably, this phenomenon cannot be mimicked by
allowing free quantum communication between the sender and any subset of k<n
parties.
Related papers
- Quantum networks using counterfactual quantum communication [0.0]
We propose a new counterfactual quantum communication protocol for transmitting an entangled state from a pair of electrons to two independent photons.
We show that the protocol finds uses in building quantum repeaters leading to a counterfactual quantum network.
arXiv Detail & Related papers (2024-01-30T19:27:09Z) - Quantum Multiple-Access One-Time Pad [9.137554315375919]
We introduce and analyze an information theoretical task that we call the quantum multiple-access one-time pad.
A number of senders initially share a correlated quantum state with a receiver and an eavesdropper.
We derive a single-letter characterization for the achievable rate region in a limit of infinitely many copies and vanishingly small error.
arXiv Detail & Related papers (2022-08-25T11:43:24Z) - Quantum Semantic Communications for Resource-Efficient Quantum Networking [52.3355619190963]
This letter proposes a novel quantum semantic communications (QSC) framework exploiting advancements in quantum machine learning and quantum semantic representations.
The proposed framework achieves approximately 50-75% reduction in quantum communication resources needed, while achieving a higher quantum semantic fidelity.
arXiv Detail & Related papers (2022-05-05T03:49:19Z) - Classical analogue of quantum superdense coding and communication advantage of a single quantum system [0.0]
We show that a qubit communication without any assistance of classical shared randomness can achieve the goal.
We also study communication utility of a class of non-classical toy systems described by symmetric polygonal state spaces.
arXiv Detail & Related papers (2022-02-14T15:29:59Z) - Improvement in quantum communication using quantum switch [4.350783459690612]
We show that some useless (for communication) channels may provide useful communication under the action of quantum switch.
We demonstrate that the quantum switch can also be useful in preventing the loss of coherence in a system.
arXiv Detail & Related papers (2021-08-31T17:51:40Z) - Direct Quantum Communications in the Presence of Realistic Noisy
Entanglement [69.25543534545538]
We propose a novel quantum communication scheme relying on realistic noisy pre-shared entanglement.
Our performance analysis shows that the proposed scheme offers competitive QBER, yield, and goodput.
arXiv Detail & Related papers (2020-12-22T13:06:12Z) - Quantum Broadcast Channels with Cooperating Decoders: An
Information-Theoretic Perspective on Quantum Repeaters [78.7611537027573]
Communication over a quantum broadcast channel with cooperation between the receivers is considered.
We develop lower and upper bounds on the capacity region in each setting.
arXiv Detail & Related papers (2020-11-18T11:58:48Z) - Fault-tolerant Coding for Quantum Communication [71.206200318454]
encode and decode circuits to reliably send messages over many uses of a noisy channel.
For every quantum channel $T$ and every $eps>0$ there exists a threshold $p(epsilon,T)$ for the gate error probability below which rates larger than $C-epsilon$ are fault-tolerantly achievable.
Our results are relevant in communication over large distances, and also on-chip, where distant parts of a quantum computer might need to communicate under higher levels of noise.
arXiv Detail & Related papers (2020-09-15T15:10:50Z) - Quantum Channel State Masking [78.7611537027573]
Communication over a quantum channel that depends on a quantum state is considered when the encoder has channel side information (CSI) and is required to mask information on the quantum channel state from the decoder.
A full characterization is established for the entanglement-assisted masking equivocation region, and a regularized formula is given for the quantum capacity-leakage function without assistance.
arXiv Detail & Related papers (2020-06-10T16:18:03Z) - Single-Shot Secure Quantum Network Coding for General Multiple Unicast
Network with Free One-Way Public Communication [56.678354403278206]
We propose a canonical method to derive a secure quantum network code over a multiple unicast quantum network.
Our code correctly transmits quantum states when there is no attack.
It also guarantees the secrecy of the transmitted quantum state even with the existence of an attack.
arXiv Detail & Related papers (2020-03-30T09:25:13Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.