On the structure of protocols for magic state distillation

Authors:
Earl T. Campbell;Dan E. Browne
Affiliations:
Department of Physics and Astronomy, University College London, London, UK;Department of Physics and Astronomy, University College London, London, UK
Venue:
TQC'09 Proceedings of the 4th international conference on Theory of Quantum Computation, Communication, and Cryptography
Year:
2009

Citing 4
Cited 2

Quantum computation and quantum information

Quantum computation and quantum information
Quantum Computation with Abelian Anyons

Quantum Information Processing
Quantum Universality from Magic States Distillation Applied to CSS Codes

Quantum Information Processing
Error-Detection-Based Quantum Fault-Tolerance Threshold

Algorithmica - Special Issue: Quantum Computation; Guest Editors: Frédéric Magniez and Ashwin Nayak

Magic-state distillation with the four-qubit code

Quantum Information & Computation
The robustness of magic state distillation against errors in Clifford gates

Quantum Information & Computation

Quantified Score

Hi-index	0.00

Visualization

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.