One-shot capacity bounds on the simultaneous transmission of public and private information over quantum channels
| Autor: | Javier R. Fonollosa, Anurag Anshu, Min-Hsiu Hsieh, Rahul Jain, Farzin Salek |
|---|---|
| Přispěvatelé: | Universitat Politècnica de Catalunya. Departament de Teoria del Senyal i Comunicacions, Universitat Politècnica de Catalunya. SPCOM - Grup de Recerca de Processament del Senyal i Comunicacions |
| Jazyk: | angličtina |
| Rok vydání: | 2018 |
| Předmět: |
Lemma (mathematics)
Mathematical optimization Information theory Computer science 020206 networking & telecommunications 02 engineering and technology Quantum channel On shot quantum communication Enginyeria de la telecomunicació [Àrees temàtiques de la UPC] 01 natural sciences Transmission (telecommunications) Informàtica [Àrees temàtiques de la UPC] Informació Teoria de la 0103 physical sciences Converse 0202 electrical engineering electronic engineering information engineering Quantum information 010306 general physics Quantum Private information retrieval Decoding methods Computer Science::Information Theory Communication channel Quantum information theory |
| Zdroj: | UPCommons. Portal del coneixement obert de la UPC Universitat Politècnica de Catalunya (UPC) ISIT Recercat. Dipósit de la Recerca de Catalunya instname |
| DOI: | 10.1109/ISIT.2018.8437856 |
| Popis: | ©2018 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. We aim to study the optimal rates of transmission of public and private classical information over a quantum channel in the most general channel model. To this end, we discuss a scenario in which a quantum channel is being used only once, i.e., one-shot regime is considered. A quantum channel can be used to send classical information (bits) either publicly or privately and for either case, one-shot bounds have been reported in the literature. This paper investigates the one-shot capacity capabilities of a quantum channel for simultaneous transmission of public and private information. We derive an achievable rate region in the form of a tradeoff between public and private rates. We also provide converse bounds assessing the tightness of our achievable rates. Our main tools used in the achievability proofs are position-based decoding and convex-split lemma. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|