Approximate clustering via core-sets
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Quantum Computing and Communications: An Engineering Approach
Quantum Computing and Communications: An Engineering Approach
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
On the smallest enclosing information disk
Information Processing Letters
Clustering for metric and non-metric distance measures
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Quantum teleportation with non-maximal entangled state
MATH'09 Proceedings of the 14th WSEAS International Conference on Applied mathematics
CEA'10 Proceedings of the 4th WSEAS international conference on Computer engineering and applications
Novel geometrical solution to additivity problem of classical quantum channel capacity
Sarnoff'10 Proceedings of the 33rd IEEE conference on Sarnoff
Algorithmic superactivation of asymptotic quantum capacity of zero-capacity quantum channels
Information Sciences: an International Journal
Hi-index | 0.00 |
This paper defines a fundamentally new approach of capacity recovery of very noisy, practically completely useless optical quantum channels. The transmission of information through classical channels and quantum channels differs in many ways. The capacity recovery of very noisy communication channels cannot be imagined for classical systems, and this effect has no analogue in classical systems. The capacity recovery of very noisy quantum channels makes it possible to use two very noisy optical-fiber based quantum channels with a positive joint capacity at the output. Our method gives an algorithmic solution to the capacity recovery problem, and provides an efficient algorithmic solution for finding recoverable very noisy optical quantum channels.