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.
Quantum Information Processing – Springer Journals
Published: May 23, 2005
It’s your single place to instantly
discover and read the research
that matters to you.
Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.
All for just $49/month
Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly
Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.
All the latest content is available, no embargo periods.
“Whoa! It’s like Spotify but for academic articles.”@Phil_Robichaud