QFold: quantum walks and deep learning to solve protein folding
Open accessThe DOI matches its Crossref record; 23 of the 23 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.
Integrity signals
Registry
Cites
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.
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
Highly accurate protein structure prediction with AlphaFold
Jumper, J., Evans, R., Pritzel, A., Green, T., Figurnov, M., Ronneberger, O., Tunyasuvunakool, K., Bates, R., Žídek, A., Potapenko, A., et al. (2021) · Nature · doi:10.1038/s41586-021-03819-2 · Cited by 43,764
UniProt: a worldwide hub of protein knowledge
The UniProt Consortium (2019) · Nucleic Acids Research · doi:10.1093/nar/gky1049 · Cited by 7,698 · cited 1×
“In fact it is so complicated that the gap between proteins whose sequence is known and those for which the folding structure has been additionally analyzed is three orders of magnitude: there are over 200 million sequences available at the UniProt database [1], but just over 172 thousand whose structure is known, as g…”
Quantum Mechanics Helps in Searching for a Needle in a Haystack
Grover, L. K. (1997) · Physical Review Letters · doi:10.1103/physrevlett.79.325 · Cited by 4,306
Improved protein structure prediction using potentials from deep learning
Senior, A. W., Evans, R., Jumper, J., Kirkpatrick, J., Sifre, L., Green, T., Qin, C., Žídek, A., Nelson, A. W. R., Bridgland, A., et al. (2020) · Nature · doi:10.1038/s41586-019-1923-7 · Cited by 3,378
PubChem 2019 update: improved access to chemical data
Kim, S., Chen, J., Cheng, T., Gindulyte, A., He, J., He, S., Li, Q., Shoemaker, B. A., Thiessen, P. A., Yu, B., et al. (2019) · Nucleic Acids Research · doi:10.1093/nar/gky1033 · Cited by 3,249
Molecular Electronic‐Structure Theory
Helgaker, T., Jørgensen, P., & Olsen, J. (2000) · doi:10.1002/9781119019572 · Cited by 2,594
Intrinsically disordered protein
Dunker, A. K., Lawson, J. D., Brown, C. J., Williams, R. M., Romero, P., Oh, J. S., Oldfield, C. J., Campen, A. M., Ratliff, C. M., Hipps, K. W., et al. (2001) · Journal of Molecular Graphics and Modelling · doi:10.1016/s1093-3263(00)00138-8 · Cited by 2,272
Error Mitigation for Short-Depth Quantum Circuits
Temme, K., Bravyi, S., & Gambetta, J. M. (2017) · Physical Review Letters · doi:10.1103/physrevlett.119.180509 · Cited by 1,379
(2004) · doi:10.1109/focs.2004.53 · Cited by 599
Critical assessment of methods of protein structure prediction (CASP)—Round XIII
Kryshtafovych, A., Schwede, T., Topf, M., Fidelis, K., & Moult, J. (2019) · Proteins: Structure, Function, and Bioinformatics · doi:10.1002/prot.25823 · Cited by 506 · cited 3×
“We would also like to point out that despite the great advances achieved by the new classical methods in the latest editions of the CASP competition [13], there is still huge room for improvement and there are many gaps in the problem of protein folding that await to be filled.”
Research works printed but not linked: 22
- Berman, 2000, The protein data bank, Nucleic Acids Res., 28, 235, 10.1093/nar/28.1.235 · DOI · Paper page
- Perdigão, 2015, Unexpected features of the dark proteome, Proc. Natl Acad. Sci. USA, 112, 15898, 10.1073/pnas.1508380112 · DOI · Paper page
- Perdigão, 2019, Dark proteome database: studies on dark proteins, High Throughput, 8, 8, 10.3390/ht8020008 · DOI · Paper page
- Bryan, 2010, Proteins that switch folds, Curr. Opin. Struct. Biol., 20, 482, 10.1016/j.sbi.2010.06.002 · DOI · Paper page
- Das, 2008, Macromolecular modeling with rosetta, Annu. Rev. Biochem., 77, 363, 10.1146/annurev.biochem.77.062906.171838 · DOI · Paper page
- 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
- 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
- Portugal, 2018, 308, 10.1007/978-3-319-97813-0 · doi:10.1007/978-3-319-97813-0 · Paper page
- 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
- Wocjan, 2008, Speedup via quantum sampling, Phys. Rev. A, 78, 10.1103/physreva.78.042336 · DOI · Paper page
- Somma, 2008, Quantum simulations of classical annealing processes, Phys. Rev. Lett., 101, 10.1103/physrevlett.101.130504 · DOI · Paper page
- Yung, 2012, A quantum–quantum Metropolis algorithm, Proc. Natl Acad. Sci., 109, 754, 10.1073/pnas.1111758109 · DOI · Paper page
- Lemieux, 2020, Efficient quantum walk circuits for Metropolis–Hastings algorithm, Quantum, 4, 287, 10.22331/q-2020-06-29-287 · DOI · Paper page
- Wong, 2021, Quantum speedup for protein structure prediction, IEEE Trans. NanoBiosci., 20, 323, 10.1109/tnb.2021.3065051 · DOI
- Banchi, 2020, Molecular docking with Gaussian boson sampling, Sci. Adv., 6, 10.1126/sciadv.aax1950 · DOI · Paper page
- Turney, 2012, Psi4: an open-source ab initio electronic structure program, WIREs Comput. Mol. Sci., 2, 556, 10.1002/wcms.93 · DOI · Paper page
- Jensen, 2013, Atomic orbital basis sets, WIREs Comput. Mol. Sci., 3, 273, 10.1002/wcms.1123 · DOI · Paper page
- Kirkpatrick, 1983, Optimization by simulated annealing, Science, 220, 671, 10.1126/science.220.4598.671 · DOI · Paper page
- Student, 1908, The probable error of a mean, Biometrika, 6, 1, 10.2307/2331554 · doi:10.2307/2331554 · Paper page
- Brown, 2001, Interval estimation for a binomial proportion, Stat. Sci., 16, 101, 10.1214/ss/1009213286 · DOI · Paper page
- Ambainis, 2007, Quantum walk algorithm for element distinctness, SIAM J. Comput., 37, 210, 10.1137/s0097539705447311 · DOI · Paper page
- Paparo, 2013, Quantum Google in a complex network, Sci. Rep., 3, 2773, 10.1038/srep02773 · DOI · Paper page
Cited by
Quantum computing for near-term applications in generative chemistry and drug discovery.
Pyrkov, A., Aliper, A., Bezrukov, D., Lin, Y.-C., Polykovskiy, D., Kamya, P., Ren, F., & Zhavoronkov, A. (2023) · Drug Discovery Today · doi:10.1016/j.drudis.2023.103675 · Cited by 100
Quantum Computing for Molecular Biology**
Baiardi, A., Christandl, M., & Reiher, M. (2023) · ChemBioChem · doi:10.1002/cbic.202300120 · Cited by 93
Biology and medicine in the landscape of quantum advantages
Cordier, B. A., Sawaya, N. P. D., Guerreschi, G. G., & McWeeney, S. K. (2022) · Journal of The Royal Society Interface · doi:10.1098/rsif.2022.0541 · Cited by 87
“They include proof of principle implementations of protein folding with a hybrid deep learning approach leveraging quantum walks on a gate-based superconducting device [237] and the diagnosis of breast cancer from legacy clinical data via QKE [238].”
MethodQuantum computing for chemical and biomolecular product design
Andersson, M. P., Jones, M. N., Mikkelsen, K. V., You, F., & Mansouri, S. S. (2022) · Current Opinion in Chemical Engineering · doi:10.1016/j.coche.2021.100754 · Cited by 66
“Other approaches to solving the protein folding problem with quantum devices have been applied with different kinds of variational quantum eigen-solvers [59], such as the Conditional Value-at-Risk Variational Quantum Eigensolver (CVaR-VQE) [60], or with quantum walks [61].”
MethodQuantum computing algorithms: getting closer to critical problems in computational biology
Marchetti, L., Nifosì, R., Martelli, P. L., Da Pozzo, E., Cappello, V., Banterle, F., Trincavelli, M. L., Martini, C., & D’Elia, M. (2022) · Briefings in Bioinformatics · doi:10.1093/bib/bbac437 · Cited by 47
“Gate-based quantum algorithms are also being proposed to address biopolymer conformations, including a hybrid approach combining quantum Monte Carlo and machine learning for protein structure prediction [80], another quantum Monte Carlo approach to antibody loop modelling [54] and protein design exploiting Grover’s al…”
MethodPeptide conformational sampling using the Quantum Approximate Optimization Algorithm
Boulebnane, S., Lucas, X., Meyder, A., Adaszewski, S., & Montanaro, A. (2023) · npj Quantum Information · doi:10.1038/s41534-023-00733-5 · Cited by 32
Swan, M., dos Santos, R. P., & Witte, F. (2022) · Quantum Reports · doi:10.3390/quantum4010008 · Cited by 16
“Quantum walks are an alternative to lattice structures, as the QFold project proposes a quantum algorithm based on the torsion angles of amino acids, deployed with quantum walks (on the IBMQ Casablanca quantum processor) [74].”
BackgroundThe prospects of Monte Carlo antibody loop modelling on a fault-tolerant quantum computer
Allcock, J., Vangone, A., Meyder, A., Adaszewski, S., Strahm, M., Hsieh, C.-Y., & Zhang, S. (2022) · Frontiers in Drug Discovery · doi:10.3389/fddsv.2022.908870 · Cited by 12
Metadata
- Authors
- Casares, P. A. M., Campos, R., & Martin-Delgado, M. A.
- Venue
- Quantum Science and Technology
- Publisher
- IOP Publishing
- Published
- 2022-03-01
- Volume
- 7
- Issue
- 2
- Pages
- 025013
- ISSN
- 2058-9565 (ISSN-L)
- OpenAlex
- W3124804039
- Cited by
- 49
- References
- 23
- FWCI
- 2.58
- Type
- journal article
- Language
- en
- Open access
- bronze
- Licence
- publishingsupport.iopscience.iop.org/iop-standard/v1 (vor)
- iopscience.iop.org/info/page/text-and-data-mining (tdm)
- 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
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.