The robustness of magic state distillation against errors in Clifford gates
Tomas Jochym-O'Connor, Yafei Yu, Bassam Helou, Raymond Laflamme

TL;DR
This paper analyzes how noise affects the process of magic state distillation in quantum computing, showing it remains effective under certain errors and could be practical for small-scale devices without full fault-tolerance.
Contribution
It investigates the robustness of magic state distillation against initial state perturbations and gate noise, highlighting its efficiency compared to fault-tolerance methods at low error rates.
Findings
Magic state distillation tolerates certain noise levels
Faulty distillation can outperform fault-tolerance at low errors
Noise impacts convergence rate and threshold in the protocol
Abstract
Quantum error correction and fault-tolerance have provided the possibility for large scale quantum computations without a detrimental loss of quantum information. A very natural class of gates for fault-tolerant quantum computation is the Clifford gate set and as such their usefulness for universal quantum computation is of great interest. Clifford group gates augmented by magic state preparation give the possibility of simulating universal quantum computation. However, experimentally one cannot expect to perfectly prepare magic states. Nonetheless, it has been shown that by repeatedly applying operations from the Clifford group and measurements in the Pauli basis, the fidelity of noisy prepared magic states can be increased arbitrarily close to a pure magic state [1]. We investigate the robustness of magic state distillation to perturbations of the initial states to arbitrary locations…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography · Quantum Mechanics and Applications
