Lecture notes in computer science

Approximate Quantum Fourier Transform and Quantum Algorithm for Phase Estimation

Alexander N. Prokopenya

Published Jan 1, 2015• 5 citations

Publisher

DOI: 10.1007/978-3-319-24021-3_29

Related papers

Analysis of Quantum Phase Estimation Algorithm Using Quantum Fourier Transform

Priyanka Sharma, Rukhsar Zafar, Amit Kumar Sharma

Lecture notes in electrical engineeringJan 1, 20250 citations

Natural Majorization of the Quantum Fourier Transformation in Phase-Estimation Algorithms

Román Orús, José Ignacio Latorre, Miguel Angel Martin-Delgado

arXiv:quant-ph/0206134Quantum Information ProcessingAug 1, 200212 citations

Phase Estimation and quantum Fourier Transform (qFT)

Belal Ehsan Baaquie, L. C. Kwek

Springer eBooksJan 1, 20233 citations

Quantum Fourier Transform and Phase Estimation in Qudit System

Ye Cao, Shi-Guo Peng, Chao Zheng +1 more

The quantum Fourier transform and quantum phase estimation are the key components for many quantum algorithms, such as order-finding, factoring, and etc. In this article, the general procedure of quantum Fourier transform and phase estimation are investigated for high dimensional case. They can be seen as subroutines in a main program run in a qudit quantum computer, and the quantum circuits are given.

Communications in Theoretical PhysicsMay 1, 201141 citations

Chapter 3: Quantum Fourier transform and phase estimation

Giacomo Nannicini

In this chapter we present two fundamental building blocks for quantum algorithms: the quantum Fourier transform, and one of its direct applications known as phase estimation. Both building blocks are used extensively in the rest of this book.

Society for Industrial and Applied Mathematics eBooksDec 17, 20250 citations

Approximate quantum Fourier transform and decoherence

Adriano Barenco, ARTUR K. EKERT, Kalle‐Antti Suominen +1 more

We discuss the advantages of using the approximate quantum Fourier transform (AQFT) in algorithms which involve periodicity estimations. We analyze quantum networks performing AQFT in the presence of decoherence and show that extensive approximations can be made before the accuracy of AQFT (as compared with regular quantum Fourier transform) is compromised. We show that for some computations an approximation may imply a better performance. \textcopyright{} 1996 The American Physical Society.

arXiv:quant-ph/9601018Physical Review AJul 1, 1996180 citations