Direct Application of the Phase Estimation Algorithm to Find the Eigenvalues of the Hamiltonians

03/10/2017
by   Ammar Daskin, et al.
0

The eigenvalue of a Hamiltonian, H, can be estimated through the phase estimation algorithm given the matrix exponential of the Hamiltonian, exp(-iH). The difficulty of this exponentiation impedes the applications of the phase estimation algorithm particularly when H is composed of non-commuting terms. In this paper, we present a method to use the Hamiltonian matrix directly in the phase estimation algorithm by using an ancilla based framework: In this framework, we also show how to find the power of the Hamiltonian matrix-which is necessary in the phase estimation algorithm-through the successive applications. This may eliminate the necessity of matrix exponential for the phase estimation algorithm and therefore provide an efficient way to estimate the eigenvalues of particular Hamiltonians. The classical and quantum algorithmic complexities of the framework are analyzed for the Hamiltonians which can be written as a sum of simple unitary matrices and shown that a Hamiltonian of order 2^n written as a sum of L number of simple terms can be used in the phase estimation algorithm with (n+1+logL) number of qubits and O(2^anL) number of quantum operations, where a is the number of iterations in the phase estimation. In addition, we use the Hamiltonian of the hydrogen molecule as an example system and present the simulation results for finding its ground state energy.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/22/2021

A randomized quantum algorithm for statistical phase estimation

Phase estimation is a quantum algorithm for measuring the eigenvalues of...
research
01/29/2018

A Generalized Circuit for the Hamiltonian Dynamics Through the Truncated Series

In this paper, we present a fixed-quantum circuit design for the simulat...
research
10/07/2019

Spectral sparsification of matrix inputs as a preprocessing step for quantum algorithms

We study the potential utility of classical techniques of spectral spars...
research
06/16/2023

Matrix Diagonalization as a Board Game: Teaching an Eigensolver the Fastest Path to Solution

Matrix diagonalization is at the cornerstone of numerous fields of scien...
research
10/28/2019

On skew-Hamiltonian Matrices and their Krylov-Lagrangian Subspaces

It is a well-known fact that the Krylov space K_j(H,x) generated by a sk...
research
04/18/2020

Effective gaps are not effective: quasipolynomial classical simulation of obstructed stoquastic Hamiltonians

All known examples confirming the possibility of an exponential separati...

Please sign up or login with your details

Forgot password? Click here to reset