On the Structure of Protocols for Magic State Distillation

Abstract

We present a theorem that shows that all useful protocols for magic state distillation output states with a fidelity that is upper-bounded by those generated by a much smaller class of protocols. This reduced class consists of the protocols where multiple copies of a state are projected onto a stabilizer codespace and the logical qubit is then decoded.

This paper provides a theorem that is applied in "Bound States for Magic State Distillation", arXiv:0908.0836. These two papers jointly form the content of a talk entitled "Neither Magical nor Classical?", which was presented at TQC 2009, Waterloo. In press at L.N.C.S as a conference post-proceedings

References in corpus (4)

• Topological fault-tolerance in cluster state quantum computation
• Restrictions on Transversal Encoded Quantum Gate Sets
• Improved magic states distillation for quantum universality
• Bound States for Magic State Distillation in Fault-Tolerant Quantum Computation

Cited by in corpus (1)

• Signed quantum weight enumerators characterize qubit magic state distillation