Magic-state distillation with the four-qubit code

Authors:
Adam M. Meier;Bryan Eastin;Emanuel Knill
Affiliations:
Physics Department, University of Colorado at Boulder, Boulder, CO;Northrop Grumman Coproration, Baltimore, MD;Information Technology Laboratory, National Institute of Standards and Technology, Boulder, CO
Venue:
Quantum Information & Computation
Year:
2013

Citing 4
Cited 0

The Invariants of the Clifford Groups

Designs, Codes and Cryptography
Quantum Universality from Magic States Distillation Applied to CSS Codes

Quantum Information Processing
Running a Quantum Circuit at the Speed of Data

ISCA '08 Proceedings of the 35th Annual International Symposium on Computer Architecture
On the structure of protocols for magic state distillation

TQC'09 Proceedings of the 4th international conference on Theory of Quantum Computation, Communication, and Cryptography

Quantified Score

Hi-index	0.00

Visualization

Abstract

The distillation of magic states is an often-cited technique for enabling universal quantum computing once the error probability for a special subset of gates has been made negligible by other means. We present a routine for magic-state distillation that reduces the required overhead for a range of parameters of practical interest. Each iteration of the routine uses a four-qubit error-detecting code to distill the +1 eigenstate of the Hadamard gate at a cost of ten input states per two improved output states. Use of this routine in combination with the 15-to-1 distillation routine described by Bravyi and Kitaev allows for further improvements in overhead.