Efficient and Accurate Electronic Structure Simulation Demonstrated on a Trapped-Ion Quantum Computer
By Yukio Kawashima, Marc P. Coons, Yunseong Nam, Erika Lloyd, Shunji Matsuura, Alejandro J. Garza, Sonika Johri, Lee Huntington, Valentin Senicourt, Andrii O. Maksymov, Jason H. V. Nguyen, Jungsang Kim, Nima Alidoust, Arman Zaribafiyan, & Takeshi Yamazaki
Quantum computers have the potential to perform accurate and efficient electronic structure calculations, enabling the simulation of properties of materials. However, today’s noisy, intermediate-scale quantum (NISQ) devices have a limited number of qubits and gate operations due to the presence of errors. Here, we propose a systematically improvable end-to-end pipeline to alleviate these limitations. Our proposed resource-efficient pipeline combines problem decomposition techniques for compact molecular representations, circuit optimization methods for compilation, solving the eigenvalue problem on advanced quantum hardware, and error-mitigation techniques in post-processing the results. Using the density matrix embedding theory for compact representation, and an ion-trap quantum computer, we simulate a ring of 10 hydrogen atoms taking into account all electrons equally and explicitly in the electronic structure calculation. In our experiment, we simulated the largest molecular system on a quantum computer within chemical accuracy with respect to total molecular energy calculated by the full CI method. Our methods reduce the number of qubits required for high-accuracy quantum simulations by an order of magnitude in the present work, enabling the simulation of larger, more industrially relevant molecules using NISQ devices. They are further systematically improvable as devices’ computational capacity continues to grow.
PDF ARXIV PREPRINT
Most Recent Papers
Scaling Overhead of Locality Reduction in Binary Optimization Problems
By Elisabetta Valiante, Maritza Hernandez, Amin Barzegar, & Helmut G. Katzgraber Recently, there has been considerable interest in solving optimization problems by mapping these onto a binary representation, sparked mostly by the use of quantum annealing machines....
Quantum Multiple Kernel Learning
By Seyed Shakib Vedaie, Moslem Noori, Jaspreet S. Oberoi, Barry C. Sanders, & Ehsan Zahedinejad Kernel methods play an important role in machine learning applications due to their conceptual simplicity and superior performance on numerous machine learning tasks....
Quantum Annealing Approaches to the Phase-Unwrapping Problem in Synthetic-Aperture Radar Imaging
By Khaled A. Helal Kelany, Nikitas Dimopoulos, Clemens P. J. Adolphs, Bardia Barabadi, & Amirali Baniasadi The focus of this work is to explore the use of quantum annealing solvers for the problem of phase unwrapping of synthetic aperture radar (SAR) images....
Finding the Ground State of Spin Hamiltonians with Reinforcement Learning
By Kyle Mills, Pooya Ronagh, & Isaac Tamblyn Reinforcement learning (RL) has become a proven method for optimizing a procedure for which success has been defined, but the specific actions needed to achieve it have not. Using a method we call "controlled online...
Quantum Algorithms for Solving Dynamic Programming Problems
By Pooya RonaghWe present a general quantum algorithm for solving finite-horizon dynamic programming problems. Up to polylogarithmic factors, our algorithm provides a quadratic quantum advantage in terms of the number of states of a given dynamic programming problem....