Papers
Topics
Authors
Recent
Search
2000 character limit reached

Towards low overhead magic state distillation

Published 20 Nov 2018 in quant-ph | (1811.08461v2)

Abstract: Magic state distillation is a resource intensive sub-routine for quantum computation. The ratio of noisy input states to output states with error rate at most $\epsilon$ scales as $O(\log{\gamma}(1/\epsilon))$ (Bravyi and Haah, PRA 2012). In a breakthrough paper, Hastings and Haah (PRL 2018) showed that it is possible to construct distillation routines with sub-logarithmic overhead, achieving $\gamma \approx 0.6779$ and falsifying a conjecture that $\gamma$ is lower bounded by $1$. They then ask whether $\gamma$ can be made arbitrarily close to $0$. We answer this question in the affirmative for magic state distillation routines using qudits ($d$ dimensional quantum systems).

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.