A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Filters
Superadditivity of Quantum Channel Coding Rate With Finite Blocklength Joint Measurements
2016
IEEE Transactions on Information Theory
Preserved Fulltext
Other Versions
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
2013
2013 51st Annual Allerton Conference on Communication, Control, and Computing (Allerton)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
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
Superadditivity of quantum channel coding rate with finite blocklength quantum measurements
2014
2014 IEEE International Symposium on Information Theory
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
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
One-Shot Lossy Quantum Data Compression
2013
IEEE Transactions on Information Theory
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2013 pre-print arXiv:1304.2336v1 fatcat:ht7rskmjirf3lfm2cbsdcjq3pqOther Versions
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
How Deep the Theory of Quantum Communications Goes: Superadditivity, Superactivation and Causal Activation
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
Other Versions
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
On environment-assisted capacities of quantum channels
2005
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
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
Generalized Perfect Codes for Symmetric Classical-Quantum Channels
[article]
2020
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
We define a new family of codes for symmetric classical-quantum channels and establish their optimality. ...
of the same blocklength and cardinality. ...
For general channels, Polyanskiy et al. proposed several (upper and lower) bounds which accurately characterize the performance of communication systems in the finite blocklength regime [7] . ...
arXiv:2007.07958v1
fatcat:wouzgzfnnfc5zftcqqrcickxfy
Simultaneous classical-quantum capacities of quantum multiple access channels
[article]
2005
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
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
Permutation Enhances Classical Communication Assisted by Entangled States
[article]
2020
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
As examples, we derive analytically the classical capacity of various quantum channels of interests. ...
We give a capacity formula for the classical communication over a noisy quantum channel, when local operations and global permutations allowed in the encoding and bipartite states preshared between the ...
The protocol (n, T , D) is called a semi-global coding protocol of blocklength n for the state-channel pair (ρ, N ).
Fig. 2 . 2 Semiproduct channel coding framework of blocklength n. ...
arXiv:2001.01845v2
fatcat:b6m2uidmobekxi6xi3g5kuxiju
Distillation of secret-key from a class of compound memoryless quantum sources
2016
Journal of Mathematical Physics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2016 pre-print arXiv:1604.05530v1 fatcat:4qknkmqzebbz5orccbmnyqs6heOther Versions
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
Technical Program
2021
2020 IEEE Information Theory Workshop (ITW)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
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
Towards a General Theory of Information Transfer
2006
2006 IEEE International Symposium on Information Theory
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
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
Communication over Quantum Channels with Parameter Estimation
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2021 pre-print arXiv:2001.00836v6 fatcat:lffwr7aduff75bvypxzoxkcx24Other Versions
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]
2022
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
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