DocumentCode :
2428396
Title :
Novel geometrical solution to additivity problem of classical quantum channel capacity
Author :
Gyongyosi, Laszlo ; Imre, Sandor
Author_Institution :
Dept. of Telecommun., Budapest Univ. of Technol. & Econ., Budapest, Hungary
fYear :
2010
fDate :
12-14 April 2010
Firstpage :
1
Lastpage :
5
Abstract :
Quantum channel additivity is currently an active area of research in Quantum Information Theory. The additivity conjectures have emerged from an attempt to find a closed form expression for the capacity of a noisy quantum channel. To this day, strict additivity for quantum channel capacity has been conjectured, but not proven. The open questions related to additivity of quantum channel capacities can be discussed by our novel approach. We show an efficient computational geometric method to analyze the additivity property, using quantum Delaunay tessellation on the Bloch ball and quantum relative entropy as distance measure.
Keywords :
channel capacity; information theory; quantum communication; Bloch ball; classical quantum channel capacity; computational geometric method; noisy quantum channel; quantum Delaunay tessellation; quantum channel additivity; quantum information theory; quantum relative entropy; Channel capacity; Data mining; Entropy; Information theory; Noise measurement; Quantum computing; Quantum entanglement; Quantum mechanics; Relativistic quantum mechanics; Telecommunication computing; quantum channel capacity; quantum communications; quantum information theory;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Sarnoff Symposium, 2010 IEEE
Conference_Location :
Princeton, NJ
Print_ISBN :
978-1-4244-5592-8
Type :
conf
DOI :
10.1109/SARNOF.2010.5469715
Filename :
5469715
Link To Document :
بازگشت