Gast ::
| Hauptseite > Publikationsdatenbank > Folding lattice proteins with quantum annealing > print |
| 001 | 910247 | ||
| 005 | 20230123110700.0 | ||
| 024 | 7 | _ | |a 10.1103/PhysRevResearch.4.043013 |2 doi |
| 024 | 7 | _ | |a 2128/32070 |2 Handle |
| 024 | 7 | _ | |a WOS:000881432000009 |2 WOS |
| 037 | _ | _ | |a FZJ-2022-03708 |
| 082 | _ | _ | |a 530 |
| 100 | 1 | _ | |a Irbäck, Anders |0 0000-0003-1384-0626 |b 0 |e Corresponding author |
| 245 | _ | _ | |a Folding lattice proteins with quantum annealing |
| 260 | _ | _ | |a College Park, MD |c 2022 |b APS |
| 336 | 7 | _ | |a article |2 DRIVER |
| 336 | 7 | _ | |a Output Types/Journal article |2 DataCite |
| 336 | 7 | _ | |a Journal Article |b journal |m journal |0 PUB:(DE-HGF)16 |s 1672835939_22540 |2 PUB:(DE-HGF) |
| 336 | 7 | _ | |a ARTICLE |2 BibTeX |
| 336 | 7 | _ | |a JOURNAL_ARTICLE |2 ORCID |
| 336 | 7 | _ | |a Journal Article |0 0 |2 EndNote |
| 520 | _ | _ | |a Quantum annealing is a promising approach for obtaining good approximate solutions to difficult optimization problems. Folding a protein sequence into its minimum-energy structure represents such a problem. For testing new algorithms and technologies for this task, the minimal lattice-based [hydrophobic (H) or polar (P) beads] HP model is well suited, as it represents a considerable challenge despite its simplicity. The HP model has favorable interactions between adjacent, not directly bound hydrophobic residues. Here, we develop a novel spin representation for lattice protein folding tailored for quantum annealing. With a distributed encoding onto the lattice, it differs from earlier attempts to fold lattice proteins on quantum annealers, which were based upon chain growth techniques. With our encoding, the Hamiltonian by design has the quadratic structure required for calculations on an Ising-type annealer, without having to introduce any auxiliary spin variables. This property greatly facilitates the study of long chains. The approach is robust to changes in the parameters required to constrain the spin system to chainlike configurations, and performs very well in terms of solution quality. The results are evaluated against existing exact results for HP chains with up to N=30 beads with 100% hit rate, thereby also outperforming classical simulated annealing. In addition, the method allows us to recover the lowest known energies for N=48 and N=64 HP chains, with similar hit rates. These results are obtained by the commonly used hybrid quantum-classical approach. For pure quantum annealing, our method successfully folds an N=14 HP chain. The calculations were performed on a D-Wave Advantage quantum annealer. |
| 536 | _ | _ | |a 5111 - Domain-Specific Simulation & Data Life Cycle Labs (SDLs) and Research Groups (POF4-511) |0 G:(DE-HGF)POF4-5111 |c POF4-511 |f POF IV |x 0 |
| 588 | _ | _ | |a Dataset connected to CrossRef, Journals: juser.fz-juelich.de |
| 700 | 1 | _ | |a Knuthson, Lucas |0 0000-0003-1080-200X |b 1 |
| 700 | 1 | _ | |a Mohanty, Sandipan |0 P:(DE-Juel1)132590 |b 2 |
| 700 | 1 | _ | |a Peterson, Carsten |0 0000-0001-7362-2191 |b 3 |
| 773 | _ | _ | |a 10.1103/PhysRevResearch.4.043013 |g Vol. 4, no. 4, p. 043013 |0 PERI:(DE-600)3004165-X |n 4 |p 043013 |t Physical review research |v 4 |y 2022 |x 2643-1564 |
| 856 | 4 | _ | |u https://juser.fz-juelich.de/record/910247/files/PhysRevResearch.4.043013.pdf |y OpenAccess |
| 856 | 4 | _ | |u https://juser.fz-juelich.de/record/910247/files/folding_quantum_annealing.pdf |y OpenAccess |
| 909 | C | O | |o oai:juser.fz-juelich.de:910247 |p openaire |p open_access |p VDB |p driver |p dnbdelivery |
| 910 | 1 | _ | |a Forschungszentrum Jülich |0 I:(DE-588b)5008462-8 |k FZJ |b 2 |6 P:(DE-Juel1)132590 |
| 913 | 1 | _ | |a DE-HGF |b Key Technologies |l Engineering Digital Futures – Supercomputing, Data Management and Information Security for Knowledge and Action |1 G:(DE-HGF)POF4-510 |0 G:(DE-HGF)POF4-511 |3 G:(DE-HGF)POF4 |2 G:(DE-HGF)POF4-500 |4 G:(DE-HGF)POF |v Enabling Computational- & Data-Intensive Science and Engineering |9 G:(DE-HGF)POF4-5111 |x 0 |
| 914 | 1 | _ | |y 2022 |
| 915 | _ | _ | |a OpenAccess |0 StatID:(DE-HGF)0510 |2 StatID |
| 915 | _ | _ | |a Creative Commons Attribution CC BY 4.0 |0 LIC:(DE-HGF)CCBY4 |2 HGFVOC |
| 915 | _ | _ | |a DBCoverage |0 StatID:(DE-HGF)0200 |2 StatID |b SCOPUS |d 2022-11-29 |
| 915 | _ | _ | |a DBCoverage |0 StatID:(DE-HGF)0300 |2 StatID |b Medline |d 2022-11-29 |
| 915 | _ | _ | |a DBCoverage |0 StatID:(DE-HGF)0501 |2 StatID |b DOAJ Seal |d 2022-08-16T10:08:58Z |
| 915 | _ | _ | |a DBCoverage |0 StatID:(DE-HGF)0500 |2 StatID |b DOAJ |d 2022-08-16T10:08:58Z |
| 915 | _ | _ | |a Peer Review |0 StatID:(DE-HGF)0030 |2 StatID |b DOAJ : Blind peer review |d 2022-08-16T10:08:58Z |
| 915 | _ | _ | |a Creative Commons Attribution CC BY (No Version) |0 LIC:(DE-HGF)CCBYNV |2 V:(DE-HGF) |b DOAJ |d 2022-08-16T10:08:58Z |
| 915 | _ | _ | |a DBCoverage |0 StatID:(DE-HGF)0199 |2 StatID |b Clarivate Analytics Master Journal List |d 2022-11-29 |
| 915 | _ | _ | |a WoS |0 StatID:(DE-HGF)0112 |2 StatID |b Emerging Sources Citation Index |d 2022-11-29 |
| 915 | _ | _ | |a DBCoverage |0 StatID:(DE-HGF)0150 |2 StatID |b Web of Science Core Collection |d 2022-11-29 |
| 915 | _ | _ | |a Article Processing Charges |0 StatID:(DE-HGF)0561 |2 StatID |d 2022-11-29 |
| 915 | _ | _ | |a Fees |0 StatID:(DE-HGF)0700 |2 StatID |d 2022-11-29 |
| 920 | _ | _ | |l yes |
| 920 | 1 | _ | |0 I:(DE-Juel1)JSC-20090406 |k JSC |l Jülich Supercomputing Center |x 0 |
| 980 | _ | _ | |a journal |
| 980 | _ | _ | |a VDB |
| 980 | _ | _ | |a I:(DE-Juel1)JSC-20090406 |
| 980 | _ | _ | |a UNRESTRICTED |
| 980 | 1 | _ | |a FullTexts |
| Library | Collection | CLSMajor | CLSMinor | Language | Author |
|---|