Construction of Energy Functions for Lattice Heteropolymer Models: A Case Study in Constraint Satisfaction Programming and Adiabatic Quantum Optimization

TL;DR

This paper discusses how to formulate lattice heteropolymer energy problems as constraint satisfaction problems, enabling their solution via classical and quantum optimization methods, including quantum annealing.

Contribution

It introduces strategies for encoding heteropolymer problems into constraint satisfaction frameworks and reduces their couplings for quantum annealing implementation.

Findings

Multiple encoding strategies balancing constraints and variables.

Reduction of coupling locality for quantum hardware compatibility.

Framework for applying quantum optimization to polymer problems.

Abstract

Optimization problems associated with the interaction of linked particles are at the heart of polymer science, protein folding and other important problems in the physical sciences. In this review we explain how to recast these problems as constraint satisfaction problems such as linear programming, maximum satisfiability, and pseudo-boolean optimization. By encoding problems this way, one can leverage substantial insight and powerful solvers from the computer science community which studies constraint programming for diverse applications such as logistics, scheduling, artificial intelligence, and circuit design. We demonstrate how to constrain and embed lattice heteropolymer problems using several strategies. Each strikes a unique balance between number of constraints, complexity of constraints, and number of variables. Finally, we show how to reduce the locality of couplings in these energy functions so they can be realized as Hamiltonians on existing quantum annealing machines. We intend that this review be used as a case study for encoding related combinatorial optimization problems in a form suitable for adiabatic quantum optimization.