Communication over Quantum Channels with Parameter Estimation

@article{Pereg2020CommunicationOQ,
  title={Communication over Quantum Channels with Parameter Estimation},
  author={Uzi Pereg},
  journal={2020 IEEE International Symposium on Information Theory (ISIT)},
  year={2020},
  pages={1818-1823}
}
  • Uzi Pereg
  • Published 1 January 2020
  • Computer Science, Mathematics, Physics
  • 2020 IEEE International Symposium on Information Theory (ISIT)
Communication over a random-parameter quantum channel when the decoder reconstructs the parameter sequence is considered in different scenarios. Regularized formulas are derived for the capacity-distortion regions with strictly-causal, causal, or non-causal channel side information (CSI) available at the encoder, and also without CSI. Single-letter characterizations are established in special cases. In particular, a single-letter formula is given for entanglement-breaking channels when CSI is… 

Figures from this paper

Bosonic Dirty Paper Coding
  • Uzi Pereg
  • Computer Science, Physics
    2021 IEEE International Symposium on Information Theory (ISIT)
  • 2021
TLDR
This work considers the bosonic channel with joint detection, for which the classical results do not apply, and derives a dirty-paper coding lower bound, and demonstrates that the optimal coefficient for dirty paper coding is not necessarily the MMSE estimator coefficient as in the classical setting.
Classical State Masking over a Quantum Channel
TLDR
A regularized formula is derived for the masking equivocation region, and a full characterization is established for a class of measurement channels.
Communication with Unreliable Entanglement Assistance
TLDR
The present work introduces a new model of unreliable entanglement assistance, whereby the communication system operates whether entangler assistance is present or not, and regularized formulas are derived for the classical and quantum capacity regions with unreliable entangling assistance.
Key Assistance, Key Agreement, and Layered Secrecy for Bosonic Broadcast Channels
TLDR
A network with layered secrecy, where three users with different security ranks communicate over the same broadcast network is considered, and an achievable layered-secrecy region is derived for a pure-loss bosonic channel that is formed by the concatenation of two beam splitters.
Quantum Channel State Masking
TLDR
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 Channel State Masking
TLDR
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.
The Quantum Multiple-Access Channel with Cribbing Encoders
TLDR
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.
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.

References

SHOWING 1-10 OF 115 REFERENCES
Communication Over Quantum Channels With Parameter Estimation
  • Uzi Pereg
  • Computer Science
    IEEE Transactions on Information Theory
  • 2022
TLDR
Bosonic dirty paper coding is introduced as a consequence, where it is demonstrated that the optimal coefficient is not necessarily that of minimum mean-square error estimation as in the classical setting.
-convexity
Given a homeomorphism one can define on the topological space X a set operator through the formula . Such a convexity on X has all the topological, geometric and algebraic properties of the usual
Additivity of the classical capacity of entanglement-breaking quantum channels
We show that for the tensor product of an entanglement-breaking quantum channel with an arbitrary quantum channel, both the minimum entropy of an output of the channel and the
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.
Channels with Side Information at the Transmitter
TLDR
In this paper a type of channel with side information is studied and its capacity determined.
Capacities of Gaussian Quantum Channels With Passive Environment Assistance
TLDR
An uncertainty-type relation between the classical capacities of the sender and the helper is derived, showing a lower bound on the sum of the two capacities, which is used to lower bound the classical information transmission rate in the scenario of classical communication between sender and helper.
On Polar Coding for Side Information Channels
TLDR
A successive cancellation list (SCL) encoding and decoding scheme for the Gelfand Pinsker (GP) problem based on the known nested polar coding scheme shows improved performance and an improved bound on the size of this set is provided.
Quantum Channel State Masking
TLDR
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.
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.
Distributed Compression of Correlated Classical-Quantum Sources or: The Price of Ignorance
TLDR
The investigation of the problem of independent local compression of correlated quantum sources, the classical case of which is covered by the celebrated Slepian-Wolf theorem, is resumed, and an achievable rate region is given via protocols that are built on the decoupling principle, and the protocols of quantum state merging and quantum state redistribution.
...
1
2
3
4
5
...