Quantum Multiple-Access One-Time Pad

• URL: http://arxiv.org/abs/2208.12016v1
• Date: Thu, 25 Aug 2022 11:43:24 GMT
• Title: Quantum Multiple-Access One-Time Pad
• Authors: Eyuri Wakakuwa
• Abstract summary: 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.
• Score: 9.137554315375919
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We introduce and analyze an information theoretical task that we call the quantum multiple-access one-time pad. Here, a number of senders initially share a correlated quantum state with a receiver and an eavesdropper. Each sender performs a local operation to encode a classical message and sends their system to the receiver, who subsequently performs a measurement to decode the messages. The receiver will be able to decode the messages almost perfectly, while the eavesdropper must not be able to extract information about the messages even if they have access to the quantum systems transmitted. We consider a ''conditional'' scenario in which a portion of the receiver's side information is also accessible to the eavesdropper. We investigate the maximum amount of classical information that can be encoded by each of the senders. We derive a single-letter characterization for the achievable rate region in an asymptotic limit of infinitely many copies and vanishingly small error.

Related papers

• Three-Receiver Quantum Broadcast Channels: Classical Communication with Quantum Non-unique Decoding [44.37825061268399]
  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.
  arXiv  Detail & Related papers  (2024-06-14T09:07:53Z)
• Many facets of multiparty broadcasting of known quantum information using optimal quantum resource [3.274290296343038]
  We show that it's possible to broadcast known quantum information to multiple receivers in deterministic as well as probabilistic manner. A proof of principle realization of the proposed optimal scheme using IBM quantum computer is also reported.
  arXiv  Detail & Related papers  (2023-04-30T05:23:03Z)
• Prior Entanglement Exponentially Improves One-Server Quantum Private Information Retrieval for Quantum Messages [60.889483085250355]
  We find an exponential gap in the communication complexities between the presence and absence of prior entanglement. We propose an efficient one-server one-round QPIR protocol with prior entanglement.
  arXiv  Detail & Related papers  (2023-04-11T10:34:53Z)
• 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)
• Information Carried by a Single Particle in Quantum Multiple-Access Channels [13.821363169821046]
  Non-classical features of quantum systems have the potential to strengthen the way we currently exchange information. We compare how well multi-party information can be transmitted to a single receiver using just one classical or quantum particle.
  arXiv  Detail & Related papers  (2023-01-06T14:01:56Z)
• 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)
• 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)
• 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)
• 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.