Obtaining the Quantum Fourier Transform from the classical FFT with QR decomposition

作者:

Highlights:

摘要

We present the detailed process of converting the classical Fourier Transform algorithm into the quantum one by using QR decomposition. This provides an example of a technique for building quantum algorithms using classical ones. The Quantum Fourier Transform is one of the most important quantum subroutines known at present, used in most algorithms that have exponential speed-up compared to the classical ones. We briefly review Fast Fourier Transform and then make explicit all the steps that led to the quantum formulation of the algorithm, generalizing Coppersmith’s work.

论文关键词:81-08,65T50,68W40,Quantum computing,Quantum Fourier Transform,Quantum circuit design

论文评审过程:Received 30 January 2008, Revised 6 December 2009, Available online 21 May 2010.

论文官网地址:https://doi.org/10.1016/j.cam.2010.05.012