Near-Capacity Code Design for Entanglement-Assisted Classical Communication over Quantum Depolarizing Channels

We have conceived a near-capacity code design for entanglement-assisted classical communication over the quantum depolarizing channel. The proposed system relies on efficient near-capacity classical code designs for approaching the entanglement-assisted classical capacity of a quantum depolarizing channel. It incorporates an Irregular Convolutional Code (IRCC), a Unity Rate Code (URC) and a soft-decision aided Superdense Code (SD), which is hence referred to as an IRCC-URC-SD arrangement. Furthermore, the entanglement-assisted classical capacity of an N-qubit superdense code transmitted over a depolarizing channel is invoked for benchmarking. It is demonstrated that the proposed system operates within 0.4 dB of the achievable noise limit for both 2-qubit as well as 3-qubit SD schemes. More specifically, our design exhibits a deviation of only 0.062 and 0.031 classical bits per channel use from the corresponding 2-qubit and 3-qubit capacity limits, respectively. The proposed system is also benchmarked against the classical convolutional and turbo codes.

[1]  Lajos Hanzo,et al.  Unveiling Near-Capacity Code Design: The Realization of Shannon's Communication Theory for MIMO Channels , 2008, 2008 IEEE International Conference on Communications.

[2]  P. Knight,et al.  Multiparticle generalization of entanglement swapping , 1998 .

[3]  Krishna R. Narayanan Effect of precoding on the convergence of turbo equalization for partial response channels , 2001, IEEE J. Sel. Areas Commun..

[4]  Lajos Hanzo,et al.  Quantum Search Algorithms, Quantum Wireless, and a Low-Complexity Maximum Likelihood Iterative Quantum Multi-User Detector Design , 2013, IEEE Access.

[5]  Thierry Paul,et al.  Quantum computation and quantum information , 2007, Mathematical Structures in Computer Science.

[6]  B. L. Yeap,et al.  Turbo Coding, Turbo Equalisation and Space-Time Coding , 2002 .

[7]  T. H. Liew,et al.  Turbo Coding, Turbo Equalisation and Space-Time Coding: EXIT-Chart-Aided Near-Capacity Designs for Wireless Channels , 2011 .

[8]  Stephan ten Brink,et al.  Extrinsic information transfer functions: model and erasure channel properties , 2004, IEEE Transactions on Information Theory.

[9]  Lajos Hanzo,et al.  EXIT Charts for System Design and Analysis , 2014, IEEE Communications Surveys & Tutorials.

[10]  Hermann Kampermann,et al.  Optimal super dense coding over noisy quantum channels , 2010, 1004.5573.

[11]  Sang Joon Kim,et al.  A Mathematical Theory of Communication , 2006 .

[12]  Michael Tuchler,et al.  EXIT charts of irregular codes , 2002 .

[13]  Stephan ten Brink,et al.  Convergence behavior of iteratively decoded parallel concatenated codes , 2001, IEEE Trans. Commun..

[14]  Charles H. Bennett,et al.  Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states. , 1992, Physical review letters.

[15]  Lajos Hanzo,et al.  Efficient Computation of EXIT Functions for Nonbinary Iterative Decoding , 2006, IEEE Transactions on Communications.

[16]  Lajos Hanzo,et al.  Near-capacity turbo trellis coded modulation design based on EXIT charts and union bounds - [transactions papers] , 2008, IEEE Transactions on Communications.

[17]  Ashish V. Thapliyal,et al.  Entanglement-Assisted Classical Capacity of Noisy Quantum Channels , 1999, Physical Review Letters.

[18]  Michael Tüchler,et al.  Design of Serially Concatenated Systems Depending on the Block Length , 2004, IEEE Trans. Commun..

[19]  Yonghui Li,et al.  Transactions Papers Near-Capacity Turbo Trellis Coded Modulation Design Based on EXIT Charts and Union Bounds , 2008 .