Molecular docking with Gaussian Boson Sampling
Open accessThe DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
Abstract
Photonic quantum devices called Gaussian Boson Samplers can be programmed to predict molecular docking configurations.
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
Trott, O., & Olson, A. J. (2010) · Journal of Computational Chemistry · doi:10.1002/jcc.21334 · Cited by 38,412
Simulating physics with computers
Feynman, R. P. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf02650179 · Cited by 7,691
Molecular Docking: A Powerful Approach for Structure-Based Drug Discovery
Meng, X.-Y., Zhang, H.-X., Mezei, M., & Cui, M. (2011) · Current Computer Aided-Drug Design · doi:10.2174/157340911795677602 · Cited by 3,771
Virtual screening of chemical libraries
Shoichet, B. K. (2004) · Nature · doi:10.1038/nature03197 · Cited by 1,425
Principles of docking: An overview of search algorithms and a guide to scoring functions
Halperin, I., Ma, B., Wolfson, H., & Nussinov, R. (2002) · Proteins: Structure, Function, and Bioinformatics · doi:10.1002/prot.10115 · Cited by 1,294 · cited 2×
“The goal of this paper is to demonstrate that GBS devices can improve the sampling of docking configurations, whereas it does not address the difficulties associated with scoring functions (28, 29), which represent the major hurdle in accurate docking.”
BackgroundThe PDBbind database: methodologies and updates
Wang, R., Fang, X., Lu, Y., Yang, C.-Y., & Wang, S. (2005) · Journal of Medicinal Chemistry · doi:10.1021/jm048957q · Cited by 933
The computational complexity of linear optics
Aaronson, S., & Arkhipov, A. (2011) · Proceedings of the forty-third annual ACM symposium on Theory of computing · doi:10.1145/1993636.1993682 · Cited by 874
Quantum optimization using variational algorithms on near-term quantum devices
Moll, N., Barkoutsos, P., Bishop, L. S., Chow, J. M., Cross, A., Egger, D. J., Filipp, S., Fuhrer, A., Gambetta, J. M., Ganzhorn, M., et al. (2018) · Quantum Science and Technology · doi:10.1088/2058-9565/aab822 · Cited by 744
Hamilton, C. S., Kruse, R., Sansoni, L., Barkhofen, S., Silberhorn, C., & Jex, I. (2017) · Physical Review Letters · doi:10.1103/physrevlett.119.170501 · Cited by 503
Efficient Classical Simulation of Continuous Variable Quantum Information Processes
Bartlett, S. D., Sanders, B. C., Braunstein, S. L., & Nemoto, K. (2002) · Physical Review Letters · doi:10.1103/physrevlett.88.097904 · Cited by 425 · cited 1×
“In spite of their infinite-dimensional Hilbert space, Gaussian states can be simulated efficiently, as their evolution can be modeled by linear transformations such as Bogoliubov rotations (56).”
BackgroundBoson sampling for molecular vibronic spectra
Huh, J., Guerreschi, G. G., Peropadre, B., McClean, J. R., & Aspuru-Guzik, A. (2015) · Nature Photonics · doi:10.1038/nphoton.2015.153 · Cited by 341
Dias, R., & de Azevedo Jr., W. (2008) · Current Drug Targets · doi:10.2174/138945008786949432 · Cited by 278
Experimental scattershot boson sampling
Bentivegna, M., Spagnolo, N., Vitelli, C., Flamini, F., Viggianiello, N., Latmiral, L., Mataloni, P., Brod, D. J., Galvão, E. F., Crespi, A., et al. (2015) · Science Advances · doi:10.1126/sciadv.1400255 · Cited by 239
Simulating the vibrational quantum dynamics of molecules using photonics
Sparrow, C., Martín-López, E., Maraviglia, N., Neville, A., Harrold, C., Carolan, J., Joglekar, Y. N., Hashimoto, T., Matsuda, N., O’Brien, J. L., et al. (2018) · Nature · doi:10.1038/s41586-018-0152-9 · Cited by 230 · cited 1×
“Proof-of-principle demonstrations have also been reported (11, 12).”
BackgroundGaussian boson sampling using threshold detectors
Quesada, N., Arrazola, J. M., & Killoran, N. (2018) · Physical Review A · doi:10.1103/physreva.98.062322 · Cited by 120
Self-citationA Faster Hafnian Formula for Complex Matrices and Its Benchmarking on a Supercomputer
Björklund, A., Gupt, B., & Quesada, N. (2019) · ACM Journal of Experimental Algorithmics · doi:10.1145/3325111 · Cited by 74
Approximating vibronic spectroscopy with imperfect quantum optics
Clements, W. R., Renema, J. J., Eckstein, A., Valido, A. A., Lita, A., Gerrits, T., Nam, S. W., Kolthammer, W. S., Huh, J., & Walmsley, I. A. (2018) · Journal of Physics B: Atomic, Molecular and Optical Physics · doi:10.1088/1361-6455/aaf031 · Cited by 39 · cited 1×
“Proof-of-principle demonstrations have also been reported (11, 12).”
Background
Cited by
Noisy intermediate-scale quantum algorithms
Bharti, K., Cervera-Lierta, A., Kyaw, T. H., Haug, T., Alperin-Lea, S., Anand, A., Degroote, M., Heimonen, H., Kottmann, J. S., Menke, T., et al. (2022) · Reviews of Modern Physics · doi:10.1103/revmodphys.94.015004 · Cited by 2,231
Quantum computational advantage with a programmable photonic processor
Madsen, L. S., Laudenbach, F., Askarani, M. F., Rortais, F., Vincent, T., Bulmer, J. F. F., Miatto, F. M., Neuhaus, L., Helt, L. G., Collins, M. J., et al. (2022) · Nature · doi:10.1038/s41586-022-04725-x · Cited by 1,101
Quantum circuits with many photons on a programmable nanophotonic chip
Arrazola, J. M., Bergholm, V., Brádler, K., Bromley, T. R., Collins, M. J., Dhand, I., Fumagalli, A., Gerrits, T., Goussev, A., Helt, L. G., et al. (2021) · Nature · doi:10.1038/s41586-021-03202-1 · Cited by 567
Self-citationNon-Gaussian Quantum States and Where to Find Them
Walschaers, M. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.030204 · Cited by 306
Intelligent Computing: The Latest Advances, Challenges, and Future
Zhu, S., Yu, T., Xu, T., Chen, H., Dustdar, S., Gigan, S., Gunduz, D., Hossain, E., Jin, Y., Lin, F., et al. (2023) · Intelligent Computing · doi:10.34133/icomputing.0006 · Cited by 290
Metadata
- Authors
- Banchi, L., Fingerhuth, M., Babej, T., Ing, C., & Arrazola, J. M.
- Venue
- Science Advances
- Published
- 2020-06-05
- Volume
- 6
- Issue
- 23
- Pages
- eaax1950-eaax1950
- ISSN
- 2375-2548 (ISSN-L)
- OpenAlex
- W3032989746
- Cited by
- 157
- References
- 17
- FWCI
- 7.58
- 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
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.