Adiabatic state preparation from general initial states

Abstract

A variety of quantum computing algorithms exist for the preparation of approximate Hamiltonian ground states. A natural and important question is how these ground-state approximations can be further improved using adiabatic state preparation. Here, we present a heuristic method to carry out adiabatic state preparation starting from a generic initial wavefunction. Given a quantum circuit that prepares the initial wavefunction, and a target Hamiltonian for which one wishes to prepare the ground state, we present an algorithm to construct an adiabatic path between these two states. This method works by approximating a parent Hamiltonian for the initial wavefunction, and the quality of this approximation can be can be checked prior to running the ASP algorithm. We apply this technique to simulate the ground state of water and the lowest-lying multireference singlet state of methylene, using various initial wavefunctions as the starting point of the adiabatic path.

18 pages, 3 figures

References in corpus (30)

• Variational Quantum Algorithms
• Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
• A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
• Quantum computational chemistry
• Adiabatic Quantum Computing
• Quantum Chemistry in the Age of Quantum Computing
• Simulated Quantum Computation of Molecular Energies
• Recent developments in the PySCF program package
• Quantum algorithms for quantum chemistry and quantum materials science
• Hartree-Fock on a superconducting qubit quantum computer
• The Bravyi-Kitaev transformation for quantum computation of electronic structure
• Quantum Computation of Electronic Transitions using a Variational Quantum Eigensolver
• Measurement Optimization in the Variational Quantum Eigensolver Using a Minimum Clique Cover
• Is there evidence for exponential quantum advantage in quantum chemistry?
• Unbiasing Fermionic Quantum Monte Carlo with a Quantum Computer
• Consistency of the Adiabatic Theorem
• Determining a local Hamiltonian from a single eigenstate
• Large Classes of Quantum Scarred Hamiltonians from Matrix Product States
• Quantum Power Method by a Superposition of Time-Evolved States
• Real time evolution for ultracompact Hamiltonian eigenstates on quantum hardware
• Adiabatic state preparation study of methylene
• Orbital-optimized pair-correlated electron simulations on trapped-ion quantum computers
• Exact and efficient Lanczos method on a quantum computer
• Quantum Filter Diagonalization with Double-Factorized Hamiltonians
• Quantum chemistry simulation of ground- and excited-state properties of the sulfonium cation on a superconducting quantum processor
• Folded Spectrum VQE : A quantum computing method for the calculation of molecular excited states
• Hierarchical Clifford transformations to reduce entanglement in quantum chemistry wavefunctions
• Analysis of quantum Krylov algorithms with errors
• Sampling Error Analysis in Quantum Krylov Subspace Diagonalization
• Practical Benchmarking of Randomized Measurement Methods for Quantum Chemistry Hamiltonians