Distilling one-qubit magic states into Toffoli states

Abstract

For certain quantum architectures and algorithms, most of the required resources are consumed during the distillation of one-qubit magic states for use in performing Toffoli gates. I show that the overhead for magic-state distillation can be reduced by merging distillation with the implementation of Toffoli gates. The resulting routine distills 8 one-qubit magic states directly to a Toffoli state, which can be used without further magic to perform a Toffoli gate.

8 pages, 11 figures, 1 table, v2: corrected several careless errors, apologies

References in corpus (11)

• Surface codes: Towards practical large-scale quantum computation
• Topological fault-tolerance in cluster state quantum computation
• Magic state distillation with low overhead
• Novel constructions for the fault-tolerant Toffoli gate
• Topological Computation without Braiding
• Magic state distillation in all prime dimensions using quantum Reed-Muller codes
• Improved magic states distillation for quantum universality
• Multilevel distillation of magic states for quantum computing
• Catalysis and activation of magic states in fault tolerant architectures
• A bridge to lower overhead quantum computation
• On the Power of Reusable Magic States

Cited by in corpus (10)

• Novel constructions for the fault-tolerant Toffoli gate
• Focus beyond quadratic speedups for error-corrected quantum advantage
• One-step implementation of Toffoli gate for neutral atoms based on unconventional Rydberg pumping
• Error rates and resource overheads of encoded three-qubit gates
• Distillation protocols for Fourier states in quantum computing
• Flexible layout of surface code computations using AutoCCZ states
• Hybrid magic state distillation for universal fault-tolerant quantum computation
• Resource optimization for fault-tolerant quantum computing
• Clifford operators in SU(N)1; N not odd prime
• Hypergraph States in SU(N)1, N odd prime, Chern-Simons Theory