Complex instruction set computing architecture for performing accurate quantum $Z$ rotations with less magic
Abstract
We present quantum protocols for executing arbitrarily accurate rotations of a qubit about its axis. Reduced instruction set computing (\textsc{risc}) architectures typically restrict the instruction set to stabilizer operations and a single non-stabilizer operation, such as preparation of a "magic" state from which gates can be teleported. Although the overhead required to distill high-fidelity copies of this magic state is high, the subsequent quantum compiling overhead to realize rotations in a \textsc{risc} architecture can be much greater. We develop a complex instruction set computing (\textsc{cisc}) architecture whose instruction set includes stabilizer operations and preparation of magic states from which gates can be teleported, for . This results in a substantial overall reduction in the number of gates required to achieve a desired gate accuracy for rotations. The key to our construction is a family of shortened quantum Reed-Muller codes of length , whose magic-state distillation threshold shrinks with but is greater than 0.85% for .
Cite
@article{arxiv.1302.3240,
title = {Complex instruction set computing architecture for performing accurate quantum $Z$ rotations with less magic},
author = {Andrew J. Landahl and Chris Cesare},
journal= {arXiv preprint arXiv:1302.3240},
year = {2013}
}
Comments
13 pages, 4 figures. Resource metric now non-Clifford states. Comparison now to Meier-Eastin-Knill distillation and (optimal) Selinger compiling. Minor tweaks made to concatenated teleportation analysis