Math @ Duke

Publications [#319311] of Henry Pfister
Papers Published
 Kumar, S; Calderbank, R; Pfister, HD, Reedmuller codes achieve capacity on the quantum erasure channel,
Ieee International Symposium on Information Theory Proceedings, vol. 2016August
(August, 2016),
pp. 17501754, ISBN 9781509018062 [doi]
(last updated on 2018/08/21)
Abstract: © 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 errorcorrecting codes called stabilizer codes is known to contain capacityachieving sequences for the quantum erasure channel, but no efficient method is known to construct these sequences. In this article, we explicitly describe a capacityachieving code sequence for the quantum erasure channel. In particular, we show that CalderbankShorSteane (CSS) stabilizer codes constructed from selforthogonal binary linear codes are capacityachieving on the quantum erasure channel if the binary linear codes are capacityachieving on the binary erasure channel. Recently, ReedMuller codes were shown to achieve capacity on classical erasure channels. Using this, we show that CSS codes constructed from binary ReedMuller codes achieve the capacity of the quantum erasure channel. The capacityachieving nature of these CSS codes is also explained from a GF(4) perspective.


dept@math.duke.edu
ph: 919.660.2800
fax: 919.660.2821
 
Mathematics Department
Duke University, Box 90320
Durham, NC 277080320

