Resource-Efficient Quantum Algorithm for Protein Folding
Predicting the three-dimensional (3D) structure of a protein from its primary sequence of amino acids is known as the protein folding (PF) problem. Due to the central role of proteins' 3D structures in chemistry, biology and medicine applications (e.g., in drug discovery) this subject has been...
Saved in:
| Published in: | arXiv.org |
|---|---|
| Main Authors: | , , , |
| Format: | Paper |
| Language: | English |
| Published: |
Ithaca
Cornell University Library, arXiv.org
06.08.2019
|
| Subjects: | |
| ISSN: | 2331-8422 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | Predicting the three-dimensional (3D) structure of a protein from its primary sequence of amino acids is known as the protein folding (PF) problem. Due to the central role of proteins' 3D structures in chemistry, biology and medicine applications (e.g., in drug discovery) this subject has been intensively studied for over half a century. Although classical algorithms provide practical solutions, sampling the conformation space of small proteins, they cannot tackle the intrinsic NP-hard complexity of the problem, even reduced to its simplest Hydrophobic-Polar model. While fault-tolerant quantum computers are still beyond reach for state-of-the-art quantum technologies, there is evidence that quantum algorithms can be successfully used on Noisy Intermediate-Scale Quantum (NISQ) computers to accelerate energy optimization in frustrated systems. In this work, we present a model Hamiltonian with \(\mathcal{O}(N^4)\) scaling and a corresponding quantum variational algorithm for the folding of a polymer chain with \(N\) monomers on a tetrahedral lattice. The model reflects many physico-chemical properties of the protein, reducing the gap between coarse-grained representations and mere lattice models. We use a robust and versatile optimisation scheme, bringing together variational quantum algorithms specifically adapted to classical cost functions and evolutionary strategies (genetic algorithms), to simulate the folding of the 10 amino acid Angiotensin peptide on 22 qubits. The same method is also successfully applied to the study of the folding of a 7 amino acid neuropeptide using 9 qubits on an IBM Q 20-qubit quantum computer. Bringing together recent advances in building gate-based quantum computers with noise-tolerant hybrid quantum-classical algorithms, this work paves the way towards accessible and relevant scientific experiments on real quantum processors. |
|---|---|
| AbstractList | Predicting the three-dimensional (3D) structure of a protein from its primary sequence of amino acids is known as the protein folding (PF) problem. Due to the central role of proteins' 3D structures in chemistry, biology and medicine applications (e.g., in drug discovery) this subject has been intensively studied for over half a century. Although classical algorithms provide practical solutions, sampling the conformation space of small proteins, they cannot tackle the intrinsic NP-hard complexity of the problem, even reduced to its simplest Hydrophobic-Polar model. While fault-tolerant quantum computers are still beyond reach for state-of-the-art quantum technologies, there is evidence that quantum algorithms can be successfully used on Noisy Intermediate-Scale Quantum (NISQ) computers to accelerate energy optimization in frustrated systems. In this work, we present a model Hamiltonian with \(\mathcal{O}(N^4)\) scaling and a corresponding quantum variational algorithm for the folding of a polymer chain with \(N\) monomers on a tetrahedral lattice. The model reflects many physico-chemical properties of the protein, reducing the gap between coarse-grained representations and mere lattice models. We use a robust and versatile optimisation scheme, bringing together variational quantum algorithms specifically adapted to classical cost functions and evolutionary strategies (genetic algorithms), to simulate the folding of the 10 amino acid Angiotensin peptide on 22 qubits. The same method is also successfully applied to the study of the folding of a 7 amino acid neuropeptide using 9 qubits on an IBM Q 20-qubit quantum computer. Bringing together recent advances in building gate-based quantum computers with noise-tolerant hybrid quantum-classical algorithms, this work paves the way towards accessible and relevant scientific experiments on real quantum processors. |
| Author | Anton, Robert Woerner, Stefan Tavernelli, Ivano Barkoutsos, Panagiotis Kl |
| Author_xml | – sequence: 1 givenname: Robert surname: Anton fullname: Anton, Robert – sequence: 2 givenname: Panagiotis surname: Barkoutsos middlename: Kl fullname: Barkoutsos, Panagiotis Kl – sequence: 3 givenname: Stefan surname: Woerner fullname: Woerner, Stefan – sequence: 4 givenname: Ivano surname: Tavernelli fullname: Tavernelli, Ivano |
| BookMark | eNotjstOwzAURC0EEqX0A9hFYp1yfW_sOMuqagGpEg91X_mV4iq1wUkQn08k2Myc1Zy5YZcxRc_YHYdlpYSAB51_wveSN6CWgFzSBZshES9VhXjNFn1_AgCUNQpBM6befZ_GbH25adtgg49D8TbqOIznYtUdUw7Dx7loUy5ecxp8iMU2dS7E4y27anXX-8V_z9l-u9mvn8rdy-PzerUrtUBZkmkNWd-QEVJyLl3tjK5RT2GgUa2bGB3xilfOmga81YBUKbQkldFAc3b_N_uZ09fo--Fwmu7GyXhAlA0iAUj6BaXUSdQ |
| ContentType | Paper |
| Copyright | 2019. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. |
| Copyright_xml | – notice: 2019. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. |
| DBID | 8FE 8FG ABJCF ABUWG AFKRA AZQEC BENPR BGLVJ CCPQU DWQXO HCIFZ L6V M7S PHGZM PHGZT PIMPY PKEHL PQEST PQGLB PQQKQ PQUKI PRINS PTHSS |
| DOI | 10.48550/arxiv.1908.02163 |
| DatabaseName | ProQuest SciTech Collection ProQuest Technology Collection Materials Science & Engineering Collection ProQuest Central (Alumni) ProQuest Central UK/Ireland ProQuest Central Essentials ProQuest Central Database Suite (ProQuest) ProQuest Technology Collection ProQuest One Community College ProQuest Central Korea SciTech Premium Collection ProQuest Engineering Collection Engineering Database ProQuest Central Premium ProQuest One Academic (New) ProQuest Publicly Available Content Database ProQuest One Academic Middle East (New) ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Applied & Life Sciences ProQuest One Academic (retired) ProQuest One Academic UKI Edition ProQuest Central China Engineering Collection |
| DatabaseTitle | Publicly Available Content Database Engineering Database Technology Collection ProQuest One Academic Middle East (New) ProQuest Central Essentials ProQuest One Academic Eastern Edition ProQuest Central (Alumni Edition) SciTech Premium Collection ProQuest One Community College ProQuest Technology Collection ProQuest SciTech Collection ProQuest Central China ProQuest Central ProQuest One Applied & Life Sciences ProQuest Engineering Collection ProQuest One Academic UKI Edition ProQuest Central Korea Materials Science & Engineering Collection ProQuest Central (New) ProQuest One Academic ProQuest One Academic (New) Engineering Collection |
| DatabaseTitleList | Publicly Available Content Database |
| Database_xml | – sequence: 1 dbid: PIMPY name: Publicly Available Content Database url: http://search.proquest.com/publiccontent sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Physics |
| EISSN | 2331-8422 |
| Genre | Working Paper/Pre-Print |
| GroupedDBID | 8FE 8FG ABJCF ABUWG AFKRA ALMA_UNASSIGNED_HOLDINGS AZQEC BENPR BGLVJ CCPQU DWQXO FRJ HCIFZ L6V M7S M~E PHGZM PHGZT PIMPY PKEHL PQEST PQGLB PQQKQ PQUKI PRINS PTHSS |
| ID | FETCH-LOGICAL-a526-3bfb3ce93b566116d7dba72aba7b098fd72a2d31414dcb90eca023482c368ba03 |
| IEDL.DBID | PIMPY |
| IngestDate | Mon Jun 30 09:26:55 EDT 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | false |
| IsScholarly | false |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-a526-3bfb3ce93b566116d7dba72aba7b098fd72a2d31414dcb90eca023482c368ba03 |
| Notes | SourceType-Working Papers-1 ObjectType-Working Paper/Pre-Print-1 content type line 50 |
| OpenAccessLink | https://www.proquest.com/publiccontent/docview/2269223006?pq-origsite=%requestingapplication% |
| PQID | 2269223006 |
| PQPubID | 2050157 |
| ParticipantIDs | proquest_journals_2269223006 |
| PublicationCentury | 2000 |
| PublicationDate | 20190806 |
| PublicationDateYYYYMMDD | 2019-08-06 |
| PublicationDate_xml | – month: 08 year: 2019 text: 20190806 day: 06 |
| PublicationDecade | 2010 |
| PublicationPlace | Ithaca |
| PublicationPlace_xml | – name: Ithaca |
| PublicationTitle | arXiv.org |
| PublicationYear | 2019 |
| Publisher | Cornell University Library, arXiv.org |
| Publisher_xml | – name: Cornell University Library, arXiv.org |
| SSID | ssj0002672553 |
| Score | 1.6955748 |
| SecondaryResourceType | preprint |
| Snippet | Predicting the three-dimensional (3D) structure of a protein from its primary sequence of amino acids is known as the protein folding (PF) problem. Due to the... |
| SourceID | proquest |
| SourceType | Aggregation Database |
| SubjectTerms | Algorithms Amino acids Chemical properties Computer simulation Computers Evolutionary algorithms Fault tolerance Folding Genetic algorithms Optimization Organic chemistry Protein folding Proteins Quantum computers Quantum computing Qubits (quantum computing) |
| Title | Resource-Efficient Quantum Algorithm for Protein Folding |
| URI | https://www.proquest.com/docview/2269223006 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1LS8NAEB60VfDkGx-15OA1bR67m92TqLTowRK1h3oq-6oW7MOkLf58Z5NUwYMnLyEQWJZJMt_HzLffAFxGUrOEEeMzPnLVKhq4MS-BLzTnlAnFbFQOm0h6PT4YiLQ6Hp1Xssp1TiwSden27HTbmITbZqZdxbyNpEEgsOEnczX_8N0MKddrrQZqbELdGW8FNain9w_py3fNJWIJMui4bG4WVl5tmX2OVy1ERd5CtHNmoL9ScoEz3d3_3eEe7kzObbYPG3Z6ANuF2lPnh8DXRXu_UzhI4Ire4xJjvJx41--vuMzibeIhnfVSZ-Mwnnrdskl1BP1up39751cjFHxJI-bHaqRibUWskLWFITOJUTKJJF5UIPjI4H1k4pCExGglAqslYjjhkY4ZVzKIj6E2nU3tCXhKhjTRmhJJLGGKSsoFkSa0xqmyLD2Fxjoqw-o3yIc_QTj7-_E57CATEYWyjjWgtsiW9gK29GoxzrMm1G86vfSp6YSZz83qrX4BUKGxTQ |
| linkProvider | ProQuest |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1LS8NAEB60VfTkGx9Vc9Bj2mSz2eweREQtLWqp0IOeyr6qBZtqHz5-lP_R2bRR8OCtBy8hEAib2S_zTWYm8wEcEalZwqjxGe-4bFUcOJmXwBea85gJxSyZiE0kjQa_uxPNOfjM_4VxbZW5T8wctelrlyOvYJggkMoQJKfPL75TjXLV1VxCYwKLK_vxhp9sw5P6Be7vMSHVy9Z5zZ-qCvgyJsyPVEdF2opIYSAThswkRsmESDyoQPCOwXNiopCG1GglAqsl0hrlREeMKxlEeNt5KFLEelCAYrN-07z_TuoQlmCIHk2qp9mssIocvHdfy0i7vIx06qaN_vL5GZFVV_6ZCVbx0eWzHazBnE3XYTHrV9XDDeB52cG_zGZgIHV6t2NEybjnnT094KpHjz0PA3Kv6QZRdFOvOimzbUJrFmvdgkLaT-02eEqGcaJ1TCW1lKlYxlxQaUJrXF-ZjXeglJu9PX2Rh-0fm-_-ffkQlmqtm-v2db1xtQfLGFeJrE-QlaAwGoztPizo11F3ODiYgsaD9oz36AvGf__R |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Resource-Efficient+Quantum+Algorithm+for+Protein+Folding&rft.jtitle=arXiv.org&rft.au=Anton%2C+Robert&rft.au=Barkoutsos%2C+Panagiotis+Kl&rft.au=Woerner%2C+Stefan&rft.au=Tavernelli%2C+Ivano&rft.date=2019-08-06&rft.pub=Cornell+University+Library%2C+arXiv.org&rft.eissn=2331-8422&rft_id=info:doi/10.48550%2Farxiv.1908.02163 |