<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Coarse-grained lattice protein folding on a quantum annealer · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1811.00713/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/1811.00713/feed.xml" rel="self" type="application/rss+xml" /><item><title>Coarse-grained lattice protein folding on a quantum annealer — mentioned by tbabej</title><link>https://news.ycombinator.com/item?id=25303003</link><guid isPermaLink="false">urn:hackerpapers:mention:1811.00713:25303003</guid><pubDate>Fri, 04 Dec 2020 15:07:03 GMT</pubDate><description>&lt;p&gt;This paper provides an approach for a simplified representation of a problem, so called lattice protein folding, for a very small protein. In particular, they find a 2D lattice fold of a 6-amino acid sequence (PSVKMA). 2D lattice fold means that every amino acid must occupy discrete Euclidean coordinates (i.e. (0,2) or (2,1)), which allows you to convert the search into optimization problem. Couple of years later (using more tricks and newer D-Wave machine), we pushed the limit to 10 amino acids on the planar grid, and generalized the approach to 3D grids as well (where we were able to obtain…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1811.00713/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>quant-ph</category></item></channel></rss>
