In this chapter we introduce the Quantum Fourier Transform (QFT), which is a key ingredient of many quantum protocols, and estimate the number of quantum gates to implement it. Then, we apply the QFT to the phase estimation problem and address the factoring algorithm proposed by Shor. In particular, we highlight the role of the QFT in the order-finding protocol that allows overcoming the computational limits of the best classical algorithms.

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Quantum Fourier Transform and Shor’s Factoring Algorithm

  • Stefano Olivares

摘要

In this chapter we introduce the Quantum Fourier Transform (QFT), which is a key ingredient of many quantum protocols, and estimate the number of quantum gates to implement it. Then, we apply the QFT to the phase estimation problem and address the factoring algorithm proposed by Shor. In particular, we highlight the role of the QFT in the order-finding protocol that allows overcoming the computational limits of the best classical algorithms.