CoChat

QFold: quantum walks and deep learning to solve protein folding

Open access
Casares, P A M, Campos, Roberto, Martin-Delgado, M A · 2022 · Quantum Science and Technology
Cited by 49

The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.

Abstract

We develop quantum computational tools to predict the 3D structure of proteins, one of the most important problems in current biochemical research. We explain how to combine recent deep learning advances with the well known technique of quantum walks applied to a Metropolis algorithm. The result, QFold, is a fully scalable hybrid quantum algorithm that, in contrast to previous quantum approaches, does not require a lattice model simplification and instead relies on the much more realistic assumption of parameterization in terms of torsion angles of the amino acids. We compare it with its classical analog for different annealing schedules and find a polynomial quantum advantage, and implement a minimal realization of the quantum Metropolis in IBMQ Casablanca quantum system.

Overview

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

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

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

Integrity signals

Registry

Crossref · 10.1088/2058-9565/ac4f2f

Cites

21 of 21 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

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

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

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

Self-check

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

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

Citations

Cites

Show all 21 references

Research works printed but not linked: 22

  1. Berman, 2000, The protein data bank, Nucleic Acids Res., 28, 235, 10.1093/nar/28.1.235 · DOI · Paper page
  2. Perdigão, 2015, Unexpected features of the dark proteome, Proc. Natl Acad. Sci. USA, 112, 15898, 10.1073/pnas.1508380112 · DOI · Paper page
  3. Perdigão, 2019, Dark proteome database: studies on dark proteins, High Throughput, 8, 8, 10.3390/ht8020008 · DOI
  4. Bryan, 2010, Proteins that switch folds, Curr. Opin. Struct. Biol., 20, 482, 10.1016/j.sbi.2010.06.002 · DOI · Paper page
  5. Das, 2008, Macromolecular modeling with rosetta, Annu. Rev. Biochem., 77, 363, 10.1146/annurev.biochem.77.062906.171838 · DOI · Paper page
  6. Das, 2007, Structure prediction for CASP7 targets using extensive all-atom refinement with Rosetta@home, Proteins, 69, 118, 10.1002/prot.21636 · DOI · Paper page
  7. Hart, 1997, Robust proofs of NP-hardness for protein folding: general lattices and energy potentials, J. Comput. Biol., 4, 1, 10.1089/cmb.1997.4.1 · DOI · Paper page
  8. Portugal, 2018, 308, 10.1007/978-3-319-97813-0 · doi:10.1007/978-3-319-97813-0 · Paper page
  9. Hanwell, 2012, Avogadro: an advanced semantic chemical editor, visualization, and analysis platform, J. Cheminf., 4, 17, 10.1186/1758-2946-4-17 · DOI · Paper page
  10. Wocjan, 2008, Speedup via quantum sampling, Phys. Rev. A, 78, 10.1103/physreva.78.042336 · DOI
  11. Somma, 2008, Quantum simulations of classical annealing processes, Phys. Rev. Lett., 101, 10.1103/physrevlett.101.130504 · DOI · Paper page
  12. Yung, 2012, A quantum–quantum Metropolis algorithm, Proc. Natl Acad. Sci., 109, 754, 10.1073/pnas.1111758109 · DOI
  13. Lemieux, 2020, Efficient quantum walk circuits for Metropolis–Hastings algorithm, Quantum, 4, 287, 10.22331/q-2020-06-29-287 · DOI
  14. Wong, 2021, Quantum speedup for protein structure prediction, IEEE Trans. NanoBiosci., 20, 323, 10.1109/tnb.2021.3065051 · DOI
  15. Banchi, 2020, Molecular docking with Gaussian boson sampling, Sci. Adv., 6, 10.1126/sciadv.aax1950 · DOI
  16. Turney, 2012, Psi4: an open-source ab initio electronic structure program, WIREs Comput. Mol. Sci., 2, 556, 10.1002/wcms.93 · DOI · Paper page
  17. Jensen, 2013, Atomic orbital basis sets, WIREs Comput. Mol. Sci., 3, 273, 10.1002/wcms.1123 · DOI · Paper page
  18. Kirkpatrick, 1983, Optimization by simulated annealing, Science, 220, 671, 10.1126/science.220.4598.671 · DOI · Paper page
  19. Student, 1908, The probable error of a mean, Biometrika, 6, 1, 10.2307/2331554 · doi:10.2307/2331554 · Paper page
  20. Brown, 2001, Interval estimation for a binomial proportion, Stat. Sci., 16, 101, 10.1214/ss/1009213286 · DOI · Paper page
  21. Ambainis, 2007, Quantum walk algorithm for element distinctness, SIAM J. Comput., 37, 210, 10.1137/s0097539705447311 · DOI · Paper page
  22. Paparo, 2013, Quantum Google in a complex network, Sci. Rep., 3, 2773, 10.1038/srep02773 · DOI · Paper page

Cited by

See all 49

Metadata

Authors
Casares, P. A. M., Campos, R., & Martin-Delgado, M. A.
Venue
Quantum Science and Technology
Published
2022-03-01
Volume
7
Issue
2
Pages
025013
ISSN
2058-9565 (ISSN-L)
OpenAlex
W3124804039
Cited by
49
References
21
FWCI
2.58
Type
journal article
Language
en
Open access
bronze
Licence
Funders
  • Ministerio de Educación, Cultura y Deporte (FPU17/03620)
  • CAM/FEDER (IND2019/TIC17146)
  • U.S. Army (W911NF-14-1-0103)
  • Ministerio de Economía y Competitividad (FIS 2017-91460-EXP)

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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: QFold: quantum walks and deep learning to solve protein folding. https://app.cochat.ai/papers/10.1088/2058-9565/ac4f2f
The paper
Casares, P. A. M., Campos, R., & Martin-Delgado, M. A. (2022). QFold: quantum walks and deep learning to solve protein folding. Quantum Science and Technology. https://doi.org/10.1088/2058-9565/ac4f2f

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.