Quantum Simulations of Chemistry in First Quantization with any Basis Set

Abstract

Quantum computation of the energy of molecules and materials is one of the most promising applications of fault-tolerant quantum computers. Practical applications require development of quantum algorithms with reduced resource requirements. Previous work has mainly focused on quantum algorithms where the Hamiltonian is represented in second quantization with compact basis sets while existing methods in first quantization are limited to a grid-based basis. In this work, we present a new method to solve the generic ground-state chemistry problem in first quantization using any basis set. We achieve asymptotic speedup in Toffoli count for molecular orbitals, and orders of magnitude improvement using dual plane waves as compared to the second quantization counterparts. In some instances, our approach provides similar or even lower resources compared to previous first quantization plane wave algorithms that, unlike our approach, avoids the loading of the classical data. The developed methodology can be applied to variety of applications, where the matrix elements of a first quantized Hamiltonian lack simple circuit representation.

Added more detailed comparison with previous pw algo

References in corpus (13)

• Surface codes: Towards practical large-scale quantum computation
• Simulated Quantum Computation of Molecular Energies
• Polynomial-time quantum algorithm for the simulation of chemical dynamics
• Low-energy spectrum of iron-sulfur clusters directly from many-particle quantum mechanics
• GPAW: An open Python package for electronic-structure calculations
• Novel constructions for the fault-tolerant Toffoli gate
• Construction and solution of a Wannier-functions based Hamiltonian in the pseudopotential plane-wave framework for strongly correlated materials
• How to verify the precision of density-functional-theory implementations via reproducible and universal workflows
• Distilling one-qubit magic states into Toffoli states
• Reducing the runtime of fault-tolerant quantum simulations in chemistry through symmetry-compressed double factorization
• Quantum Simulation of Realistic Materials in First Quantization Using Non-local Pseudopotentials
• Pauli Decomposition via the Fast Walsh-Hadamard Transform
• Refining resource estimation for the quantum computation of vibrational molecular spectra through Trotter error analysis

Cited by in corpus (12)

• Unlocking early fault-tolerant quantum computing with mitigated magic dilution
• Quantum Computation of Electronic Structure with Projector Augmented-Wave Method and Plane Wave Basis Set
• Reducing Circuit Depth in Quantum State Preparation for Quantum Simulation Using Measurements and Feedforward
• The Electronic Structure of the Hydrogen Molecule: A Tutorial Exercise in Classical and Quantum Computation
• Fault-tolerant quantum simulation of generalized Hubbard models
• Scalable Quantum Computational Science: A Perspective from Block-Encodings and Polynomial Transformations
• Chemically Motivated Simulation Problems are Efficiently Solvable by a Quantum Computer
• Quantum-inspired dynamical models on quantum and classical annealers
• Optimizing Quantum Chemistry Simulations with a Hybrid Quantization Scheme
• Benchmarking Quantum Simulation of Chemical Hamiltonians using the Sorted-List Encoding
• Quantum Simulation of Nuclear Dynamics in First Quantization
• Quantum-Classical Computing for Time-Dependent Ion-Atom Collision Dynamics: Applications to Charge Transfer Cross Section Simulations