Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
97 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
44 tokens/sec
o3 Pro
5 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

One-shot Capacity bounds on the Simultaneous Transmission of Classical and Quantum Information (1809.07104v2)

Published 19 Sep 2018 in cs.IT, math.IT, and quant-ph

Abstract: We study the communication capabilities of a quantum channel under the most general channel model known as the one-shot model. Unlike classical channels that can only be used to transmit classical information (bits), a quantum channel can be used for transmission of classical information, quantum information (qubits) and simultaneous transmission of classical and quantum information. In this work, we investigate the one-shot capabilities of a quantum channel for simultaneously transmitting of bits and qubits. This problem was studied in the asymptotic regime for a memoryless channel and a regularized characterization of the capacity region was reported. It is known that the transmission of private classical information is closely related to the problem of quantum information transmission. We resort to this idea and find achievable and converse bounds on the simultaneous transmission of the public and private classical information. then by shifting the classical private rate to the quantum information rate, the obtained rate regions will be translated into rate regions of thThis in turn, leads to a rate region for simulttaneous transmission of classical and quantum information. In the case of asymptotic i.i.d. setting, our one-shot result is evaluated to the known results in the literature. Our main tools used in the achievability proofs are position-based decoding and convex-split lemma.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (5)
  1. Farzin Salek (8 papers)
  2. Anurag Anshu (58 papers)
  3. Min-Hsiu Hsieh (148 papers)
  4. Rahul Jain (152 papers)
  5. Javier R. Fonollosa (9 papers)
Citations (13)

Summary

We haven't generated a summary for this paper yet.