Optimizing the Phase Estimation Algorithm Applied to the Quantum Simulation of Heisenberg-Type Hamiltonians
arXiv:2105.05018
Abstract
The phase estimation algorithm is a powerful quantum algorithm with applications in cryptography, number theory, and simulation of quantum systems. We use this algorithm to simulate the time evolution of a system of two spin-1/2 particles under a Heisenberg Hamiltonian. The evolution is performed through both classical simulations of quantum computers and real quantum computers via IBM's Qiskit platform. We also introduce three optimizations to the algorithm: circular, iterative, and Bayesian. We apply these optimizations to our simulations and investigate how the performance improves. We also discuss the paradigms of iterative and update-based algorithms, which are attributes of these optimizations that can improve quantum algorithms generally.
arXiv comment9 pages, 5 figures. Undergraduate thesis
References in corpus (10)
- Quantum Simulation
- A Quantum Engineer's Guide to Superconducting Qubits
- Quantum algorithms: an overview
- Universal digital quantum simulation with trapped ions
- Semiclassical Fourier Transform for Quantum Computation
- Experimental realisation of Shor's quantum factoring algorithm using qubit recycling
- Efficient Bayesian Phase Estimation
- Experimental Bayesian Quantum Phase Estimation on a Silicon Photonic Chip
- Analog quantum chemistry simulation
- Optimizing quantum phase estimation for the simulation of Hamiltonian eigenstates