Generalized Perfect Codes for Symmetric Classical-Quantum Channels

07/15/2020
by   Andreu Blasco Coll, et al.
0

We define a new family of codes for symmetric classical-quantum channels and establish their optimality. To this end, we extend the classical notion of generalized perfect and quasi-perfect codes to channels defined over some finite dimensional complex Hilbert output space. The resulting optimality conditions depend on the channel considered and on an auxiliary state defined on the output space of the channel. For certain N-qubit classical-quantum channels, we show that codes based on a generalization of Bell states are quasi-perfect and, therefore, they feature the smallest error probability among all codes of the same blocklength and cardinality.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/25/2018

The Error Probability of Generalized Perfect Codes via the Meta-Converse

We introduce a definition of perfect and quasi-perfect codes for symmetr...
research
04/03/2020

Comparison of Perfect and Quasi Werner States

In this paper, we investigate comparatively the behaviors of quantum dis...
research
11/13/2018

On the Polarization Levels of Automorphic-Symmetric Channels

It is known that if an Abelian group operation is used in an Arıkan-styl...
research
02/15/2023

Shannon Perfect Secrecy in a Discrete Hilbert Space

The One-time-pad (OTP) was mathematically proven to be perfectly secure ...
research
09/23/2017

Classical and Quantum Factors of Channels

Given a classical channel, a stochastic map from inputs to outputs, can ...
research
09/18/2019

Perfect quantum state transfer on diamond fractal graphs

We extend the analysis of perfect quantum state transfer beyond one dime...
research
07/11/2022

Belief Propagation with Quantum Messages for Symmetric Classical-Quantum Channels

Belief propagation (BP) is a classical algorithm that approximates the m...

Please sign up or login with your details

Forgot password? Click here to reset