Quantum Relay Channels

• URL: http://arxiv.org/abs/2411.16263v1
• Date: Mon, 25 Nov 2024 10:27:28 GMT
• Title: Quantum Relay Channels
• Authors: Uzi Pereg,
• Abstract summary: Communication over a fully quantum relay channel is considered. We establish three bounds based on different coding strategies, i.e., partial decode-forward, measure-forward, and assist-forward.
• Score: 18.93141709546733
• License:
• Abstract: Communication over a fully quantum relay channel is considered. We establish three bounds based on different coding strategies, i.e., partial decode-forward, measure-forward, and assist-forward. Using the partial-decode forward strategy, the relay decodes part of the information, while the other part is decoded without the relay's help. The result by Savov et al. (2012) for a classical-quantum relay channel is obtained as a special case. Based on our partial-decode forward bound, the capacity is determined for Hadamard relay channels. In the measure-forward coding scheme, the relay performs a sequence of measurements and then sends a compressed representation of the measurement outcome to the destination receiver. The measure-forward strategy can be viewed as a generalization of the classical compress-forward bound. At last, we consider quantum relay channels with orthogonal receiver components. The assist-forward bound is based on a new approach, whereby the transmitter sends the message to the relay and simultaneously generates entanglement assistance between the relay and the destination receiver. Subsequently, the relay can transmit the message to the destination receiver with rate-limited entanglement assistance.

Related papers

• Performance of Rotation-Symmetric Bosonic Codes in a Quantum Repeater Network [0.0]
  Quantum error correction codes based on continuous variables play an important role for the implementation of quantum communication systems. A natural application of such codes occurs within quantum repeater systems which are used to combat severe channel losses and local gate errors. Here we consider a cavity-QED based repeater scheme to address the losses in the quantum channel.
  arXiv  Detail & Related papers  (2023-08-30T07:39:11Z)
• Fault-tolerant Coding for Entanglement-Assisted Communication [46.0607942851373]
  This paper studies the study of fault-tolerant channel coding for quantum channels. We use techniques from fault-tolerant quantum computing to establish coding theorems for sending classical and quantum information in this scenario. We extend these methods to the case of entanglement-assisted communication, in particular proving that the fault-tolerant capacity approaches the usual capacity when the gate error approaches zero.
  arXiv  Detail & Related papers  (2022-10-06T14:09:16Z)
• Quantum Multiple-Access One-Time Pad [9.137554315375919]
  We introduce and analyze an information theoretical task that we call the quantum multiple-access one-time pad. A number of senders initially share a correlated quantum state with a receiver and an eavesdropper. We derive a single-letter characterization for the achievable rate region in a limit of infinitely many copies and vanishingly small error.
  arXiv  Detail & Related papers  (2022-08-25T11:43:24Z)
• Dense Coding with Locality Restriction for Decoder: Quantum Encoders vs. Super-Quantum Encoders [67.12391801199688]
  We investigate dense coding by imposing various locality restrictions to our decoder. In this task, the sender Alice and the receiver Bob share an entangled state.
  arXiv  Detail & Related papers  (2021-09-26T07:29:54Z)
• Computation-aided classical-quantum multiple access to boost network communication speeds [61.12008553173672]
  We quantify achievable quantum communication rates of codes with computation property for a two-sender cq-MAC. We show that it achieves the maximum possible communication rate (the single-user capacity), which cannot be achieved with conventional design.
  arXiv  Detail & Related papers  (2021-05-30T11:19:47Z)
• Mutually Unbiased Balanced Functions & Generalized Random Access Codes [0.0]
  Random Access Codes (RACs) are cryptographically significant family of bipartite communication tasks. We introduce a generalization of this task wherein the receiver aims to retrieve randomly chosen functions of sender's input string. We investigate and bound the performance of classical, (ii.) quantum prepare and measure, and (iii.) entanglement assisted classical communication (EACC) protocols for the resultant generalized RACs (GRACs)
  arXiv  Detail & Related papers  (2021-05-09T13:17:24Z)
• Model-Driven Deep Learning Based Channel Estimation and Feedback for Millimeter-Wave Massive Hybrid MIMO Systems [61.78590389147475]
  This paper proposes a model-driven deep learning (MDDL)-based channel estimation and feedback scheme for millimeter-wave (mmWave) systems. To reduce the uplink pilot overhead for estimating the high-dimensional channels from a limited number of radio frequency (RF) chains, we propose to jointly train the phase shift network and the channel estimator as an auto-encoder. Numerical results show that the proposed MDDL-based channel estimation and feedback scheme outperforms the state-of-the-art approaches.
  arXiv  Detail & Related papers  (2021-04-22T13:34:53Z)
• Quantum Broadcast Channels with Cooperating Decoders: An Information-Theoretic Perspective on Quantum Repeaters [78.7611537027573]
  Communication over a quantum broadcast channel with cooperation between the receivers is considered. We develop lower and upper bounds on the capacity region in each setting.
  arXiv  Detail & Related papers  (2020-11-18T11:58:48Z)
• Representation matching for delegated quantum computing [64.67104066707309]
  representation matching is a generic probabilistic protocol for reducing the cost of quantum computation in a quantum network. We show that the representation matching protocol is capable of reducing the communication or memory cost to almost minimum in various tasks.
  arXiv  Detail & Related papers  (2020-09-14T18:07:43Z)

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.