Magic state distillation with punctured polar codes

Abstract

We present a scheme for magic state distillation using punctured polar codes. Our results build on some recent work by Bardet et al. (ISIT, 2016) who discovered that polar codes can be described algebraically as decreasing monomial codes. Using this powerful framework, we construct tri-orthogonal quantum codes (Bravyi et al., PRA, 2012) that can be used to distill magic states for the $T$ gate. An advantage of these codes is that they permit the use of the successive cancellation decoder whose time complexity scales as $O(N\log (N))$. We supplement this with numerical simulations for the erasure channel and dephasing channel. We obtain estimates for the dimensions and error rates for the resulting codes for block sizes up to $2^{20}$ for the erasure channel and $2^{16}$ for the dephasing channel. The dimension of the triply-even codes we obtain is shown to scale like $O(N^{0.8})$ for the binary erasure channel at noise rate $0.01$ and $O(N^{0.84})$ for the dephasing channel at noise rate $0.001$. The corresponding bit error rates drop to roughly $8\times 10^{-28}$ for the erasure channel and $7\times 10^{-15}$ for the dephasing channel respectively.

arXiv comment18 pages, 4 figures

References in corpus (23)

• Channel polarization: A method for constructing capacity-achieving codes for symmetric binary-input memoryless channels
• Good Quantum Error-Correcting Codes Exist
• Universal Quantum Computation with ideal Clifford gates and noisy ancillas
• Magic state distillation with low overhead
• Active stabilisation, quantum computation and quantum state synthesis
• Enhanced fault-tolerant quantum computing in $d$-level systems
• Quantum computation with realistic magic state factories
• Improved magic states distillation for quantum universality
• Multilevel distillation of magic states for quantum computing
• Polar codes for classical-quantum channels
• Qutrit Magic State Distillation
• A unified framework for magic state distillation and multi-qubit gate-synthesis with reduced resource cost
• Codes and Protocols for Distilling $T$, controlled-$S$, and Toffoli Gates
• Efficient Quantum Polar Coding
• Towards low overhead magic state distillation
• Distillation with sublogarithmic overhead
• Unifying gate-synthesis and magic state distillation
• Polar codes for private and quantum communication over arbitrary channels
• Reducing the quantum computing overhead with complex gate distillation
• Complex instruction set computing architecture for performing accurate quantum $Z$ rotations with less magic
• Towards efficient decoding of classical-quantum polar codes
• Magic State Distillation at Intermediate Size
• Recursive decoding of Reed-Muller codes

Cited by in corpus (5)

• On Optimality of CSS Codes for Transversal $T$
• Entanglement Purification with Quantum LDPC Codes and Iterative Decoding
• Bhattacharyya parameter of monomials codes for the Binary Erasure Channel: from pointwise to average reliability
• Classical Coding Approaches to Quantum Applications
• Distilling GHZ States using Stabilizer Codes