Entanglement-Enabled Communication

@article{Ntzel2020EntanglementEnabledC,
  title={Entanglement-Enabled Communication},
  author={Janis N{\"o}tzel},
  journal={IEEE Journal on Selected Areas in Information Theory},
  year={2020},
  volume={1},
  pages={401-415}
}
  • Janis Nötzel
  • Published 9 October 2019
  • Computer Science, Physics, Mathematics
  • IEEE Journal on Selected Areas in Information Theory
We introduce and analyse a multiple-access channel with two senders and one receiver, in the presence of i.i.d. noise coming from the environment. Partial side information about the environmental states allows the senders to modulate their signals accordingly. An adversarial jammer with its own access to information on environmental states and the modulation signals can jam a fraction of the transmissions. Our results show that for many choices of the system parameters, entanglement shared… Expand
Entanglement-Enabled Communication
  • Janis Nötzel
  • Computer Science
  • 2020 International Conference on Computer, Information and Telecommunication Systems (CITS)
  • 2020
TLDR
This work introduces and analyse a multiple-access channel with two senders and one receiver, in the presence of i.i.d. noise coming from the environment, and shows that for many choices of the system parameters, entanglement shared between the two sender allows them to communicate at non-zero rates with the receiver. Expand
Undoing Causal Effects of a Causal Broadcast Channel with Cooperating Receivers using Entanglement Resources
TLDR
It is found that when the receivers can share entanglement and communicate classically, they can receive messages from the sender at a non-zero rate with verifiable secure collaboration. Expand
Entanglement-Enabled Communication for the Internet of Things
  • Janis Nötzel, Stephen Diadamo
  • Computer Science
  • 2020 International Conference on Computer, Information and Telecommunication Systems (CITS)
  • 2020
TLDR
A beneficial impact of entanglement-modulated coding for multi-access scenarios where many senders attempt to reach one receiver is demonstrated, a scenario with an increased likelihood in the internet of things. Expand
Playing games with multiple access channels
TLDR
It is found that quantum entanglement shared between senders can substantially boost the capacity of a classical MAC, and it is shown that evaluating the capacity region of a two-sender classical MAC is in fact NP-hard. Expand
Entanglement-Assisted Data Transmission as an Enabling Technology: A Link-Layer Perspective
TLDR
This work detail how the addition of an entanglement storage system at the end-points of a communication link integrated seamlessly into the current Internet can benefit that link's capabilities via a protocol implementing the simple rule to "create entangler when idle", and use entanglements-assisted communication whenever possible. Expand
Entanglement-assisted capacity regions and protocol designs for quantum multiple-access channels
TLDR
The entanglement-assisted (EA) classical capacity region of quantum multiple-access channels (MACs) with an arbitrary number of senders is solved and the results can be directly extended to EA quantum communication at half of the rates. Expand
Integrating Quantum Simulation for Quantum-Enhanced Classical Network Emulation
TLDR
A novel augmented version of ComNetsEmu is thereby enabled to run arbitrary quantum protocols between any directly connected pair of network hosts, and implement the link layer method of generating and storing entanglement while idle, to accelerate data transmission at later times using superdense coding. Expand
Fundamental Background
Introduction
Quantum Broadcast Channels with Cooperating Decoders: An Information-Theoretic Perspective on Quantum Repeaters
TLDR
It is shown that as opposed to the multiple access channel with entangled encoders, entanglement between decoders does not increase the classical communication rates for the broadcast dual. Expand
...
1
2
...

References

SHOWING 1-10 OF 45 REFERENCES
Improving zero-error classical communication with entanglement
TLDR
It is shown that, given a single use of certain classical channels, entangled states of a system shared by the sender and receiver can be used to increase the number of (classical) messages which can be sent without error. Expand
Playing games with multiple access channels
TLDR
It is found that quantum entanglement shared between senders can substantially boost the capacity of a classical MAC, and it is shown that evaluating the capacity region of a two-sender classical MAC is in fact NP-hard. Expand
Quantum cryptography: Public key distribution and coin tossing
TLDR
A protocol for coin-tossing by exchange of quantum messages is presented, which is secure against traditional kinds of cheating, even by an opponent with unlimited computing power, but ironically can be subverted by use of a still subtler quantum phenomenon, the Einstein-Podolsky-Rosen paradox. Expand
Quantum And Relativistic Protocols For Secure Multi-Party Computation
TLDR
A new protocol for non-relativistic strong coin tossing is introduced, which matches the security of the best protocol known to date while using a conceptually different approach to achieve the task. Expand
Two-way Communication Channels
TLDR
This work wishes to determine what pairs of signalling rates R1 and R2 for the two directions can be approached with arbitrarily small error probabilities. Expand
The capacity of the arbitrarily varying channel revisited: Positivity, constraints
TLDR
The capacity of the AVC is determined with constraints on the transmitted codewords as well as on the channel state sequences, and it is demonstrated that it may be positive but less than the corresponding random code capacity. Expand
General properties of nonsignaling theories
This article identifies a series of properties common to all theories that do not allow for superluminal signaling and predict the violation of Bell inequalities. Intrinsic randomness, uncertaintyExpand
Information Theory - Coding Theorems for Discrete Memoryless Systems, Second Edition
TLDR
This new edition presents unique discussions of information theoretic secrecy and of zero-error information theory, including the deep connections of the latter with extremal combinatorics. Expand
Multiple Access Channels with Cooperating Encoders
TLDR
Coding theorems are proved for the Compound Multiple Access Channel and the Arbitrarily Varying Multiple access Channel, and achievable regions are derived for the Wiretap Multiple-Access Channel. Expand
Nonlocality and the Kochen-Specker paradox
A new proof of the impossibility of reconciling realism and locality in quantum mechanics is given. Unlike proofs based on Bell's inequality, the present work makes minimal and transparent use ofExpand
...
1
2
3
4
5
...