Department of Mathematics
 Search | Help | Login | pdf version | printable version

Math @ Duke



Publications [#319311] of Henry Pfister

Papers Published

  1. Kumar, S; Calderbank, R; Pfister, HD, Reed-muller codes achieve capacity on the quantum erasure channel, Ieee International Symposium on Information Theory Proceedings, vol. 2016-August (August, 2016), pp. 1750-1754, IEEE, ISBN 9781509018062 [doi]
    (last updated on 2019/07/22)

    © 2016 IEEE. The quantum erasure channel is the simplest example of a quantum communication channel and its information capacity is known precisely. The subclass of quantum error-correcting codes called stabilizer codes is known to contain capacity-achieving sequences for the quantum erasure channel, but no efficient method is known to construct these sequences. In this article, we explicitly describe a capacity-achieving code sequence for the quantum erasure channel. In particular, we show that Calderbank-Shor-Steane (CSS) stabilizer codes constructed from self-orthogonal binary linear codes are capacity-achieving on the quantum erasure channel if the binary linear codes are capacity-achieving on the binary erasure channel. Recently, Reed-Muller codes were shown to achieve capacity on classical erasure channels. Using this, we show that CSS codes constructed from binary Reed-Muller codes achieve the capacity of the quantum erasure channel. The capacity-achieving nature of these CSS codes is also explained from a GF(4) perspective.
ph: 919.660.2800
fax: 919.660.2821

Mathematics Department
Duke University, Box 90320
Durham, NC 27708-0320