Cited by 371Quantum Computing Algorithms and ArchitectureProtein Structure and DynamicsDNA and Biological Computing

Finding low-energy conformations of lattice protein models by quantum annealing

Open access
Perdomo-Ortiz, Alejandro, Dickson, Neil, Drew-Brook, Marshall, Rose, Geordie, Aspuru-Guzik, Alán·2012·Scientific Reports

Abstract

Lattice protein folding models are a cornerstone of computational biophysics. Although these models are a coarse grained representation, they provide useful insight into the energy landscape of natural proteins. Finding low-energy threedimensional structures is an intractable problem even in the simplest model, the Hydrophobic-Polar (HP) model. Description of protein-like properties are more accurately described by generalized models, such as the one proposed by Miyazawa and Jernigan (MJ), which explicitly take into account the unique interactions among all 20 amino acids. There is theoretical and experimental evidence of the advantage of solving classical optimization problems using quantum annealing over its classical analogue (simulated annealing). In this report, we present a benchmark implementation of quantum annealing for lattice protein folding problems (six different experiments up to 81 superconducting quantum bits). This first implementation of a biophysical problem paves the way towards studying optimization problems in biophysics and statistical mechanics using quantum devices.

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1038/srep00571

Cites

64 of 64 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Perdomo-Ortiz et al. used quantum annealing to find low-energy conformations of different lattice protein models.

    “Perdomo-Ortiz etal. used quantum annealing to find low-energy conformations of different lattice protein models”
  • In Perdomo-Ortiz et al. 2012, authors use five and eight qubits for the four-amino-acid sequence to encode and solve the protein folding problem for a short tetrapeptide and hexapeptide chain.

    “In (Perdomo-Ortiz et al. , 2012), authors use five and eight qubits for the four-amino-acid sequence to encode and solve the protein folding problem for a short tetrapeptide and hexapeptide chain.”

    From Noisy intermediate-scale quantum algorithms (2022) · cites this paper as Perdomo-Ortiz et al., 2012

  • The development of software platforms such as Rigetti's pyQuil, IBM's QISKit, ETH Zürich's ProjectQ, Google's Cirq, and Xanadu's Strawberry Fields has amplified the synergy between quantum algorithm developers and quantum machines.

    “Fortunately, this synergy has been amplified by the development of software platforms such as Rigetti's pyQuil 389 , IBM's QISKit 390 , ETH Z¨ urich's ProjectQ 391 , Google's Cirq 392 , and Xanadu's Strawberry Fields 393 .”

    From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [391]

  • The first attempts to solve protein folding with quantum annealing and later hybrid algorithms based on QAOA, VQE, and quantum random walks have been proposed.

    “The first attempts to solve the protein folding optimization problem relied on quantum annealing [205,206] while, more recently, hybrid classical-variational algorithms based on QAOA, [109] VQE, [110] and on quantum random walks [207] have been proposed.”

    From Quantum Computing for Molecular Biology** (2023) · cites this paper as [205]

  • Quantum annealing has been applied to the protein folding problem using simplified lattice models for the polypeptide chain.

    “Quantum annealing has been applied to the protein folding problem [71, 72], using simplified lattice models for the polypeptide chain.”

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Perdomo-Ortiz, A., Dickson, N., Drew-Brook, M., Rose, G., & Aspuru-Guzik, A.
Affiliations
D-Wave Systems (Canada) (CA)
Venue
Scientific Reports
Published
2012-08-13
Volume
2
Issue
1
Pages
571-571
ISSN
2045-2322 (ISSN-L)
OpenAlex
W2118518847
Cited by
366
References
63
Citations by year
2026: 20 · 2025: 23 · 2024: 36 · 2023: 35 · 2022: 42 · 2021: 44 · 2020: 27 · 2019: 33 · 2018: 13 · 2017: 11 · 2016: 22 · 2015: 18 · 2014: 25 · 2013: 12 · 2012: 5
FWCI
18.90
Type
journal article
Language
en
Open access
Locations
  • Scientific Reports (publishedVersion, cc-by-nc-nd)
  • PubMed Central (publishedVersion, cc-by-nc-nd)
  • PubMed (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • Digital Access to Scholarship at Harvard (DASH) (Harvard University) (submittedVersion, cc-by)
  • arXiv (Cornell University)
Funders
  • National Science Foundation (1037992)
  • Division of Chemistry (CHE-1037992)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
  • Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › Protein Structure and Dynamics
  • Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › DNA and Biological Computing
Keywords
quantum annealing, hydrophobic-polar model, low-energy conformations, protein energy landscape, superconducting qubits, combinatorial optimization
MeSH terms
Algorithms, Amino Acid Sequence, Computer Simulation, Models, Molecular, Protein Conformation, Proteins, Quantum Theory, Protein Folding

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review