Quantum Information Processing

, Volume 4, Issue 3, pp 251–264 | Cite as

Quantum Universality from Magic States Distillation Applied to CSS Codes

  • Ben W. Reichardt


Given Clifford group operations and the ability to repeatedly prepare a single-qubit mixed state ρ, can one do universal quantum computation? We show a sharp threshold in the Hadamard “magic” direction of the Bloch sphere between those ρ allowing universal quantum computation, and those for which any calculation can be efficiently classically simulated. As a corollary, the ability to repeatedly prepare any pure state which is not a stabilizer state (e.g., any single-qubit pure state which is not a Pauli eigenstate), together with Clifford group operations, gives quantum universality. As motivation for this question, “magic state” distillation procedures can reduce the general fault-tolerance problem to that of performing fault-tolerant Clifford group circuits.


Universal quantam computing protocols stabilizer states 


03.67.Lx 03.67.Pp 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Sergey, Bravyi, Alexei, Kitaev 2005Phys. Rev. A.71022316quant-ph/0403025CrossRefGoogle Scholar
  2. 2.
    EmanuelKnill R., Laflamme, Zurek, W.H. 1998Proc. R. Soc. Lond. A.454365Google Scholar
  3. 3.
    Oscar Boykin, P., Tal, Mor, Matthew, Pulver, Vwani, Roychowdhury, Farrokh, Vatan 2000Inform. Process. Lett.75101CrossRefGoogle Scholar
  4. 4.
    Emanuel Knill, Fault-tolerant postselected quantum computation: schemes, 2004, quant-ph/0402171.Google Scholar
  5. 5.
    Yaoyun Shi, Both Toffoli and controlled-NOT need little help to do universal quantum computation, 2002, quant-ph/0205115.Google Scholar
  6. 6.
    Emanuel, Knill 2005Nature43439CrossRefPubMedGoogle Scholar
  7. 7.
    Harrow, A., Nielsen, M. 2003Phys. Rev. A68012308quant-ph/0301108CrossRefGoogle Scholar
  8. 8.
    Virmani, S., Susana F., Huelga, Martin B., Plenio 2005Phys. Rev. A71042328quant-ph/0408076CrossRefMathSciNetGoogle Scholar

Copyright information

© Springer Science+Business Media, Inc. 2005

Authors and Affiliations

  1. 1.EECS Department, Computer Science DivisionUniversity of CaliforniaBerkeleyUSA

Personalised recommendations