Distillation protocols for Fourier states in quantum computing
arXiv:1303.3066
Abstract
Fourier states are multi-qubit registers that facilitate phase rotations in fault-tolerant quantum computing. We propose distillation protocols for constructing the fundamental, -qubit Fourier state with error at a cost of Toffoli gates and Clifford gates, or any arbitrary Fourier state using 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 (20)
- Elementary gates for quantum computation
- Surface codes: Towards practical large-scale quantum computation
- Purification of Noisy Entanglement and Faithful Teleportation via Noisy Channels
- Quantum Algorithms Revisited
- A meet-in-the-middle algorithm for fast synthesis of depth-optimal quantum circuits
- High threshold universal quantum computation on the surface code
- Restrictions on Transversal Encoded Quantum Gate Sets
- A new quantum ripple-carry addition circuit
- Preconditioned quantum linear system algorithm
- Quantum circuits of T-depth one
- Fast Quantum Modular Exponentiation
- Multilevel distillation of magic states for quantum computing
- Surface code implementation of block code state distillation
- Efficient Decomposition of Single-Qubit Gates into Basis Circuits
- 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
- A State Distillation Protocol to Implement Arbitrary Single-qubit Rotations
- Distilling one-qubit magic states into Toffoli states
- Complex instruction set computing architecture for performing accurate quantum rotations with less magic