Novel geometrical solution to additivity problem of classical quantum channel capacity

Authors:
Laszlo Gyongyosi;Sandor Imre
Affiliations:
Department of Telecommunications, Budapest University of Technology and Economics, Budapest, Hungary;Department of Telecommunications, Budapest University of Technology and Economics, Budapest, Hungary
Venue:
Sarnoff'10 Proceedings of the 33rd IEEE conference on Sarnoff
Year:
2010

Citing 4
Cited 2

Approximate clustering via core-sets

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Quantum computation and quantum information

Quantum computation and quantum information
Quantum Computing and Communications: An Engineering Approach

Quantum Computing and Communications: An Engineering Approach
Computational geometric analysis of physically allowed quantum cloning transformations for quantum cryptography

CEA'10 Proceedings of the 4th WSEAS international conference on Computer engineering and applications

Channel capacity restoration of noisy optical quantum channels

NEHIPISIC'11 Proceeding of 10th WSEAS international conference on electronics, hardware, wireless and optical communications, and 10th WSEAS international conference on signal processing, robotics and automation, and 3rd WSEAS international conference on nanotechnology, and 2nd WSEAS international conference on Plasma-fusion-nuclear physics
Algorithmic superactivation of asymptotic quantum capacity of zero-capacity quantum channels

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

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.