Communication over Quantum Channels with Parameter Estimation

• URL: http://arxiv.org/abs/2001.00836v7
• Date: Sat, 25 Sep 2021 12:58:26 GMT
• Title: Communication over Quantum Channels with Parameter Estimation
• Authors: Uzi Pereg
• Abstract summary: We study scenarios that include either strictly-causal, causal, or non-causal channel side information (CSI) available at the encoder, and also when CSI is not available. Regularized formulas for the capacity-distortion regions are derived.
• Score: 12.437226707039448
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Communication over a random-parameter quantum channel when the decoder is required to reconstruct the parameter sequence is considered. We study scenarios that include either strictly-causal, causal, or non-causal channel side information (CSI) available at the encoder, and also when CSI is not available. This model can be viewed as a form of quantum metrology, and as the quantum counterpart of the classical rate-and-state channel with state estimation at the decoder. Regularized formulas for the capacity-distortion regions are derived. In the special case of measurement channels, single-letter characterizations are derived for the strictly causal and causal settings. Furthermore, in the more general case of entanglement-breaking channels, a single-letter characterization is derived when CSI is not available. As a consequence, we obtain regularized formulas for the capacity of random-parameter quantum channels with CSI, generalizing previous results by Boche et al. (2016) on classical-quantum channels.

Related papers

• Fully quantum arbitrarily varying channel coding for entanglement-assisted communication [0.0]
  We study the problem of entanglement-assisted capacity in the presence of system uncertainty. We find that, under the assumption of a finite environment dimension, it is equal to a corresponding compound capacity. Our results imply that in certain fully quantum arbitrarily varying channel models, the entanglement-assisted capacity can be positive while the classical capacity is equal to zero.
  arXiv  Detail & Related papers  (2024-04-12T02:10:04Z)
• Commitment capacity of classical-quantum channels [70.51146080031752]
  We define various notions of commitment capacity for classical-quantum channels. We prove matching upper and lower bound on it in terms of the conditional entropy.
  arXiv  Detail & Related papers  (2022-01-17T10:41:50Z)
• Classical State Masking over a Quantum Channel [78.7611537027573]
  Transmission of classical information over a quantum state-dependent channel is considered, when the encoder can measure channel side information (CSI) and is required to mask information on the quantum channel state from the decoder. Regularized formula is derived for the masking equivocation region, and a full characterization is established for a class of measurement channels.
  arXiv  Detail & Related papers  (2021-09-26T16:29:27Z)
• Coherent control and distinguishability of quantum channels via PBS-diagrams [59.94347858883343]
  We introduce a graphical language for coherent control of general quantum channels inspired by practical quantum optical setups involving polarising beam splitters (PBS) We characterise the observational equivalence of purified channels in various coherent-control contexts, paving the way towards a faithful representation of quantum channels under coherent control.
  arXiv  Detail & Related papers  (2021-03-02T22:56:25Z)
• Certifying the Classical Simulation Cost of a Quantum Channel [4.974890682815778]
  A fundamental objective in quantum information science is to determine the cost in classical resources simulating a particular quantum system. This paper provides a collection of device-independent tests that place lower and upper bounds on the signaling dimension of a channel.
  arXiv  Detail & Related papers  (2021-02-24T20:22:43Z)
• 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)
• Non-additivity in classical-quantum wiretap channels [12.354076490479514]
  We study hybrid classical-quantum wiretap channels in order to witness non-additivity phenomena in quantum Shannon theory. For wiretap channels with quantum inputs but classical outputs, we prove that the characterization of the capacity in terms of the private information stays single-letter.
  arXiv  Detail & Related papers  (2020-02-16T13:38:40Z)
• DeepSIC: Deep Soft Interference Cancellation for Multiuser MIMO Detection [98.43451011898212]
  In multiuser multiple-input multiple-output (MIMO) setups, where multiple symbols are simultaneously transmitted, accurate symbol detection is challenging. We propose a data-driven implementation of the iterative soft interference cancellation (SIC) algorithm which we refer to as DeepSIC. DeepSIC learns to carry out joint detection from a limited set of training samples without requiring the channel to be linear.
  arXiv  Detail & Related papers  (2020-02-08T18:31:00Z)

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.