# Quantum Fourier transform

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2017

2017

- Quantum Information Processing
- 2017

The quantum Fourier transform, with exponential speed-up compared to the classical fast Fourier transform, has played anâ€¦Â (More)

Is this relevant?

Review

2017

Review

2017

- Quantum Information Processing
- 2017

The quantum Fourier transform offers an interesting way to perform arithmetic operations on a quantum computer. We reviewâ€¦Â (More)

Is this relevant?

2013

2013

- ISSAC
- 2013

This paper proposes an <i>O</i>(<i>n</i><sup>4</sup>) quantum Fourier transform (QFT) algorithm over symmetric group <i>S<sub>nâ€¦Â (More)

Is this relevant?

2012

2012

- Applied Mathematics and Computation
- 2012

The quantum Fourier transform (QFT) plays an important role in many known quantum algorithms such as Shor's algorithm for primeâ€¦Â (More)

Is this relevant?

2011

2011

- IEEE Second Latin American Symposium on Circuitsâ€¦
- 2011

The Quantum Fourier Transform (QFT) has an important role in some of the most interesting and useful quantum algorithms, such asâ€¦Â (More)

Is this relevant?

2004

2004

- ACM Trans. Algorithms
- 2004

The quantum Fourier transform (QFT) is the principal ingredient of most efficient quantum algorithms. We present a genericâ€¦Â (More)

Is this relevant?

2004

2004

- 2004

We analyze a class of quantum operations based on a geometrical representation of dâˆ’level quantum system (or qudit for short). Aâ€¦Â (More)

Is this relevant?

Highly Cited

2000

Highly Cited

2000

- FOCS
- 2000

We give new bounds on the circuit complexity of the quantum Fourier transform (QFT). We give an upper bound of O(logn + log log(1â€¦Â (More)

Is this relevant?

Highly Cited

2000

Highly Cited

2000

- 2000

This book provides a thorough introduction to quantum information theory and quantum computation in general, especially coveringâ€¦Â (More)

Is this relevant?

Highly Cited

2000

Highly Cited

2000

- FOCS
- 2000

We give an algorithm for approximating the quantum Fourier transform over an arbitraryZp which requires only O(n logn) stepsâ€¦Â (More)

Is this relevant?