Information Geometric Superactivation of Asymptotic Quantum Capacity and Classical Zero-Error Capacity of Zero-Capacity Quantum Channels
Laszlo Gyongyosi

TL;DR
This paper explores the phenomenon of superactivation in zero-capacity quantum channels, providing an algorithmic approach and linking it to information geometry, to better understand how two zero-capacity channels can jointly achieve positive capacity.
Contribution
It introduces an algorithmic solution to superactivation and establishes a theoretical connection between superactivation and information geometric principles.
Findings
Superactivation enables zero-capacity channels to achieve positive joint capacity.
The superactivation effect is rooted in information geometric issues.
An algorithmic approach to identify superactivation scenarios.
Abstract
The superactivation of zero-capacity quantum channels makes it possible to use two zero-capacity quantum channels with a positive joint capacity at the output. Currently, we have no theoretical background for describing all possible combinations of superactive zero-capacity channels; hence, there may be many other possible combinations. In this PhD Thesis I provide an algorithmic solution to the problem of superactivation and prove that superactivation effect is rooted in information geometric issues.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography · Quantum Mechanics and Applications
