Algorithmic complexity of quantum capacity

DOI10.1007/S11128-018-1859-0MaRDI QIDQ1654065zbMATH OpenOpenAlexWikidataFDO

Authors Samad Khabbazi Oskouei, Stefano Mancini

Publication date 7 August 2018

Published in Quantum Information Processing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1608.07730

zbMATH Keywords

algorithmic complexityquantum capacityquantum channelsquantum entropies

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68) Measures of information, entropy (94A17) Channel models (including quantum) in information and communication theory (94A40)

Abstract: Recently the theory of communication developed by Shannon has been extended to the quantum realm by exploiting the rules of quantum theory. This latter stems on complex vector spaces. However complex (as well as real) numbers are just idealizations and they are not available in practice where we can only deal with rational numbers. This fact naturally leads to the question of whether the developed notions of capacities for quantum channels truly catch their ability to transmit information. Here we answer this question for the quantum capacity. To this end we resort to the notion of semi-computability in order to approximately (by rational numbers) describe quantum states and quantum channel maps. Then we introduce algorithmic entropies (like algorithmic quantum coherent information) and derive relevant properties for them. Finally we define algorithmic quantum capacity and prove that it equals the standard one.

Recommendations

• Quantum algorithmic entropy
• The capacity of the quantum channel with general signal states
• ALGORITHMIC COMPLEXITY OF QUANTUM STATES
• Quantum algorithmic complexities and entropy
• On Quantum Capacity and its Bound

Cites work

• A Decoupling Approach to the Quantum Capacity
• A formal theory of inductive inference. Part II
• Completely positive linear maps on complex matrices
• Completely positive maps and entropy inequalities
• Gacs quantum algorithmic entropy in infinite dimensional Hilbert spaces
• scientific article; zbMATH DE number 3427210 (Why is no real title available?)
• On the Length of Programs for Computing Finite Binary Sequences
• Positive Functions on C ∗ -Algebras
• Quantum algorithmic entropy
• Quantum information theory
• Quantum Kolmogorov complexity
• Quantum Kolmogorov complexity based on classical descriptions
• THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
• The Private Classical Capacity and Quantum Capacity of a Quantum Channel

Cited in

(1)

• Shannon meets Turing: non-computability and non-approximability of the finite state channel capacity

This page was built for publication: Algorithmic complexity of quantum capacity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1654065)