Quantum Universality from Magic States Distillation Applied to CSS Codes
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.
KeywordsUniversal quantam computing protocols stabilizer states
Unable to display preview. Download preview PDF.
- 2.EmanuelKnill R., Laflamme, Zurek, W.H. 1998Proc. R. Soc. Lond. A.454365Google Scholar
- 4.Emanuel Knill, Fault-tolerant postselected quantum computation: schemes, 2004, quant-ph/0402171.Google Scholar
- 5.Yaoyun Shi, Both Toffoli and controlled-NOT need little help to do universal quantum computation, 2002, quant-ph/0205115.Google Scholar