Direct Application of the Phase Estimation Algorithm to Find the Eigenvalues of the Hamiltonians
arXiv:1703.03597 · doi:10.1016/j.chemphys.2018.01.002
Abstract
The eigenvalue of a Hamiltonian, , can be estimated through the phase estimation algorithm given the matrix exponential of the Hamiltonian, . The difficulty of this exponentiation impedes the applications of the phase estimation algorithm particularly when 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 written as a sum of number of simple terms can be used in the phase estimation algorithm with number of qubits and number of quantum operations, where 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.
arXiv comment10 pages, 3 figures
References in corpus (19)
- Quantum Amplitude Amplification and Estimation
- Computational complexity and fundamental limitations to fermionic quantum Monte Carlo simulations
- Real-time dynamics of lattice gauge theories with a few-qubit quantum computer
- Towards Quantum Chemistry on a Quantum Computer
- Simulating Hamiltonian dynamics with a truncated Taylor series
- Quantum computers can search rapidly by using almost any transformation
- The Bravyi-Kitaev transformation for quantum computation of electronic structure
- Simulation of Electronic Structure Hamiltonians Using Quantum Computers
- Digitized adiabatic quantum computing with a superconducting circuit
- Quantum Circuits for General Multiqubit Gates
- Efficient decomposition of quantum gates
- Exponential improvement in precision for simulating sparse Hamiltonians
- Asymptotically Optimal Quantum Circuits for d-level Systems
- Quantum Simulation of the Hubbard Model with Dopant Atoms in Silicon
- Engineering of arbitrary U(N) transformations by quantum Householder reflections
- Universal Programmable Quantum Circuit Schemes to Emulate an Operator
- A Universal Quantum Circuit Scheme For Finding Complex Eigenvalues
- Repeat-Until-Success: Non-deterministic decomposition of single-qubit unitaries
- An Ancilla Based Quantum Simulation Framework for Non-Unitary Matrices
Cited by in corpus (11)
- Quantum Machine Learning for Electronic Structure Calculations
- Quantum Machine-Learning for Eigenstate Filtration in Two-Dimensional Materials
- Hybrid quantum-classical neural network for calculating ground state energies of molecules
- Quantum computing methods for electronic states of the water molecule
- Quantum Computing for Atomic and Molecular Resonances
- Statistical Approach to Quantum Phase Estimation
- Variational quantum eigensolver with embedded entanglement using a tensor-network ansatz
- A Generalized Circuit for the Hamiltonian Dynamics Through the Truncated Series
- Quantum Spectral Clustering through a Biased Phase Estimation Algorithm
- Some Error Analysis for the Quantum Phase Estimation Algorithms
- Context aware quantum simulation of a matrix stored in quantum memory