Quantum Broadcast Channels with Cooperating Decoders: An Information-Theoretic Perspective on Quantum Repeaters

@article{Pereg2021QuantumBC,
  title={Quantum Broadcast Channels with Cooperating Decoders: An Information-Theoretic Perspective on Quantum Repeaters},
  author={Uzi Pereg and Christian Deppe and Holger Boche},
  journal={2021 IEEE International Symposium on Information Theory (ISIT)},
  year={2021},
  pages={772-777}
}
  • Uzi Pereg, C. Deppe, H. Boche
  • Published 18 November 2020
  • Computer Science
  • 2021 IEEE International Symposium on Information Theory (ISIT)
Communication over a quantum broadcast channel with cooperation between the receivers is considered. The first form of cooperation addressed is classical conferencing. Another cooperation setting involves quantum conferencing, where Receiver 1 can teleport a quantum state to Receiver 2. The conferencing setting is intimately related to quantum repeaters, as the sender, Receiver 1, and Receiver 2 can be viewed as the transmitter, the repeater, and the destination receiver, respectively. We… 

Figures from this paper

The Quantum MAC with Cribbing Encoders

A regularized capacity characterization is established for robust cribbing, i.e. when the cribbing system contains all the information of the channel input, and a partial decode-forward region for non-robust cribbing.

Problem solving dynamics for gate-model quantum computers

This work studies the model of adaptive problem solving dynamics in gate-model quantum computers, which can be realized in near-term experimental implementations of quantum computers.

Resource optimization for the quantum Internet

Methods and procedures of resource prioritization and resource balancing for the quantum Internet are defined to optimize the resource allocation mechanisms and to reduce the resource consumptions of the network entities.

Identification Over Quantum Broadcast Channels

An achievable identification region is derived for a quantum broadcast channel, and a full characterization for the class of classical-quantum broadcast channels, and the identification capacity region of the single-mode pure-loss bosonic broadcast channel is obtained.

Communication with Unreliable Entanglement Assistance

The present work introduces a new model of unreliable entanglement assistance, whereby the communication system operates whether entangler assistance is present or not, characterizing the tradeoff between the unassisted rate and the excess rate that can be obtained from entanglements assistance.

The Quantum Multiple-Access Channel With Cribbing Encoders

A MAC model with noisy cribbing is introduced, whereby Transmitter 2 performs a measurement on a system that is entangled with Transmitter 1, and a regularized capacity characterization is established for robust cribbing, i.e. when the cribbing system contains all the information of the channel input.

Approximation Method for Optimization Problems in Gate-Model Quantum Computers

  • L. Gyongyosi
  • Computer Science, Physics
    Chaos, Solitons & Fractals: X
  • 2021

Integrating Quantum Simulation for Quantum-Enhanced Classical Network Emulation

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.

Probing multipartite entanglement, coherence and quantum information preservation under classical Ornstein–Uhlenbeck noise

We address entanglement, coherence, and information protection in a system of four non-interacting qubits coupled with different classical environments, namely: common, bipartite, tripartite, and

References

SHOWING 1-10 OF 123 REFERENCES

Entanglement-Enabled Communication

  • Janis Nötzel
  • Computer Science
    2020 International Conference on Computer, Information and Telecommunication Systems (CITS)
  • 2020
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.

Capacity-reaching quantum repeaters for quantum communications

This work put forward a design for continuous-variable quantum repeaters and shows that it can actually achieve the feat, that is, the design is capacity-reaching, and it is shown that even in a noisy regime the authors' rates surpass the PirandolaLaurenzaOttavianiBanchi (PLOB) bound.

Identification Capacity of Channels With Feedback: Discontinuity Behavior, Super-Activation, and Turing Computability

It is shown that the deterministic and randomized IDF capacities are not Banach-Mazur computable, implying that the IDF capacity is not computable even for universal Turing machines, while the identification capacity without feedback is Turing computable revealing the impact of the feedback.

Quantum Channel State Masking

A full characterization is established for the entanglement-assisted masking equivocation region with a maximally correlated channel state, and a regularized formula is given for the quantum capacity-leakage function without assistance.

Quantum Advantages of Communication Complexity from Bell Nonlocality

This work presents a method to construct CC problems from Bell tests in a graph-theoretic way, and the success probability of the non-signaling protocol based on the Popescu–Rohrlich box reaches one.

Classical-Quantum Multiple Access Wiretap Channel

  • Hadi AghaeeBahareh Akhbari
  • Computer Science
    2019 16th International ISC (Iranian Society of Cryptology) Conference on Information Security and Cryptology (ISCISC)
  • 2019
The quantum wiretap channel and quantum multiple access channel are used so as to introduce the classical-quantum multiple access wiretapChannel (C-QMA-WTC) and it is illustrated how mutual information can be used instead of the Holevo information in the expression of the secrecy capacity region.

MIP* = RE

It is proved that every problem that is recursively enumerable, including the Halting problem, can be efficiently verified by a classical probabilistic polynomial-time verifier interacting with two all-powerful but noncommunicating provers sharing entanglement.

Communication over Quantum Channels with Parameter Estimation

  • Uzi Pereg
  • Computer Science
    2020 IEEE International Symposium on Information Theory (ISIT)
  • 2020
Regularized formulas are derived for the capacity of random-parameter quantum channels with CSI, generalizing previous results on classical-quantum channels.

Extending Quantum Links: Modules for Fiber‐ and Memory‐Based Quantum Repeaters

This work considers two different protocols for quantum repeater links, one of which is better adapted to the higher source clock rate and lower memory coherence time of the quantum dot platform, while the other circumvents the need of writing photonic quantum states into the memories in a heralded, non-destructive fashion.

Universal superposition codes: capacity regions of compound quantum broadcast channel with confidential messages

This work derives universal codes for transmission of broadcast and confidential messages over classical- quantum-quantum and fully quantum channels and gives a multi-letter characterization of regions corresponding to capacity of the compound quantum broadcast channel for transmitting broadcast andidential messages simultaneously.
...