Variational Quantum Algorithms for Chemical Simulation and Drug Discovery
원문 초록
Quantum computing has gained a lot of attention recently, and scientists have seen potential applications in this field using quantum computing for Cryptography and Communication to Machine Learning and Healthcare. Protein folding has been one of the most interesting areas to study, and it is also one of the biggest problems of biochemistry. Each protein folds distinctively, and the difficulty of finding its stable shape rapidly increases with an increase in the number of amino acids in the chain. A moderate protein has about 100 amino acids, and the number of combinations one needs to verify to find the stable structure is enormous. At some point, the number of these combinations will be so vast that classical computers cannot even attempt to solve them. In this paper, we examine how this problem can be solved with the help of quantum computing using two different algorithms, Variational Quantum Eigensolver (VQE) and Quantum Approximate Optimization Algorithm (QAOA), using Qiskit Nature. We compare the results of different quantum hardware and simulators and check how error mitigation affects the performance. Further, we make comparisons with SoTA algorithms and evaluate the reliability of the method.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
RapidDock: Unlocking Proteome-scale Molecular Docking
B-XAIC Dataset: Benchmarking Explainable AI for Graph Neural Networks Using Chemical Data
Assay2Mol: large language model-based drug design using BioAssay context
PocketVina Enables Scalable and Highly Accurate Physically Valid Docking through Multi-Pocket Conditioning
MegaFold: System-Level Optimizations for Accelerating Protein Structure Prediction Models
Fast Bayesian Optimization of Function Networks with Partial Evaluations
토론
이 논문과 연결된 포럼 글이 아직 없습니다.