Filters








13 Hits in 7.6 sec

Superadditivity of Quantum Channel Coding Rate With Finite Blocklength Joint Measurements

Hye Won Chung, Saikat Guha, Lizhong Zheng
2016 IEEE Transactions on Information Theory  
This phenomenon is known as superadditivity of the maximum achievable information rate over a quantum channel.  ...  The maximum rate at which classical information can be reliably transmitted per use of a quantum channel strictly increases in general with N, the number of channel outputs that are detected jointly by  ...  Superadditivity of Quantum Channel Coding Rate with Finite Blocklength Joint Measurements Hye Won Chung, Saikat Guha and Lizhong Zheng Abstract-The maximum rate at which classical information can be reliably  ... 
doi:10.1109/tit.2016.2597285 fatcat:ydrqf5sjfncjtj7sma2abdaagu

Superadditivity of quantum channel coding rate with finite blocklength quantum measurements

Hye Won Chung, Saikat Guha, Lizhong Zheng
2014 2014 IEEE International Symposium on Information Theory  
This phenomenon is called superadditivity. We provide an explanation of this phenomenon by comparing a quantum channel with a classical discrete memoryless channel (DMC) under concatenated codes.  ...  We investigate superadditivity in the maximum achievable rate of reliable classical communication over a quantum channel.  ...  LOWER BOUND ON C N In this section, a lower bound is derived for the maximum achievable information rate at a finite blocklength N of quantum measurements.  ... 
doi:10.1109/isit.2014.6874963 dblp:conf/isit/ChungGZ14 fatcat:dqkrmfvgejaoha2ntxslnrlmiu

Superadditivity of quantum channel coding rate with finite blocklength quantum measurements

Hye Won Chung, Lizhong Zheng
2013 2013 51st Annual Allerton Conference on Communication, Control, and Computing (Allerton)  
This phenomenon is called superadditivity. We provide an explanation of this phenomenon by comparing a quantum channel with a classical discrete memoryless channel (DMC) under concatenated codes.  ...  We investigate superadditivity in the maximum achievable rate of reliable classical communication over a quantum channel.  ...  LOWER BOUND ON C N In this section, a lower bound is derived for the maximum achievable information rate at a finite blocklength N of quantum measurements.  ... 
doi:10.1109/allerton.2013.6736608 dblp:conf/allerton/ChungZ13 fatcat:wuuml2kq6rdorldw42y35kbvxq

One-Shot Lossy Quantum Data Compression

Nilanjana Datta, Joseph M. Renes, Renato Renner, Mark M. Wilde
2013 IEEE Transactions on Information Theory  
We provide a framework for one-shot quantum rate distortion coding, in which the goal is to determine the minimum number of qubits required to compress quantum information as a function of the probability  ...  We obtain a one-shot characterization of the minimum qubit compression size for an entanglement-assisted quantum rate-distortion code in terms of the smooth max-information, a quantity previously employed  ...  JMR and RR were supported by the Swiss National Science Foundation (through the National Centre of Competence in Research "Quantum Science and Technology" and grant No. 200020-135048) and by the European  ... 
doi:10.1109/tit.2013.2283723 fatcat:piuldrsidnfb7kliyd7fa7xyaa

On environment-assisted capacities of quantum channels

Andreas Winter
2005 arXiv   pre-print
Then we develop a few techniques to prove the existence of channels which meet this lower bound up to terms of much smaller order, even when PPT decoding measurements are allowed (assuming a certain superadditivity  ...  Optics 50, 913-933, 2003 and quant-ph/0403092] and Hayden and King [quant-ph/0409026], we study the problem of the capacity of a quantum channel assisted by a "friendly (channel) environment" that can  ...  Engineering and Physical Sciences Research Council's "IRC QIP", and a University of Bristol Research Fellowship.  ... 
arXiv:quant-ph/0507045v1 fatcat:qtvajxh7qvcmnjoq6hb3i53jjy

How Deep the Theory of Quantum Communications Goes: Superadditivity, Superactivation and Causal Activation [article]

Seid Koudia, Angela Sara Cacciapuoti, Marcello Caleffi
2021 arXiv   pre-print
In the theory of quantum communications, a deeper structure has been recently unveiled -- mainly within the physics community -- showing that the capacity does not completely characterize the channel ability  ...  to transmit information due to phenomena -- namely, superadditivity, superactivation, and causal activation -- with no counterpart in the classical world.  ...  Wehner, “Finite blocklength con- [110] C. H. Bennett, D. P. DiVincenzo, J. A. Smolin, and verse bounds for quantum channels,” IEEE Transactions W. K.  ... 
arXiv:2108.07108v2 fatcat:iueaihzrjvhlfongjbsqmc3q7u

Technical Program

2021 2020 IEEE Information Theory Workshop (ITW)  
The Schalkwijk-Kailath (SK) feedback scheme is a capacity-achieving coding scheme for the point-to-point white Gaussian channel with feedback.  ...  channel with feedback equals the capacity of the same model without secrecy constraint.  ...  Topics here include qubits, quantum gates, quantum measurement, and entanglement.  ... 
doi:10.1109/itw46852.2021.9457668 fatcat:j425ygeajrbd5esztbe5zgygty

Simultaneous classical-quantum capacities of quantum multiple access channels [article]

Jon Yard
2005 arXiv   pre-print
The rates at which classical and quantum information can be simultaneously transmitted from two spatially separated senders to a single receiver over an arbitrary quantum channel are characterized.  ...  The first describes the region of rates at which one sender can send classical information while the other sends quantum information.  ...  Using the previous blocklength-n construction, we will concatenate N such codes, where each utilizes the same shared randomness, to construct a new code with blocklength nN.  ... 
arXiv:quant-ph/0506050v1 fatcat:s443jb2dvvfeze5vmi7tslc3de

Generalized Perfect Codes for Symmetric Classical-Quantum Channels [article]

Andreu Blasco Coll, Gonzalo Vazquez-Vilar, Javier R. Fonollosa
2020 arXiv   pre-print
We define a new family of codes for symmetric classical-quantum channels and establish their optimality.  ...  of the same blocklength and cardinality.  ...  Holevo capacity is an asymptotic quantity that, in general, can only be attained by a large number of channel uses via a joint measurement on the combined channel outputs.  ... 
arXiv:2007.07958v1 fatcat:wouzgzfnnfc5zftcqqrcickxfy

Towards a General Theory of Information Transfer

Rudolf Ahlswede
2006 2006 IEEE International Symposium on Information Theory  
Capacity of Quantum Arbitrarily Varying Channels Rudolf Ahlswede and Vladimir Blinovsky We prove that the average error capacity C q of a quantum arbitrarily varying channel (QAVC) equals 0 or else the  ...  We introduced noiseless source coding for identification and suggested the study of several performance measures.  ...  This code concept is suited for communication over a q-ary channel with input and output alphabets Q, where a word of length n sent by the encoder is changed by the channel in atmost t letters.  ... 
doi:10.1109/isit.2006.261585 fatcat:dqx6jx4n4najjjyefkzirchwgy

Distillation of secret-key from a class of compound memoryless quantum sources

H. Boche, G. Janßen
2016 Journal of Mathematical Physics  
We consider secret-key distillation from tripartite compound classical-quantum-quantum (cqq) sources with free forward public communication under strong security criterion.  ...  Our results show that the capacities with and without the mentioned kind of state knowledge are equal as long as the source is generated by a regular set of density matrices.  ...  For a finite alphabet X and a Hilbert space K, we denote by CQ(X , K) the set of classical-quantum channels, i.e. maps from X to S (K).  ... 
doi:10.1063/1.4960217 fatcat:s26xgnsdivf7fbw4j336uiaxne

Communication over Quantum Channels with Parameter Estimation [article]

Uzi Pereg
2021 arXiv   pre-print
This model can be viewed as a form of quantum metrology, and as the quantum counterpart of the classical rate-and-state channel with state estimation at the decoder.  ...  As a consequence, we obtain regularized formulas for the capacity of random-parameter quantum channels with CSI, generalizing previous results by Boche et al. (2016) on classical-quantum channels.  ...  The direct part of Theorem 11 follows by using a code for the channel P A b →B b ≡ E ⊗b with a blocklength . Doing so, we achieve a rate R < 1 n ( · χ(P)) = 1 b χ(E ⊗b ).  ... 
arXiv:2001.00836v7 fatcat:bkcwqngyebarvcllje6uv7pbpa

The platypus of the quantum channel zoo [article]

Felix Leditzky and Debbie Leung and Vikesh Siddhu and Graeme Smith and John A. Smolin
2022 arXiv   pre-print
In a companion paper, we further show that the qutrit channel demonstrates superadditivity when transmitting quantum information jointly with a variety of assisting channels, in a manner unknown before  ...  Here we study a remarkably simple, low-dimensional, single-parameter family of quantum channels with exotic quantum information-theoretic features.  ...  Then this code can also be regarded as a classical information transmission code with rate r C = r P > 1 and error ε C ≤ ε P .  ... 
arXiv:2202.08380v1 fatcat:6nzpdc7bmrckloaym6runy33kq