Three-Receiver Quantum Broadcast Channels: Classical Communication with Quantum Non-unique Decoding

• URL: http://arxiv.org/abs/2406.09854v1
• Date: Fri, 14 Jun 2024 09:07:53 GMT
• Title: Three-Receiver Quantum Broadcast Channels: Classical Communication with Quantum Non-unique Decoding
• Authors: Farzin Salek, Patrick Hayden, Masahito Hayashi,
• Abstract summary: In network communication, there is a hierarchy among receivers based on information they decode due. This hierarchy may result in varied information quality, such as higher-quality video for certain receivers. We explore three-receiver quantum broadcast channels with two- and three-degraded message sets.
• Score: 44.37825061268399
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In network communication, it is common in broadcasting scenarios for there to exist a hierarchy among receivers based on information they decode due, for example, to different physical conditions or premium subscriptions. This hierarchy may result in varied information quality, such as higher-quality video for certain receivers. This is modeled mathematically as a degraded message set, indicating a hierarchy between messages to be decoded by different receivers, where the default quality corresponds to a common message intended for all receivers, a higher quality is represented by a message for a smaller subset of receivers, and so forth. We extend these considerations to quantum communication, exploring three-receiver quantum broadcast channels with two- and three-degraded message sets. Our technical tool involves employing quantum non-unique decoding, a technique we develop by utilizing the simultaneous pinching method. We construct one-shot codes for various scenarios and find achievable rate regions relying on various quantum R\'enyi mutual information error exponents. Our investigation includes a comprehensive study of pinching across tensor product spaces, presenting our findings as the asymptotic counterpart to our one-shot codes. By employing the non-unique decoding, we also establish a simpler proof to Marton's inner bound for two-receiver quantum broadcast channels without the need for more involved techniques. Additionally, we derive no-go results and demonstrate their tightness in special cases.

Related papers

• Assessing a binary quantum channel exploiting a Silicon photomultiplier based hybrid receiver [0.0]
  We consider a quantum channel exploiting a Silicon-photomultiplier-based receiver. We investigate two scenarios: information transmission over the channel, quantified by the mutual information, and continuous-variable quantum key distribution.
  arXiv  Detail & Related papers  (2024-07-10T09:52:04Z)
• Enhancing Quantum State Discrimination with Indefinite Causal Order [3.368751927358015]
  We study a noisy discrimination scenario using a protocol based on indefinite causal order. We find that, for certain channels and ensembles, the guessing probability can be significantly improved.
  arXiv  Detail & Related papers  (2024-06-27T17:51:46Z)
• Triple-View Knowledge Distillation for Semi-Supervised Semantic Segmentation [54.23510028456082]
  We propose a Triple-view Knowledge Distillation framework, termed TriKD, for semi-supervised semantic segmentation. The framework includes the triple-view encoder and the dual-frequency decoder.
  arXiv  Detail & Related papers  (2023-09-22T01:02:21Z)
• Broadcasting single-qubit and multi-qubit-entangled states: authentication, cryptography, and distributed quantum computation [0.0]
  We first focus on the broadcasting of product quantum states in a network. We generalize the basic protocol to include an arbitrary basis rotation and allow for multiple receivers and senders. Applications of broadcasting product states include authentication and three-state quantum cryptography.
  arXiv  Detail & Related papers  (2023-03-01T23:00:50Z)
• 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)
• Statistical intrusion detection and eavesdropping in quantum channels with coupling: Multiple-preparation and single-preparation methods [2.2469167925905777]
  Non-quantum communications include configurations with multiple-input multiple-output (MIMO) channels. Some associated signal processing tasks consider these channels in a symmetric way, i.e. by assigning the same role to all inputs. We here address asymmetric (blind and non-blind) ones, with emphasis on intrusion detection and additional comments about eavesdropping.
  arXiv  Detail & Related papers  (2021-06-17T07:04: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)
• 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)
• Single-Shot Secure Quantum Network Coding for General Multiple Unicast Network with Free One-Way Public Communication [56.678354403278206]
  We propose a canonical method to derive a secure quantum network code over a multiple unicast quantum network. Our code correctly transmits quantum states when there is no attack. It also guarantees the secrecy of the transmitted quantum state even with the existence of an attack.
  arXiv  Detail & Related papers  (2020-03-30T09:25:13Z)

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.