Adiabatic Quantum Simulation of Quantum Chemistry

Abstract

We show how to apply the quantum adiabatic algorithm directly to the quantum computation of molecular properties. We describe a procedure to map electronic structure Hamiltonians to 2-local qubit Hamiltonians with a small set of physically realizable couplings. By combining the Bravyi-Kitaev construction to map fermions to qubits with perturbative gadgets to reduce the Hamiltonian to 2-local, we obtain precision requirements on the coupling strengths and a number of ancilla qubits that scale polynomially in the problem size. Hence our mapping is efficient. The required set of controllable interactions includes only two types of interaction beyond the Ising interactions required to apply the quantum adiabatic algorithm to combinatorial optimization problems. Our mapping may also be of interest to chemists directly as it defines a dictionary from electronic structure to spin Hamiltonians with physical interactions.

31 pages, 7 figures

References in corpus (80)

• A variational eigenvalue solver on a quantum processor
• A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
• Simulated Quantum Computation of Molecular Energies
• Quantum Simulation of Antiferromagnetic Spin Chains in an Optical Lattice
• A Rydberg Quantum Simulator
• Exponential algorithmic speedup by quantum walk
• Quantum annealing with more than one hundred qubits
• Towards Quantum Chemistry on a Quantum Computer
• Efficient quantum algorithms for simulating sparse Hamiltonians
• Quantum Search by Local Adiabatic Evolution
• The Bravyi-Kitaev transformation for quantum computation of electronic structure
• Polynomial-time quantum algorithm for the simulation of chemical dynamics
• Simulating Physical Phenomena by Quantum Networks
• Simulating chemistry using quantum computers
• Gate count estimates for performing quantum chemistry on small quantum computers
• Experimental Investigation of an Eight Qubit Unit Cell in a Superconducting Optimization Processor
• Computational Complexity of interacting electrons and fundamental limitations of Density Functional Theory
• From transistor to trapped-ion computers for quantum chemistry
• Mapping local Hamiltonians of fermions to local Hamiltonians of spins
• Error corrected quantum annealing with hundreds of qubits
• Experimental Demonstration of a Robust and Scalable Flux Qubit
• Realizable Hamiltonians for Universal Adiabatic Quantum Computers
• Quantum simulation of the wavefunction to probe frustrated Heisenberg spin systems
• Higher Order Decompositions of Ordered Operator Exponentials
• Simulating chemistry efficiently on fault-tolerant quantum computers
• Trapped-Ion Quantum Simulator: Experimental Application to Nonlinear Interferometers
• Exploiting locality in quantum computation for quantum chemistry
• Sign- and magnitude-tunable coupler for superconducting flux qubits
• Non-perturbative k-body to two-body commuting conversion Hamiltonians and embedding problem instances into Ising spins
• A scalable readout system for a superconducting adiabatic quantum optimization system
• Efficient Quantum Circuits for Diagonal Unitaries Without Ancillas
• Quantum Algorithm for Obtaining the Energy Spectrum of Molecular Systems
• The performance of the quantum adiabatic algorithm on random instances of two optimization problems on regular hypergraphs
• Adiabatic quantum algorithm for search engine ranking
• Experimental determination of Ramsey numbers
• Simulation of Many-Body Hamiltonians using Perturbation Theory with Bounded-Strength Interactions
• A Compound Josephson Junction Coupler for Flux Qubits With Minimal Crosstalk
• Perturbative Gadgets at Arbitrary Orders
• Adiabatic Quantum Computing for Random Satisfiability Problems
• Probing Noise in Flux Qubits via Macroscopic Resonant Tunneling
• Adiabatic state preparation study of methylene
• Simulation of chemical reaction dynamics on an NMR quantum computer
• Training a Binary Classifier with the Quantum Adiabatic Algorithm
• Experimental Performance of a Quantum Simulator: Optimizing Adiabatic Evolution and Identifying Many-Body Ground States
• Geometrical dependence of low frequency noise in superconducting flux qubits
• Computational Complexity in Electronic Structure
• Quantum-circuit design for efficient simulations of many-body quantum dynamics
• Solving Quantum Ground-State Problems with Nuclear Magnetic Resonance
• A new construction for a QMA complete 3-local Hamiltonian
• Quantum computing applied to calculations of molecular energies: CH2 benchmark
• MAX 2-SAT with up to 108 qubits
• Training a Large Scale Classifier with the Quantum Adiabatic Algorithm
• Necessary Condition for the Quantum Adiabatic Approximation
• Adiabatic Quantum Simulators
• A Near-Term Quantum Computing Approach for Hard Computational Problems in Space Exploration
• Preparation of many-body states for quantum simulation
• Quantum Simulation of the Haldane Phase Using Trapped Ions
• Adiabatic Quantum Algorithms for the NP-Complete Maximum-Weight Independent Set, Exact Cover and 3SAT Problems
• Hybrid 2D surface trap for quantum simulation
• Tunneling spectroscopy using a probe qubit
• Construction of Energy Functions for Lattice Heteropolymer Models: A Case Study in Constraint Satisfaction Programming and Adiabatic Quantum Optimization
• Landau-Zener Transitions in an Adiabatic Quantum Computer
• Resource Efficient Gadgets for Compiling Adiabatic Quantum Optimization Problems
• Adiabatic quantum search algorithm for structured problems
• Fast Universal Quantum Computation with Railroad-switch Local Hamiltonians
• Robust Classification with Adiabatic Quantum Optimization
• Comment on: "Classical signature of quantum annealing"
• Spin-free quantum computational simulations and symmetry adapted states
• Quantum Algorithms for Quantum Chemistry based on the sparsity of the CI-matrix
• The Bose-Hubbard model is QMA-complete
• Synchronization of Multiple Coupled rf-SQUID Flux Qubits
• The complexity of quantum spin systems on a two-dimensional square lattice
• Quantum 3-SAT is QMA1-complete
• Cold Rydberg atoms for quantum simulation of exotic condensed matter interactions
• Implementation of a Quantum Annealing Algorithm Using a Superconducting Circuit
• Classical and Quantum Annealing in the Median of Three Satisfiability
• Construction of non-convex polynomial loss functions for training a binary classifier with quantum annealing
• Nuclear-resonant electron scattering
• Photonic quantum simulation of ground state configurations of Heisenberg square and checkerboard lattice spin systems
• Efficient Algorithms for Universal Quantum Simulation

Cited by in corpus (99)

• The theory of variational hybrid quantum-classical algorithms
• Noisy intermediate-scale quantum (NISQ) algorithms
• Quantum computational chemistry
• Adiabatic Quantum Computing
• Quantum Chemistry in the Age of Quantum Computing
• Quantum information processing with superconducting circuits: a review
• Scalable Quantum Simulation of Molecular Energies
• Simulating Hamiltonian dynamics with a truncated Taylor series
• Perspectives of quantum annealing: Methods and implementations
• Digitized adiabatic quantum computing with a superconducting circuit
• Quantum chemistry calculations on a trapped-ion quantum simulator
• Quantum Simulation of Electronic Structure with Linear Depth and Connectivity
• Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity
• Quantum simulation and computing with Rydberg-interacting qubits
• Observation of topological phenomena in a programmable lattice of 1,800 qubits
• Low Depth Quantum Simulation of Electronic Structure
• A case study in programming a quantum annealer for hard operational planning problems
• Chemical Basis of Trotter-Suzuki Errors in Quantum Chemistry Simulation
• Tapering off qubits to simulate fermionic Hamiltonians
• Emerging quantum computing algorithms for quantum chemistry
• Low rank representations for quantum simulation of electronic structure
• Quantum annealing with a network of all-to-all connected, two-photon driven Kerr nonlinear oscillators
• A quantum algorithm for evolving open quantum dynamics on quantum computing devices
• Quantum Machine Learning for Electronic Structure Calculations
• Exponentially more precise quantum simulation of fermions I: Quantum chemistry in second quantization
• Gate-efficient simulation of molecular eigenstates on a quantum computer
• Exploiting locality in quantum computation for quantum chemistry
• Fault-Tolerant Quantum Simulations of Chemistry in First Quantization
• Lowering qubit requirements for quantum simulations of fermionic systems
• Fast multi-qubit gates by adiabatic evolution in interacting excited state manifolds
• Exponentially More Precise Quantum Simulation of Fermions in the Configuration Interaction Representation
• Adiabatic state preparation study of methylene
• Local spin operators for fermion simulations
• Entanglement spectroscopy on a quantum computer
• Benchmark of quantum-inspired heuristic solvers for quadratic unconstrained binary optimization
• Demonstration of nonstoquastic Hamiltonian in coupled superconducting flux qubits
• Quantum inverse iteration algorithm for programmable quantum simulators
• Optimizing qubit resources for quantum chemistry simulations in second quantization on a quantum computer
• Hamiltonian simulation with random inputs
• Quantum Simulation of Resonant Transitions for Solving the Eigen-problem of an Effective Water Hamiltonian
• Electronic structure with direct diagonalization on a D-Wave quantum annealer
• Demonstration of tunable three-body interactions between superconducting qubits
• Quantum-centric computation of molecular excited states with extended sample-based quantum diagonalization
• Linear and logarithmic time compositions of quantum many-body operators
• Analog Nature of Quantum Adiabatic Unstructured Search
• Digital-Analog Quantum Simulations Using The Cross-Resonance Effect
• Variationally Scheduled Quantum Simulation
• Superconducting Circuit Architecture for Digital-Analog Quantum Computing
• Quantum Algorithms for Quantum Chemistry based on the sparsity of the CI-matrix
• Low-depth Hamiltonian Simulation by Adaptive Product Formula
• Quantum chemistry and charge transport in biomolecules with superconducting circuits
• Quantum Simulation of 2D Quantum Chemistry in Optical Lattices
• A Quantum Annealing Approach for Dynamic Multi-Depot Capacitated Vehicle Routing Problem
• Efficient Two-Electron Ansatz for Benchmarking Quantum Chemistry on a Quantum Computer
• Using Quantum Annealers to Calculate Ground State Properties of Molecules
• Simulation of adiabatic quantum computing for molecular ground states
• Discovering optimal fermion-qubit mappings through algorithmic enumeration
• Adiabatic quantum simulations with driven superconducting qubits
• Simulating highly nonlocal Hamiltonians with less nonlocal Hamiltonians
• Variational quantum iterative power algorithms for global optimization
• Superconducting qubit circuit emulation of a vector spin-1/2
• Incoherent quantum algorithm dynamics of an open system with near-term devices
• Quantum annealing with twisted fields
• VanQver: The Variational and Adiabatically Navigated Quantum Eigensolver
• Non-Adiabatic Quantum Dynamics of Grover's Adiabatic Search Algorithm
• Eigenstates Transition Without Undergoing an Adiabatic Process
• Quantum Simulation of a Quantum Stochastic Walk
• Oscillating potential well in complex plane and the adiabatic theorem
• Exploiting anticommutation in Hamiltonian simulation
• Practicality of quantum adiabatic algorithm for chemistry applications
• A Quantum Annealing Protocol to Solve the Nuclear Shell Model
• First-quantized adiabatic time evolution for the ground state of a many-electron system and the optimal nuclear configuration
• Excited state search using quantum annealing
• Quantum annealing with pairs of ${}^2\Sigma$ molecules as qubits
• How to experimentally evaluate the adiabatic condition for quantum annealing
• A Full Quantum Eigensolver for Quantum Chemistry Simulations
• Ladder Operator Block-Encoding
• Geometric quantum adiabatic methods for quantum chemistry
• Counterdiabatic driving for long-lived singlet state preparation
• Quantum annealing of Cayley-tree Ising spins at small scales
• Quantum walk processes in quantum devices
• Quantum Zeno approach for molecular energies with maximum commuting initialHamiltonians
• Efficient optimization of perturbative gadgets
• Error-run-time trade-off in the adiabatic approximation beyond scaling relations
• Development of research network on Quantum Annealing Computation and Information using Google Scholar data
• Quantum Annealing for Semi-Supervised Learning
• Suppressing classical noise in the accelerated geometric phase gate by optimized dynamical decoupling
• Time-resolved tomography of a driven adiabatic quantum simulation
• Full-counting statistics of particle distribution on a digital quantum computer
• Mapping NP-Hard Problems to Restricted Adiabatic Quantum Architectures
• Quantum Simulation of Molecules without Fermionic Encoding of the Wave Function
• Adaptive random compiler for Hamiltonian simulation
• Error Interference in Quantum Simulation
• 2D implementation of quantum annealing algorisms for fourth order binary optimization problems
• Fluctuation-guided adaptive random compiler for Hamiltonian simulation
• Degeneracy Engineering for Classical and Quantum Annealing: A Case Study of Sparse Linear Regression in Collider Physics
• Reply to "Comment on "Quantum Time Crystals from Hamiltonians with Long-Range Interactions""
• Topological and geometric patterns in optimal bang-bang protocols for variational quantum algorithms: application to the $XXZ$ model on the square lattice
• Solving Helmholtz problems with finite elements on a quantum annealer