Communications in Theoretical Physics

Quantum Fourier Transform and Phase Estimation in Qudit System

Ye Cao, Shi-Guo Peng, Chao Zheng, Gui‐Lu Long

Published May 1, 2011• 41 citations

Abstract

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.

DOI: 10.1088/0253-6102/55/5/11

Related papers

Exploration and Implementation of Quantum Phase Estimation Algorithms

Jorge García Carrasco

Quantum computing is the field that studies computation using quantum mechanical systems, exploiting properties such as superposition or entanglement. The focus of this project will be on quantum phase estimation algorithms. The formalism commonly used to represent quantum algorithms as quantum circuits composed by qubits and quantum gates will be presented. Then, we will be able to explain the quantum Fourier transform (that is exponentially faster than its classical analogue) and three quantum phase estimation algorithms: Kitaev’s phase estimation (KPEA), the phase estimation algorithm based on QFT (PEA) and the iterative quantum phase estimation algorithm based on a semiclassical Fourier transform (IPEA). We will use the Qiskit framework in order to run simulations of such algorithms, and even run them in real IBM Q Experience quantum computers (specifically, we will use the 5 qubit computer ibmq_essex). Statistical post-processing techniques will be essential in order to extract a phase estimation from the results obtained. We will use two post-processing techniques: the majority and the average rule. The performance of these methods applied to the results of several simulations and executions in ibmq_essex will be studied. At last, we will talk about the possible applications of phase estimation algorithms. Phase estimation is used as a subroutine in the field of quantum simulation, allowing us to obtain several magnitudes of a quantum system such as the energy levels. We will present an efficient quantum algorithm for factoring called Shor’s algorithm. The cost of factorization with a classical computer increases exponentially with the size of the input, so this is a example of a task that cannot be solved efficiently on a classical computer, but can be solved efficiently by a quantum computer. Phase estimation is also used in the field of quantum metrology. Specifically, an N-V center can be used to measure magnetic fields with high sensitivity and spatial resolution operating at room temperature thanks to a measuring protocol based on phase estimation.

Jun 27, 20200 citations

THEORETICAL FRAMEWORK AND ALGORITHMIC IMPLEMENTATION OF THE QUANTUM FOURIER TRANSFORM AND PHASE ESTIMATION

Medak Srinivas

The Quantum Fourier Transform (QFT)andQuantumPhaseEstimation (QPE)are twofundamental algorithmic frameworks in quantum computation, and they provide the mathematical basis of many exponential-speedup quan tum algorithms, such as Shor’s factoring algorithm and quantum simulation techniques. In this work we present a detailed theoretical and computational study of the Quantum Fourier Transform and its integration in the Quan tum Phase Estimation. The discussion begins with the linear algebraic structure of the Hilbert spaces, the unitary transformations, and the complex vector representations that enable quantum interference and superposition. The QFT is studied as the unitary transform of computational basis states in the amplitudes in the frequency domain by phase rotations and tensor-product decompositions. The efficient circuit implementation in terms of Hadamard and controlled phase gates of this transform is discussed. The advantage of the transform in terms of polynomial time complexity over the classical discrete Fourier transform in some quantum scenarios is discussed.The QFT is implemented and the Quantum Phase Estimation algorithm is proposed to obtain the eigenphase information of the unitary operators. In the report the mathematical representation of QPE is derived by using the controlled unitary evolution, the inverse Fourier transforms and the measurement theory in finite dimensional Hilbert spaces. We discuss the probabilistic interpretation of phase extraction in detail and the convergence properties of the bi nary phase approximation. We also discuss the relation of QPE to eigenvalue problems in quantum mechanics and its applications to Hamiltonian simulation, quantum chemistry, cryptography, and hidden subgroup prob lems.Implementation aspects of these algorithms are studied using quantum circuit representations and oracle based computation models. We also discuss error sensitivity, qubit precision requirements, decoherence limita tions and practical constraints of Noisy Intermediate-Scale Quantum (NISQ) hardware. The work synthesizes the mathematical foundations, computational complexity analysis and physical realizations of the QFT and the QPE, demonstrating how the Fourier-based quantum transformations provide the essential mechanism underlying modern quantum algorithmic speedups and scalable quantum information processing.

Iterative International Publishers eBooksMay 1, 20260 citations

Quantum phase estimation based algorithms for machine learning

Oumayma Ouedrhiri, Oumayma Banouar, Salah El Hadaj +1 more

Quantum computing is certainly one of the greatest advances in the computer science field. Thanks to the parallelism and entanglement properties, it has proved to offer several advantages compared to the classical algorithms especially in the great reduction of the processing time. Quantum phase estimation (QPE) is one of the most important algorithms for quantum computing. It is known as the eigenvalue finding module for unitary operators. The Fourier transform is the key to this procedure. It has been researched and used to solve many problems such as the order finding problem, and the factoring problem. It was also applied for quantum sampling algorithms and the calculation of the eigenvalues of unitary matrices. In this paper, we study three important quantum algorithms for machine learning that use the QPE algorithm as a subroutine: the quantum principal components analysis (PCA) for data visualization, the Harrow-Hassidim-Lloyd (HHL) algorithm for solving linear systems, and the quantum singular value thresholding (SVT) for matrix completion in recommender systems. We also discuss the advantages and limits of such algorithms compared to their classical versions. Then we discuss potential ways of amelioration of such algorithms, and end with a proposed approach for further improvement.

International Informatics and Software Engineering Conference (IISEC)Dec 16, 20213 citations

Amplitude estimation without phase estimation

Yohichi Suzuki, Shumpei Uno, Rudy Raymond +3 more

Abstract This paper focuses on the quantum amplitude estimation algorithm, which is a core subroutine in quantum computation for various applications. The conventional approach for amplitude estimation is to use the phase estimation algorithm, which consists of many controlled amplification operations followed by a quantum Fourier transform. However, the whole procedure is hard to implement with current and near-term quantum computers. In this paper, we propose a quantum amplitude estimation algorithm without the use of expensive controlled operations; the key idea is to utilize the maximum likelihood estimation based on the combined measurement data produced from quantum circuits with different numbers of amplitude amplification operations. Numerical simulations we conducted demonstrate that our algorithm asymptotically achieves nearly the optimal quantum speedup with a reasonable circuit length.

arXiv:1904.10246Quantum Information ProcessingJan 9, 2020249 citations

Algorithms Using Quantum Fourier Transform

Robert Hundt

The quantum Fourier transform is another fundamental quantum algorithm. The section begins with a simple phase-kick circuit and expands to quantum phase estimation before detailing the quantum Fourier transform itself. A short section on arithmetic in the quantum domain introduces techniques that are used in a final detailed section on Shor’s famous algorithm for number factorization.

Cambridge University Press eBooksNov 20, 20250 citations

Phase estimation and order finding using the quantum fourier transform

Jordi Pérez-Guijarro

Quantum computing over the past few decades has experienced a huge boost, due in part to the discovery of algorithms such as the Shor's algorithm which promises a significant reduction in complexity compared to its analogues of classical computing. The main objective of this thesis is to introduce improvements in some algorithms based on the quantum Fourier transform, more specifically in the phase estimation algorithm and the order-finding algorithm. In addition to this, the problem of efficient generation of quantum states is also studied, where as a result a method has been developed for the efficient generation of quantum states.

Jul 1, 20200 citations