scispace - formally typeset
Open AccessJournal ArticleDOI

Capacity Bounds via Operator Space Methods

Reads0
Chats0
TLDR
In this paper, the authors reformulate approximations of the quantum capacity by operator space norms and give both upper and lower bounds on quantum capacity, and potential quantum capacity using interpolation techniques.
Abstract
Quantum capacity, as the ultimate transmission rate of quantum communication, is characterized by regularized coherent information. In this work, we reformulate approximations of the quantum capacity by operator space norms and give both upper and lower bounds on quantum capacity, and potential quantum capacity using interpolation techniques. We identify a situation in which nice classes of channels satisfy a "comparison property" on entropy, coherent information and capacities. The paradigms for our estimates are so-called conditional expectations. These generally non-degradable channels admit a strongly additive expression for $Q^{(1)}$. We also identify conditions on channels showing that the "hashing bound" is optimal for the cb-entropy. These two estimates combined give upper and lower bounds on quantum capacity on our "nice" classes of channels, which differ only up to a factor 2, independent of the dimension. The estimates are discussed for certain classes of channels, including group channels, Pauli channels and other high-dimensional channels.

read more

Content maybe subject to copyright    Report

Citations
More filters
Proceedings ArticleDOI

A semidefinite programming upper bound of quantum capacity

TL;DR: In this article, the power of positive partial transpose preserving (PPTp) and no-signalling (NS) codes in quantum communication has been studied and a general semidefinite programming (SDP) upper bound of quantum capacity has been shown.
References
More filters
Journal ArticleDOI

A mathematical theory of communication

TL;DR: This final installment of the paper considers the case where the signals or the messages or both are continuously variable, in contrast with the discrete nature assumed until now.
Journal ArticleDOI

Can Quantum-Mechanical Description of Physical Reality Be Considered Complete?

TL;DR: Consideration of the problem of making predictions concerning a system on the basis of measurements made on another system that had previously interacted with it leads to the result that one is led to conclude that the description of reality as given by a wave function is not complete.
Journal ArticleDOI

On the Einstein-Podolsky-Rosen paradox

TL;DR: In this article, it was shown that even without such a separability or locality requirement, no hidden variable interpretation of quantum mechanics is possible and that such an interpretation has a grossly nonlocal structure, which is characteristic of any such theory which reproduces exactly the quantum mechanical predictions.
Journal ArticleDOI

Fault tolerant quantum computation by anyons

TL;DR: A two-dimensional quantum system with anyonic excitations can be considered as a quantum computer Unitary transformations can be performed by moving the excitations around each other Unitary transformation can be done by joining excitations in pairs and observing the result of fusion.
Book

Interpolation Spaces: An Introduction

TL;DR: In this paper, the authors define the Riesz-Thorin Theorem as a necessary and sufficient condition for interpolation spaces, and apply it to approximate spaces in the context of vector spaces.
Related Papers (5)