English

Complex instruction set computing architecture for performing accurate quantum $Z$ rotations with less magic

Quantum Physics 2013-10-16 v2

Abstract

We present quantum protocols for executing arbitrarily accurate π/2k\pi/2^k rotations of a qubit about its ZZ 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 T=Z(π/4)T = Z(\pi/4) 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 ZZ 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 Z(π/2k)Z(\pi/2^k) gates can be teleported, for 2kkmax2 \leq k \leq k_{\text{max}}. This results in a substantial overall reduction in the number of gates required to achieve a desired gate accuracy for ZZ rotations. The key to our construction is a family of shortened quantum Reed-Muller codes of length 2k+212^{k+2}-1, whose magic-state distillation threshold shrinks with kk but is greater than 0.85% for k6k \leq 6.

Keywords

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

R2 v1 2026-06-21T23:25:46.117Z