Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1211.3422 · Advances in chemical physics

Construction of Energy Functions for Lattice Heteropolymer Models: Efficient Encodings for Constraint Satisfaction Programming and Quantum Annealing

Ryan Babbush, Alejandro Perdomo‐Ortiz, Bryan O'Gorman, William Macready, Alán Aspuru‐Guzik

Published Apr 4, 2014• 49 citations
arXivHTMLPDF

Abstract

This chapter presents a general construction of the free energy function for the two-dimensional lattice heteropolymer model widely used to study the dynamics of proteins. It demonstrates how to map the lattice heteropolymer problem into forms that can be solved by using different types of technology and algorithms. The embedding strategies presented here apply to many discrete optimization problems. Mapping these problems to a constraint programming problem is a three-step process. The chapter provides a brief description of the process and expands upon each step as it applies to lattice folding. It explains the “circuit” construction that provides optimal efficiency at the cost of introducing high-ordered many-body terms. Finally, the chapter demonstrates the final steps required to embed a small instance of a particular lattice protein problem into a quadratic unconstrained binary optimization (QUBO) Hamiltonian.

DOI
10.1002/9781118755815.ch05

Related papers

Construction of Energy Functions for Lattice Heteropolymer Models: Efficient Encodings for Constraint Satisfaction Programming and Quantum Annealing

Ryan Babbush, Alejandro Perdomo‐Ortiz, Bryan O’Gorman +2 more

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.

•Nov 14, 2012•3 citations

Penalty-free quantum optimization applied to lattice protein folding

Leif Gellersen, Anders Irbäck, Lucas Knuthson +1 more

Identifying minimum-energy structures of lattice proteins is a challenging discrete optimization problem. Quantum approaches such as analog quantum annealing and the gate-based quantum approximate optimization algorithm (QAOA) can address this problem after mapping it to a binary representation, which typically involves introducing penalty terms to enforce valid chain configurations. However, in this and many related problems, the use of quadratic penalty terms can be avoided by restricting the search space to independent sets in a conflict graph and using a QAOA mixer designed for the maximum independent set problem. In this work, we implement and explore this QAOA variant for lattice protein folding. Here, the objective function consists solely of the protein energy together with a simple linear bias term, without quadratic penalties. We validate this approach through classical simulations of the quantum circuits for lattice proteins of lengths $N=4$ and $N=6$. To explore larger systems, we further introduce a heuristic iterative local-search scheme, with which we successfully fold lattice proteins with lengths up to $N=14$ using local subgraphs with at most 26 qubits.

quant-pharXiv:2606.02104•Jun 2, 2026•1 citation

Folding lattice proteins confined on minimal grids using a quantum-inspired encoding

Anders Irbäck, Lucas Knuthson, Sandipan Mohanty

Steric clashes pose a challenge when exploring dense protein systems using conventional explicit-chain methods. A minimal example is a single lattice protein confined on a minimal grid, with no free sites. Finding its minimum energy is a hard optimization problem, with similarities to scheduling problems. It can be recast as a quadratic unconstrained binary optimization (QUBO) problem amenable to classical and quantum approaches. We show that this problem in its QUBO form can be swiftly and consistently solved for chain length 48, using either classical simulated annealing or hybrid quantum-classical annealing on a D-Wave system. In fact, the latter computations required about 10 s. We also test linear and quadratic programming methods, which work well for a lattice gas but struggle with chain constraints. All methods are benchmarked against exact results obtained from exhaustive structure enumeration, at a high computational cost.

arXiv:2510.01890•Physical review. E•Sep 1, 2025•13 citations

Solving lattice protein problems with quantum computing

Lucas Knuthson

Quantum computing has progressed from a theoretical concept to a practical experimental technology. By processing information according to quantum mechanics rather than classical rules, quantum computers may offer advantages for certain problems. Although a few algorithms have proven speedups, it remains unclear where quantum computers will be practically useful, especially since current devices are noisy, small, and not yet fault tolerant. This thesis explores quantum computing for biophysically motivated combinatorial problems, with a focus on lattice protein models. In these simplified models, a protein is represented as a chain on a discrete lattice. Despite their simplicity, lattice proteins retain important features of real proteins, such as such as the folding of a chain with exponentially many possible shapes to a unique minimum-energy structure and steric constraints.To run lattice protein problems on quantum hardware, they must first be formulated using binary variables and objective functions. The latter typically contain soft constraints needed to ensure physical solutions. In Papers~\I--\II, we developed and extended a coordinate-based mapping for lattice protein folding, enabling D-Wave's hybrid quantum-classical annealer to fold both $2$D hydrophobic-polar and $3$D Miyazawa-Jernigan lattice proteins. In Paper~\III, we adapted the approach to the gate-based paradigm and showed how quadratic soft constraints could be removed by a mixer developed for the maximum-independent-set problem. Papers~\IV--\V addressed lattice protein design using quantum annealing, quantum approximate optimization algorithm, quantum alternating operator ansatz and hardware-efficient ansatz, while Paper~\VI extended the framework to multi-chain thermodynamics and the reconstruction of densities of states and heat-capacity features.Together, these papers show how folding, design, and multi-chain thermodynamics can be formulated, implemented, and analyzed using present-day quantum and hybrid hardware. A recurring limitation is the treatment of soft constraints. In quantum annealing, their high connectivity leads to error accumulation. On gate-based hardware, they increase circuit depth and sensitivity to noise. At the same time, temporary constraint violations can provide useful freedom during optimization. Further progress will therefore require improved formulations, algorithms and hardware that reduce the cost of enforcing physical solutions while retaining this flexibility.

•Jan 1, 2026•0 citations

A Constraint Programming Approach for QUBO Solving and Quantum Annealing

Philippe Codognet

Quantum Annealing is an alternative type of computation in which problems are encoded in quantum Hamiltonians (energy functions) and quantum dynamics is used to find solutions (ground states of minimal energy). Quantum computers such as the D-Wave systems are indeed implementing those ideas in hardware, as well as "quantum-inspired" devices based on classical electronics such as Fujitsu’s Digital Annealing Unit. All those systems use the same modeling language: Quadratic Unconstrained Binary Optimization (QUBO). However, QUBO is a low-level language and for modeling combinatorial problems such as constraint satisfaction and constrained optimization problems, we need to introduce higher-level abstractions in order to define complex constraints.

International Conference on Art, Science, and Engineering of Programming (<Programming>)•Mar 11, 2024•2 citations

Coarse-grained lattice protein folding on a quantum annealer

Tomáš Babej, Christopher E. Ing, Mark Fingerhuth

Lattice models have been used extensively over the past thirty years to examine the principles of protein folding and design. These models can be used to determine the conformation of the lowest energy fold out of a large number of possible conformations. However, due to the size of the conformational space, new algorithms are required for folding longer proteins sequences. Preliminary work was performed by Babbush et al. (2012) to fold a small peptide on a planar lattice using a quantum annealing device. We extend this work by providing improved Ising-type Hamiltonian encodings for the problem of finding the lowest energy conformation of a lattice protein. We demonstrate a decrease in quantum circuit complexity from quadratic to quasilinear in certain cases. Additionally, we generalize to three spatial dimensions in order to obtain results with higher correlation to the actual atomistic 3D structure of the protein and outline our heuristic approach for splitting large problem instances into smaller subproblems that can be directly solved with the current D-Wave 2000Q architecture. To the best of our knowledge, this work sets a new record for lattice protein folding on a quantum annealer by folding Chignolin (10 residues) on a planar lattice and Trp-Cage (8 residues) on a cubic lattice.

arXiv:1811.00713•Nov 2, 2018•62 citations
This chapter presents a general construction of the free energy function for the two-dimensional lattice heteropolymer model widely used to study the dynamics of proteins. It demonstrates how to map the lattice heteropolymer problem into forms that can be solved by using different types of technology and algorithms. The embedding strategies presented here apply to many discrete optimization problems. Mapping these problems to a constraint programming problem is a three-step process. The chapter provides a brief description of the process and expands upon each step as it applies to lattice folding. It explains the “circuit” construction that provides optimal efficiency at the cost of introducing high-ordered many-body terms. Finally, the chapter demonstrates the final steps required to embed a small instance of a particular lattice protein problem into a quadratic unconstrained binary optimization (QUBO) Hamiltonian.
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.
Identifying minimum-energy structures of lattice proteins is a challenging discrete optimization problem. Quantum approaches such as analog quantum annealing and the gate-based quantum approximate optimization algorithm (QAOA) can address this problem after mapping it to a binary representation, which typically involves introducing penalty terms to enforce valid chain configurations. However, in this and many related problems, the use of quadratic penalty terms can be avoided by restricting the search space to independent sets in a conflict graph and using a QAOA mixer designed for the maximum independent set problem. In this work, we implement and explore this QAOA variant for lattice protein folding. Here, the objective function consists solely of the protein energy together with a simple linear bias term, without quadratic penalties. We validate this approach through classical simulations of the quantum circuits for lattice proteins of lengths N=4N=4N=4 and N=6N=6N=6. To explore larger systems, we further introduce a heuristic iterative local-search scheme, with which we successfully fold lattice proteins with lengths up to N=14N=14N=14 using local subgraphs with at most 26 qubits.
Steric clashes pose a challenge when exploring dense protein systems using conventional explicit-chain methods. A minimal example is a single lattice protein confined on a minimal grid, with no free sites. Finding its minimum energy is a hard optimization problem, with similarities to scheduling problems. It can be recast as a quadratic unconstrained binary optimization (QUBO) problem amenable to classical and quantum approaches. We show that this problem in its QUBO form can be swiftly and consistently solved for chain length 48, using either classical simulated annealing or hybrid quantum-classical annealing on a D-Wave system. In fact, the latter computations required about 10 s. We also test linear and quadratic programming methods, which work well for a lattice gas but struggle with chain constraints. All methods are benchmarked against exact results obtained from exhaustive structure enumeration, at a high computational cost.
Quantum computing has progressed from a theoretical concept to a practical experimental technology. By processing information according to quantum mechanics rather than classical rules, quantum computers may offer advantages for certain problems. Although a few algorithms have proven speedups, it remains unclear where quantum computers will be practically useful, especially since current devices are noisy, small, and not yet fault tolerant. This thesis explores quantum computing for biophysically motivated combinatorial problems, with a focus on lattice protein models. In these simplified models, a protein is represented as a chain on a discrete lattice. Despite their simplicity, lattice proteins retain important features of real proteins, such as such as the folding of a chain with exponentially many possible shapes to a unique minimum-energy structure and steric constraints.To run lattice protein problems on quantum hardware, they must first be formulated using binary variables and objective functions. The latter typically contain soft constraints needed to ensure physical solutions. In Papers~\I--\II, we developed and extended a coordinate-based mapping for lattice protein folding, enabling D-Wave's hybrid quantum-classical annealer to fold both 222D hydrophobic-polar and 333D Miyazawa-Jernigan lattice proteins. In Paper~\III, we adapted the approach to the gate-based paradigm and showed how quadratic soft constraints could be removed by a mixer developed for the maximum-independent-set problem. Papers~\IV--\V addressed lattice protein design using quantum annealing, quantum approximate optimization algorithm, quantum alternating operator ansatz and hardware-efficient ansatz, while Paper~\VI extended the framework to multi-chain thermodynamics and the reconstruction of densities of states and heat-capacity features.Together, these papers show how folding, design, and multi-chain thermodynamics can be formulated, implemented, and analyzed using present-day quantum and hybrid hardware. A recurring limitation is the treatment of soft constraints. In quantum annealing, their high connectivity leads to error accumulation. On gate-based hardware, they increase circuit depth and sensitivity to noise. At the same time, temporary constraint violations can provide useful freedom during optimization. Further progress will therefore require improved formulations, algorithms and hardware that reduce the cost of enforcing physical solutions while retaining this flexibility.
Quantum Annealing is an alternative type of computation in which problems are encoded in quantum Hamiltonians (energy functions) and quantum dynamics is used to find solutions (ground states of minimal energy). Quantum computers such as the D-Wave systems are indeed implementing those ideas in hardware, as well as "quantum-inspired" devices based on classical electronics such as Fujitsu’s Digital Annealing Unit. All those systems use the same modeling language: Quadratic Unconstrained Binary Optimization (QUBO). However, QUBO is a low-level language and for modeling combinatorial problems such as constraint satisfaction and constrained optimization problems, we need to introduce higher-level abstractions in order to define complex constraints.
Lattice models have been used extensively over the past thirty years to examine the principles of protein folding and design. These models can be used to determine the conformation of the lowest energy fold out of a large number of possible conformations. However, due to the size of the conformational space, new algorithms are required for folding longer proteins sequences. Preliminary work was performed by Babbush et al. (2012) to fold a small peptide on a planar lattice using a quantum annealing device. We extend this work by providing improved Ising-type Hamiltonian encodings for the problem of finding the lowest energy conformation of a lattice protein. We demonstrate a decrease in quantum circuit complexity from quadratic to quasilinear in certain cases. Additionally, we generalize to three spatial dimensions in order to obtain results with higher correlation to the actual atomistic 3D structure of the protein and outline our heuristic approach for splitting large problem instances into smaller subproblems that can be directly solved with the current D-Wave 2000Q architecture. To the best of our knowledge, this work sets a new record for lattice protein folding on a quantum annealer by folding Chignolin (10 residues) on a planar lattice and Trp-Cage (8 residues) on a cubic lattice.