Algorithmic complexity of quantum capacity
Reads0
Chats0
TLDR
In this article, the authors analyze the quantum capacity from the perspective of algorithmic complexity and show that quantum capacity based on semi-computable concept equals the entropy rate of coherent information, which in turn equals the standard quantum capacity.Abstract:
We analyze the notion of quantum capacity from the perspective of algorithmic (descriptive) complexity. To this end, we resort to the concept of semi-computability in order to describe quantum states and quantum channel maps. We introduce algorithmic entropies (like algorithmic quantum coherent information) and derive relevant properties for them. Then we show that quantum capacity based on semi-computable concept equals the entropy rate of algorithmic coherent information, which in turn equals the standard quantum capacity. Thanks to this, we finally prove that the quantum capacity, for a given semi-computable channel, is limit computable.read more
Citations
More filters
Journal ArticleDOI
Enhanced energy-constrained quantum communication over bosonic Gaussian channels
TL;DR: In this article, the authors consider Gaussian channels that model energy loss and thermal noise errors in realistic optical and microwave communication channels and study their various quantum capacities in the energy-constrained scenario.
Journal ArticleDOI
Enhanced energy-constrained quantum communication over bosonic Gaussian channels
TL;DR: In this paper, the authors consider Gaussian channels that model energy loss and thermal noise errors in realistic optical and microwave communication channels and study their various quantum capacities in the energy-constrained scenario.
Journal ArticleDOI
Quantum capacity of a bosonic dephasing channel
TL;DR: In this paper, the authors studied the capacity of a continuous-variable dephasing channel with a discrete version of a Gaussian distribution and showed that the capacity decays exponentially with the number of dephases.
Journal ArticleDOI
Entropic singularities give rise to quantum transmission.
Vikesh Siddhu,Vikesh Siddhu +1 more
TL;DR: In this paper, the authors showed that non-additivity of the quantum channel coherent information can also occur in very noisy channels with coherent information much smaller than that of a perfect channel.
Posted Content
Quantum Computation and Communication in Bosonic Systems
TL;DR: In this article, the authors provide an overview of the field of continuous-variable quantum error correction (QEC) and present the benchmark and optimization results of various single-mode bosonic codes against practically relevant excitation loss errors.
References
More filters
Journal ArticleDOI
Three approaches to the quantitative definition of information
TL;DR: In this article, three approaches to the quantitative definition of information are presented: information-based, information-aware and information-neutral approaches to quantifying information in the context of information retrieval.
Journal ArticleDOI
Completely positive linear maps on complex matrices
TL;DR: A linear map from M n to M m is completely positive iff it admits an expression Φ(A)=Σ i V ∗ i AV i where Vi are n×m matrices as mentioned in this paper.
Journal ArticleDOI
A Formal Theory of Inductive Inference. Part II
TL;DR: Four ostensibly different theoretical models of induction are presented, in which the problem dealt with is the extrapolation of a very long sequence of symbols—presumably containing all of the information to be used in the induction.
Journal ArticleDOI
On the Length of Programs for Computing Finite Binary Sequences
TL;DR: An application to the problem of defining a patternless sequence is proposed in terms of the concepts here developed to study the use of Turing machines for calculating finite binary sequences.