2021/05/07 by Scott Johnstun, Johnstun, Scott, Jean-François Van Huele +1
Computer Science · Engineering · Mathematics · Physics and Astronomy · #Algorithm #Applied mathematics #Computer science #Engineering #Estimation #FOS: Physical sciences #Mathematics #Phase (matter) #Physics #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Physics (quant-ph) #Quantum many-body systems #Quantum mechanics #Statistical physics #quant-ph
paper · pdf · doi:10.48550/arxiv.2105.05018
published in arXiv (Cornell University) (Cornell University) · 9 pages, 5 figures. Undergraduate thesis
arxiv created 2021/05/07 · openalex publication_date 2021/05/07 · arxiv updated 2021/05/12 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.