On the construction of model Hamiltonians for adiabatic quantum computation and its application to finding low energy conformations of lattice protein models

Abstract

In this report, we explore the use of a quantum optimization algorithm for obtaining low energy conformations of protein models. We discuss mappings between protein models and optimization variables, which are in turn mapped to a system of coupled quantum bits. General strategies are given for constructing Hamiltonians to be used to solve optimization problems of physical/chemical/biological interest via quantum computation by adiabatic evolution. As an example, we implement the Hamiltonian corresponding to the Hydrophobic-Polar (HP) model for protein folding. Furthermore, we present an approach to reduce the resulting Hamiltonian to two-body terms gearing towards an experimental realization.

35 pages, 8 figures

References in corpus (8)

• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• The Physical Implementation of Quantum Computation
• A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
• Simulated Quantum Computation of Molecular Energies
• 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 Growth-based Optimization Algorithm for Lattice Heteropolymers
• Scalable Superconducting Architecture for Adiabatic Quantum Computation

Cited by in corpus (50)

• Noisy intermediate-scale quantum (NISQ) algorithms
• Quantum computational chemistry
• Quantum walks: a comprehensive review
• Simulating chemistry using quantum computers
• The prospects of quantum computing in computational molecular biology
• Resource-Efficient Quantum Algorithm for Protein Folding
• Quantum Computation Based on Quantum Adiabatic Bifurcations of Kerr-Nonlinear Parametric Oscillators
• Bayesian Network Structure Learning Using Quantum Annealing
• Biology and medicine in the landscape of quantum advantages
• Adiabatic state preparation study of methylene
• A Quantum Annealing Approach for Fault Detection and Diagnosis of Graph-Based Systems
• Circuit design for multi-body interactions in superconducting quantum annealing system with applications to a scalable architecture
• Digitized-Counterdiabatic Quantum Algorithm for Protein Folding
• Basic Elements for Simulations of Standard Model Physics with Quantum Annealers: Multigrid and Clock States
• Ground State Spin Logic
• QFold: Quantum Walks and Deep Learning to Solve Protein Folding
• Benchmarking of Different Optimizers in the Variational Quantum Algorithms for Applications in Quantum Chemistry
• Introduction to Quantum Algorithms for Physics and Chemistry
• Readiness of Quantum Optimization Machines for Industrial Applications
• A quantum alternating operator ansatz with hard and soft constraints for lattice protein folding
• Construction of Energy Functions for Lattice Heteropolymer Models: A Case Study in Constraint Satisfaction Programming and Adiabatic Quantum Optimization
• Resource Efficient Gadgets for Compiling Adiabatic Quantum Optimization Problems
• Exact representations of many body interactions with RBM neural networks
• Coarse-grained lattice protein folding on a quantum annealer
• Using the J1-J2 Quantum Spin Chain as an Adiabatic Quantum Data Bus
• Native three-body interaction in superconducting circuits
• Adiabatic Quantum Optimization for Associative Memory Recall
• Quantum-assisted biomolecular modelling
• Quadratization in discrete optimization and quantum mechanics
• The prospects of Monte Carlo antibody loop modelling on a fault-tolerant quantum computer
• Resource analysis of quantum algorithms for coarse-grained protein folding models
• Scalable universal holonomic quantum computation realized with an adiabatic quantum data bus and potential implementation using superconducting flux qubits
• Using continuation methods to analyse the difficulty of problems solved by Ising machines
• Simulated Quantum Computation of Global Minima
• Improving Schrödinger Equation Implementations with Gray Code for Adiabatic Quantum Computers
• An approach to solve the coarse-grained Protein folding problem in a Quantum Computer
• The superconducting circuit companion -- an introduction with worked examples
• Performance Models for Split-execution Computing Systems
• Asymmetric environment induces protein-like relaxation in spin chain
• Investigating the potential for a limited quantum speedup on protein lattice problems
• Mapping NP-Hard Problems to Restricted Adiabatic Quantum Architectures
• Bayesian Networks based Hybrid Quantum-Classical Machine Learning Approach to Elucidate Gene Regulatory Pathways
• On The Study Of Partial Qubit Hamiltonian For Efficient Molecular Simulation Using Variational Quantum Eigensolvers
• Subsampling Factorization Machine Annealing
• Classical Simulation of Quantum Adiabatic Algorithms using Mathematica on GPUs
• Finding high-order Hadamard matrices by using quantum computers
• Two-dimensional quantum central limit theorem by quantum walks
• Folding lattice proteins with quantum annealing
• Exploring Quantum Annealing for Coarse-Grained Protein Folding
• Finding Hadamard matrices by a quantum annealing machine