Journal
NPJ QUANTUM INFORMATION
Volume 6, Issue 1, Pages -Publisher
NATURE PUBLISHING GROUP
DOI: 10.1038/s41534-020-0257-5
Keywords
-
Categories
Funding
- Army Research Office (MURI) [W911NF-16-1-0349]
- National Science Foundation [1526380]
- National Science Foundation
Ask authors/readers for more resources
The ability to implement the Quantum Fourier Transform (QFT) efficiently on a quantum computer facilitates the advantages offered by a variety of fundamental quantum algorithms, such as those for integer factoring, computing discrete logarithm over Abelian groups, solving systems of linear equations, and phase estimation, to name a few. The standard fault-tolerant implementation of an n-qubit unitary QFT approximates the desired transformation by removing small-angle controlled rotations and synthesizing the remaining ones into Clifford+T gates, incurring the T-count complexity of O(nlog2(n)). In this paper, we show how to obtain approximate QFT with the T-count of O(nlog(n)). For brevity, the above figures omit the dependence on the approximation error epsilon, assuming the error is fixed. Our approach relies on quantum circuits with measurements and feedforward, and on reusing a special quantum state that induces the phase gradient transformation. We report asymptotic analysis as well as concrete circuits, demonstrating significant advantages in both theory and practice.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available