Algorithmic superactivation of asymptotic quantum capacity of zero-capacity quantum channels

Authors:
Laszlo Gyongyosi;Sandor Imre
Affiliations:
Quantum Technologies Laboratory, Department of Telecommunications, Budapest University of Technology and Economics, 2 Magyar tudosok krt., H-1111 Budapest, Hungary and Information Systems Research ...;Quantum Technologies Laboratory, Department of Telecommunications, Budapest University of Technology and Economics, 2 Magyar tudosok krt., H-1111 Budapest, Hungary
Venue:
Information Sciences: an International Journal
Year:
2013

Citing 34
Cited 1

Approximate clustering via core-sets

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Smaller coresets for k-median and k-means clustering

SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
On k-Median clustering in high dimensions

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Clustering with Bregman Divergences

The Journal of Machine Learning Research
Quantum Computing and Communications: An Engineering Approach

Quantum Computing and Communications: An Engineering Approach
A PTAS for k-means clustering based on weak coresets

SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
On Bregman Voronoi diagrams

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Clustering for metric and non-metric distance measures

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Preface: Special issue - Quantum structures: Theory and applications

Information Sciences: an International Journal
Markov property in quantum logic: A reflection

Information Sciences: an International Journal
Existence of states on quantum structures

Information Sciences: an International Journal
On minimum Fisher information distributions with restricted support and fixed variance

Information Sciences: an International Journal
On Coresets for $k$-Median and $k$-Means Clustering in Metric and Euclidean Spaces and Their Applications

SIAM Journal on Computing
Editorial: Modelling uncertainty

Information Sciences: an International Journal
Baldwinian learning in clonal selection algorithm for optimization

Information Sciences: an International Journal
Rényi entropy rate for Gaussian processes

Information Sciences: an International Journal
Properties of a hierarchical network based on the star graph

Information Sciences: an International Journal
Improving the efficiency of use of software engineering practices using product patterns

Information Sciences: an International Journal
Privacy-preserving data mining: A feature set partitioning approach

Information Sciences: an International Journal
Efficient successor retrieval operations for aggregate query processing on clustered road networks

Information Sciences: an International Journal
Collection-integral source selection for uncooperative distributed information retrieval environments

Information Sciences: an International Journal
Novel geometrical solution to additivity problem of classical quantum channel capacity

Sarnoff'10 Proceedings of the 33rd IEEE conference on Sarnoff
A transitivity analysis of bipartite rankings in pairwise multi-class classification

Information Sciences: an International Journal
Type-level access pattern view: Enhancing prefetching performance using the iterative and recursive patterns

Information Sciences: an International Journal
The Pólya information divergence

Information Sciences: an International Journal
Results on residual Rényi entropy of order statistics and record values

Information Sciences: an International Journal
A history of graph entropy measures

Information Sciences: an International Journal
Enhancing the security of quantum communication by hiding the message in a superposition

Information Sciences: an International Journal
Structured methodology for supplier selection and evaluation in a supply chain

Information Sciences: an International Journal
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
Fitting the smallest enclosing bregman ball

ECML'05 Proceedings of the 16th European conference on Machine Learning
General formulas for capacity of classical-quantum channels

IEEE Transactions on Information Theory
The private classical capacity and quantum capacity of a quantum channel

IEEE Transactions on Information Theory
Superactivation of quantum channels is limited by the quantum relative entropy function

Quantum Information Processing

Superactivation of quantum channels is limited by the quantum relative entropy function

Quantum Information Processing

Quantified Score

Hi-index	0.07

Visualization

Abstract

The superactivation of zero-capacity quantum channels makes it possible to use two zero-capacity quantum channels with a positive joint capacity for their output. Currently, we have no theoretical background to describe all possible combinations of superactive zero-capacity channels; hence, there may be many other possible combinations. In practice, to discover such superactive zero-capacity channel-pairs, we must analyze an extremely large set of possible quantum states, channel models, and channel probabilities. There is still no extremely efficient algorithmic tool for this purpose. This paper shows an efficient algorithmical method of finding such combinations. Our method can be a very valuable tool for improving the results of fault-tolerant quantum computation and possible communication techniques over very noisy quantum channels.