Improved magic states distillation for quantum universality
read the original abstract
Given stabilizer operations and the ability to repeatedly prepare a single-qubit mixed state rho, can we do universal quantum computation? As motivation for this question, "magic state" distillation procedures can reduce the general fault-tolerance problem to that of performing fault-tolerant stabilizer circuits. We improve the procedures of Bravyi and Kitaev in the Hadamard "magic" direction of the Bloch sphere to achieve a sharp threshold between those rho 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 stabilizer operations, gives quantum universality. It remains open whether there is also a tight separation in the so-called T direction.
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
Hardware-Tailored Resource Estimation for Magic-State Distillation on Silicon Spin Qubits
Resource estimation for magic-state distillation on silicon spin qubits finds 42% overhead reduction via optimized pulses and ~3x physical footprint reduction with biased codes versus surface code.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.