Distillation protocols for Fourier states in quantum computing

Abstract

Fourier states are multi-qubit registers that facilitate phase rotations in fault-tolerant quantum computing. We propose distillation protocols for constructing the fundamental, $n$-qubit Fourier state with error $O(2^{-n})$ at a cost of $O(n\log n)$ Toffoli gates and Clifford gates, or any arbitrary Fourier state using $O(n^2)$ gates. We analyze these protocols with methods from digital signal processing. These results suggest that phase kickback, which uses Fourier states, could be the current lowest-overhead method for generating arbitrary phase rotations.

18 pages, 4 figures

References in corpus (10)

• Surface codes: Towards practical large-scale quantum computation
• Restrictions on Transversal Encoded Quantum Gate Sets
• A new quantum ripple-carry addition circuit
• Quantum circuits of T-depth one
• Fast Quantum Modular Exponentiation
• Multilevel distillation of magic states for quantum computing
• Scalability of Shor's algorithm with a limited set of rotation gates
• A bridge to lower overhead quantum computation
• Resource Requirements for Fault-Tolerant Quantum Simulation: The Transverse Ising Model Ground State
• Distilling one-qubit magic states into Toffoli states