A Variable Neighbourhood Descent Heuristic for Conformational Search Using a Quantum Annealer
Open accessThe DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Abstract
Discovering the low-energy conformations of a molecule is of great interest to computational chemists, with applications in in silico materials design and drug discovery. In this paper, we propose a variable neighbourhood search heuristic for the conformational search problem. Using the structure of a molecule, neighbourhoods are chosen to allow for the efficient use of a binary quadratic optimizer for conformational search. The method is flexible with respect to the choice of molecular force field and the number of discretization levels in the search space, and can be further generalized to take advantage of higher-order binary polynomial optimizers. It is well-suited for the use of devices such as quantum annealers. After carefully defining neighbourhoods, the method easily adapts to the size and topology of these devices, allowing for seamless scaling alongside their future improvements.
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
Quantum annealing with manufactured spins
Johnson, M. W., Amin, M. H. S., Gildert, S., Lanting, T., Hamze, F., Dickson, N., Harris, R., Berkley, A. J., Johansson, J., Bunyk, P., et al. (2011) · Nature · doi:10.1038/nature10012 · Cited by 1,891 · cited 1×
“We evaluate the performance of our proposed algorithm over three families of molecules relevant to industry, using an algorithm that returns an exact optimal solution and the D-Wave 2000Q quantum annealer [32–34].”
MethodThe Protein-Folding Problem, 50 Years On
Dill, K. A., & MacCallum, J. L. (2012) · Science · doi:10.1126/science.1219021 · Cited by 1,699
Catalytic Production of Olefin Block Copolymers via Chain Shuttling Polymerization
Arriola, D. J., Carnahan, E. M., Hustad, P. D., Kuhlman, R. L., & Wenzel, T. T. (2006) · Science · doi:10.1126/science.1125268 · Cited by 1,003
Mathematical foundation of quantum annealing
Morita, S., & Nishimori, H. (2008) · Journal of Mathematical Physics · doi:10.1063/1.2995837 · Cited by 381 · cited 1×
“Although the method can be readily extended to any chosen degree, we assume in this paper that a binary quadratic program is desirable as it is well-suited for optimization using quantum annealing [29,30].”
MethodFinding low-energy conformations of lattice protein models by quantum annealing
Perdomo-Ortiz, A., Dickson, N., Drew-Brook, M., Rose, G., & Aspuru-Guzik, A. (2012) · Scientific Reports · doi:10.1038/srep00571 · Cited by 366 · cited 1×
“The flexibility of solving any conformational search problem using currently available quantum annealers, without imposing restrictions on the granularity of the conformational space, differentiates our work from a previous study on protein folding using quantum annealing [31].”
Method
Cited by
Quantum Algorithms for Quantum Chemistry and Quantum Materials Science
Bauer, B., Bravyi, S., Motta, M., & Chan, G. K.-L. (2020) · Chemical Reviews · doi:10.1021/acs.chemrev.9b00829 · Cited by 848
The prospects of quantum computing in computational molecular biology
Outeiral, C., Strahm, M., Shi, J., Morris, G. M., Benjamin, S. C., & Deane, C. M. (2021) · WIREs Computational Molecular Science · doi:10.1002/wcms.1481 · Cited by 232
A hybrid quantum computing pipeline for real world drug discovery
Li, W., Yin, Z., Li, X., Ma, D., Yi, S., Zhang, Z., Zou, C., Bu, K., Dai, M., Yue, J., et al. (2024) · Scientific Reports · doi:10.1038/s41598-024-67897-8 · Cited by 67
Towards practical applications in quantum computational biology
Fedorov, A. K., & Gelfand, M. S. (2021) · Nature Computational Science · doi:10.1038/s43588-021-00024-z · Cited by 62
“Speaking more closely to the original biological problem statement of protein folding, there is some ongoing research on quantum algorithms for rotamer sampling in the Rosetta energy function 84,85 and conformer sampling 86 .”
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
- Marchand, D. J. J., Noori, M., Roberts, A., Rosenberg, G., Woods, B., Yildiz, U., Coons, M., Devore, D., & Margl, P.
- Venue
- Scientific Reports
- Published
- 2019-09-23
- Volume
- 9
- Issue
- 1
- Pages
- 13708-13708
- ISSN
- 2045-2322 (ISSN-L)
- OpenAlex
- W2973534322
- Cited by
- 15
- References
- 5
- FWCI
- 0.92
- Type
- journal article
- Language
- en
- Open access
- gold
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: A Variable Neighbourhood Descent Heuristic for Conformational Search Using a Quantum Annealer. https://app.cochat.ai/papers/10.1038/s41598-019-47298-y
- The paper
- Marchand, D. J. J., Noori, M., Roberts, A., Rosenberg, G., Woods, B., Yildiz, U., Coons, M., Devore, D., & Margl, P. (2019). A Variable Neighbourhood Descent Heuristic for Conformational Search Using a Quantum Annealer. Scientific Reports. https://doi.org/10.1038/s41598-019-47298-y
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.