Partial decode-forward for quantum relay channels

@article{Savov2012PartialDF,
  title={Partial decode-forward for quantum relay channels},
  author={Ivan Savov and Mark M. Wilde and Mai H. Vu},
  journal={2012 IEEE International Symposium on Information Theory Proceedings},
  year={2012},
  pages={731-735}
}
  • Ivan Savov, M. Wilde, M. Vu
  • Published 29 December 2011
  • Mathematics, Computer Science, Physics
  • 2012 IEEE International Symposium on Information Theory Proceedings
A relay channel is one in which a Source and Destination use an intermediate Relay station in order to improve communication rates. We propose the study of relay channels with classical inputs and quantum outputs and prove that a “partial decode and forward” strategy is achievable. We divide the channel uses into many blocks and build codes in a randomized, block-Markov manner within each block. The Relay performs a standard Holevo-Schumacher-Westmoreland quantum measurement on each block in… Expand
The broadcast classical–quantum capacity region of a two-phase bidirectional relaying channel
We studied a three-node quantum network that enables bidirectional communication between two nodes with a half-duplex relay node for transmitting classical messages. A decode-and-forward protocol isExpand
Joint source-channel coding for a quantum multiple access channel
TLDR
It is proved that a coding strategy similar to the Cover–El Gamal–Salehi strategy and a corresponding quantum simultaneous decoder allow for the reliable transmission of a source over a quantum multiple access channel, as long as a set of information inequalities involving the Holevo quantity hold. Expand
Network information theory for classical-quantum channels
TLDR
The purpose of this thesis is to extend the main ideas of classical network information theory to the study of classical-quantum channels, and proves coding theorems for quantum multiple access channels, quantum interference channels,quantum broadcast channels and quantum relay channels. Expand
A Quantum Multiparty Packing Lemma and the Relay Channel
TLDR
This article uses Sen's recent quantum joint typicality results to prove a one-shot multiparty quantum packing lemma generalizing the HSW theorem, and uses it to straightforwardly obtain quantum generalizations of well-known classical coding schemes for the relay channel. Expand
Quantum Subdivision Capacities and Continuous-Time Quantum Coding
Quantum memories can be regarded as quantum channels that transmit information through time without moving it through space. Aiming at a reliable storage of information, we may thus not only encodeExpand
Retrieving the Correct Information: Channel Coding Reliability in Error Detection and Correction
  • T. Adam, U. Hashim, U. S. Sani
  • Computer Science
  • 2012 Fourth International Conference on Computational Intelligence, Modelling and Simulation
  • 2012
TLDR
A study on a very simple and adaptable decoder modeling algorithms which was generated using Matlab software and tested on three channel-coding techniques namely; Hamming code, convolution code, and uncoded technique for their reliability in error detection over another. Expand
Communication over Quantum Channels with Parameter Estimation
  • Uzi Pereg
  • Computer Science, Mathematics
  • 2020 IEEE International Symposium on Information Theory (ISIT)
  • 2020
TLDR
Regularized formulas are derived for the capacity of random-parameter quantum channels with CSI, generalizing previous results on classical-quantum channels. Expand
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

References

SHOWING 1-10 OF 16 REFERENCES
Classical Communication Over a Quantum Interference Channel
TLDR
A proof that a Han-Kobayashi strategy is achievable with Holevo information rates, up to a conjecture regarding the existence of a three-sender quantum simultaneous decoder, and some other variations of the conjecture that hold. Expand
Classical Codes for Quantum Broadcast Channels
  • Ivan Savov, M. Wilde
  • Computer Science, Mathematics
  • IEEE Transactions on Information Theory
  • 2012
TLDR
The first technique is a quantum generalization of the superposition coding scheme for the classical broadcast channel and the error analysis for the quantum Marton region makes use of ideas in earlier work and an idea recently presented by Radhakrishnan et al. Expand
Achieving the Han-Kobayashi inner bound for the quantum interference channel
  • P. Sen
  • Mathematics, Computer Science
  • 2012 IEEE International Symposium on Information Theory Proceedings
  • 2012
TLDR
An encoding and decoding scheme achieving the Chong-Motani-Garg inner bound for a two sender two receiver interference channel with classical input and quantum output and proves its inner bounds using a non-commutative union bound to analyse the decoding error probability, and a geometric notion of approximate interesection of two conditionally typical subspaces. Expand
The capacity of the quantum multiple-access channel
  • A. Winter
  • Mathematics, Computer Science
  • IEEE Trans. Inf. Theory
  • 2001
TLDR
A second issue of this work is the presentation of a calculus of quantum information quantities, based on the algebraic formulation of quantum theory, which is applied to the case of noisy channels, with arbitrary input signal states. Expand
General formulas for capacity of classical-quantum channels
TLDR
A capacity formula as well as a characterization of the strong converse property is given just in parallel with the corresponding classical results of Verdu-Han (1994) which are based on the so-called information-spectrum method. Expand
Quantum relays for long distance quantum cryptography
Quantum cryptography is on the verge of commercial application. One of its greatest limitations is over long distance—secret key rates are low and the longest fibre over which any key has beenExpand
Multiple-access channels with different generalized feedback signals
TLDR
It is shown that a rate region, previously obtained for the multiple-access channel with "perfect" feedback to both senders, remains achievable when the feedback connection to one of the senders is eliminated. Expand
Coding theorem and strong converse for quantum channels
  • A. Winter
  • Mathematics, Computer Science
  • IEEE Trans. Inf. Theory
  • 1999
TLDR
A new proof of Holevo's (1973, 1977) coding theorem for transmitting classical information through quantum channels, and its strong converse is presented, largely inspired by Wolfwitz's combinatorial approach using types of sequences. Expand
From Classical to Quantum Shannon Theory
  • M. Wilde
  • Computer Science, Physics
  • ArXiv
  • 2011
TLDR
Part V and VI are the culmination of this book, where all of the tools developed come into play for understanding many of the important results in quantum Shannon theory. Expand
An achievable rate for the multiple-level relay channel
TLDR
For the multiple-level relay channel, an achievable rate formula, and a simple coding scheme to achieve it, are presented and this achievable rate is shown to be the exact capacity. Expand
...
1
2
...