Computational Chemistry on Quantum Computers
Jerimiah Wright

TL;DR
This paper explores quantum computational techniques for simulating molecular Hamiltonians, focusing on the creation, measurement, and analysis of small molecules like H2 and He2 using algorithms such as LCAO, LCU, and PEA.
Contribution
It demonstrates the application of quantum algorithms to molecular Hamiltonians, highlighting the challenges with Hamiltonian size and the effectiveness of low-order expansions.
Findings
Hamiltonian size increases with molecule complexity
Low-order expansions suffice for qualitative analysis
Measurement resolution depends on the number of quantum registers
Abstract
The purpose of this experiment was to use the known analytical techniques to study the creation, simulation, and measurements of molecular Hamiltonians. The techniques used consisted of the Linear Combination of Atomic Orbitals (LCAO), the Linear Combination of Unitaries (LCU), and the Phase Estimation Algorithm (PEA). The molecules studied were with and without spin, as well as without spin. Hamiltonians were created under the LCAO basis, and reconstructed using the Jordan-Winger transform in order to create a linear combination of Pauli spin operators. The lengths of each molecular Hamiltonian greatly increased from the without spin, to . This resulted in a reduced ability to simulate the Hamiltonians under ideal conditions. Thus, only low orders of l = 1 and l = 2 were used when expanding the Hamiltonian in accordance to the LCU method of simulation. The…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCryptography and Data Security · Complexity and Algorithms in Graphs · Quantum Computing Algorithms and Architecture
