Entanglement-assisted capacity regions and protocol designs for quantum multiple-access channels

• URL: http://arxiv.org/abs/2101.12173v2
• Date: Sat, 3 Apr 2021 15:38:37 GMT
• Title: Entanglement-assisted capacity regions and protocol designs for quantum multiple-access channels
• Authors: Haowei Shi, Min-Hsiu Hsieh, Saikat Guha, Zheshen Zhang and Quntao Zhuang
• Abstract summary: entanglement-assisted (EA) classical capacity region of quantum multiple-access channels with an arbitrary number of senders. Four practical receiver designs, based on optical parametric amplifiers, are given and analyzed. Due to teleportation and superdense coding, our results for EA classical communication can be directly extended to EA quantum communication at half of the rates.
• Score: 11.889059726526781
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We solve the entanglement-assisted (EA) classical capacity region of quantum multiple-access channels with an arbitrary number of senders. As an example, we consider the bosonic thermal-loss multiple-access channel and solve the one-shot capacity region enabled by an entanglement source composed of sender-receiver pairwise two-mode squeezed vacuum states. The EA capacity region is strictly larger than the capacity region without entanglement-assistance. With two-mode squeezed vacuum states as the source and phase modulation as the encoding, we also design practical receiver protocols to realize the entanglement advantages. Four practical receiver designs, based on optical parametric amplifiers, are given and analyzed. In the parameter region of a large noise background, the receivers can enable a simultaneous rate advantage of 82.0% for each sender. Due to teleportation and superdense coding, our results for EA classical communication can be directly extended to EA quantum communication at half of the rates. Our work provides a unique and practical network communication scenario where entanglement can be beneficial.

Related papers

• Capacities of Entanglement Distribution From a Central Source [8.576752529284692]
  Distribution of entanglement is an essential task in quantum information processing and the realization of quantum networks. We investigate a scenario where a central source prepares an N-partite entangled state and transmits each entangled subsystem to one of N receivers through noisy quantum channels. The receivers are then able to perform local operations assisted by unlimited classical communication to distill target entangled states from the noisy channel output.
  arXiv  Detail & Related papers  (2024-11-07T18:50:51Z)
• Unextendible entanglement of quantum channels [4.079147243688764]
  We study the ability of quantum channels to perform quantum communication tasks. A quantum channel can distill a highly entangled state between two parties. We generalize the formalism of $k$-extendibility to bipartite superchannels.
  arXiv  Detail & Related papers  (2024-07-22T18:00:17Z)
• Covert Quantum Communication Over Optical Channels [2.094817774591302]
  We show a emphsquare root law (SRL) for quantum covert communication similar to that for classical. Our proof uses photonic dual-rail qubit encoding, which has been proposed for long-range repeater-based quantum communication. Our converse employs prior covert signal power limit results and adapts well-known methods to upper bound quantum capacity of optical channels.
  arXiv  Detail & Related papers  (2024-01-12T18:54:56Z)
• 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)
• Computable limits of optical multiple-access communications [1.14219428942199]
  Communication rates over quantum channels can be boosted by entanglement. Superadditivity refers to the capacity improvement from entangling inputs across multiple channel uses. We show that entanglement-assisted capacity of a single-sender and single-receiver channel is additive.
  arXiv  Detail & Related papers  (2021-10-04T19:27:59Z)
• 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)
• Entanglement-Assisted Communication Surpassing the Ultimate Classical Capacity [2.8453697351728438]
  Entanglement-assisted communication (EACOMM) leverages entanglement pre-shared by communication parties to boost the rate of classical information transmission. We show that EACOMM beats the Holevo-Schumacher-Westmoreland capacity of classical communication by up to 14.6%. Our work opens a route to provable quantum advantages in a wide range of quantum information processing tasks.
  arXiv  Detail & Related papers  (2021-01-19T06:41:09Z)
• 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)
• Permutation Enhances Classical Communication Assisted by Entangled States [67.12391801199688]
  We show that the capacity satisfies the strong converse property and thus the formula serves as a sharp dividing line between achievable and unachievable rates of communication. As examples, we derive analytically the classical capacity of various quantum channels of interests.
  arXiv  Detail & Related papers  (2020-01-07T01:49:31Z)

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.