Variational Quantum Algorithms for Chemical Simulation and Drug Discovery

• URL: http://arxiv.org/abs/2211.07854v1
• Date: Tue, 15 Nov 2022 02:34:36 GMT
• Title: Variational Quantum Algorithms for Chemical Simulation and Drug Discovery
• Authors: Hasan Mustafa, Sai Nandan Morapakula, Prateek Jain, Srinjoy Ganguly
• Abstract summary: We use quantum computing to solve the problem of protein folding. A moderate protein has about 100 amino acids, and the number of combinations one needs to verify to find the stable structure is enormous. We compare the results of different quantum hardware and simulators and check how error mitigation affects the performance.
• Score: 9.862947257151113
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: 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.

Related papers

• Quantum Subroutine for Variance Estimation: Algorithmic Design and Applications [80.04533958880862]
  Quantum computing sets the foundation for new ways of designing algorithms. New challenges arise concerning which field quantum speedup can be achieved. Looking for the design of quantum subroutines that are more efficient than their classical counterpart poses solid pillars to new powerful quantum algorithms.
  arXiv  Detail & Related papers  (2024-02-26T09:32:07Z)
• Resource analysis of quantum algorithms for coarse-grained protein folding models [0.0]
  We analyze the resource requirements for simulating protein folding on a quantum computer. We calculate the minimum number of qubits, interactions, and two-qubit gates necessary to build a quantum algorithm.
  arXiv  Detail & Related papers  (2023-11-07T18:27:44Z)
• Pushing the Limits of Quantum Computing for Simulating PFAS Chemistry [0.3655818759482589]
  Solving the electronic Schrodinger equation is the core problem of computational chemistry. We propose an end-to-end quantum chemistry pipeline based on the variational quantum eigensolver (VQE) algorithm. Our platform orchestrates hundreds of simulation jobs on compute resources to efficiently complete ab initio chemistry experiments.
  arXiv  Detail & Related papers  (2023-11-02T13:58:02Z)
• Quantum algorithms: A survey of applications and end-to-end complexities [90.05272647148196]
  The anticipated applications of quantum computers span across science and industry. We present a survey of several potential application areas of quantum algorithms. We outline the challenges and opportunities in each area in an "end-to-end" fashion.
  arXiv  Detail & Related papers  (2023-10-04T17:53:55Z)
• A hybrid quantum-classical algorithm for multichannel quantum scattering of atoms and molecules [62.997667081978825]
  We propose a hybrid quantum-classical algorithm for solving the Schr"odinger equation for atomic and molecular collisions. The algorithm is based on the $S$-matrix version of the Kohn variational principle, which computes the fundamental scattering $S$-matrix. We show how the algorithm could be scaled up to simulate collisions of large polyatomic molecules.
  arXiv  Detail & Related papers  (2023-04-12T18:10:47Z)
• Quantum Clustering with k-Means: a Hybrid Approach [117.4705494502186]
  We design, implement, and evaluate three hybrid quantum k-Means algorithms. We exploit quantum phenomena to speed up the computation of distances. We show that our hybrid quantum k-Means algorithms can be more efficient than the classical version.
  arXiv  Detail & Related papers  (2022-12-13T16:04:16Z)
• Quantum vs classical genetic algorithms: A numerical comparison shows faster convergence [0.0]
  We show that some quantum variants outperform all classical ones in convergence speed towards a near-to-optimal result. If this advantage holds for larger systems, quantum genetic algorithms would provide a new tool to address optimization problems with quantum computers.
  arXiv  Detail & Related papers  (2022-07-19T13:07:44Z)
• Multiple Query Optimization using a Hybrid Approach of Classical and Quantum Computing [1.7077661158850292]
  We tackle the multiple query optimization problem (MQO) which is an important NP-hard problem in the area of data-intensive problems. We propose a novel hybrid classical-quantum algorithm to solve the MQO on a gate-based quantum computer. Our algorithm shows a qubit efficiency of close to 99% which is almost a factor of 2 higher compared to the state of the art implementation.
  arXiv  Detail & Related papers  (2021-07-22T08:12:49Z)
• Adiabatic Quantum Graph Matching with Permutation Matrix Constraints [75.88678895180189]
  Matching problems on 3D shapes and images are frequently formulated as quadratic assignment problems (QAPs) with permutation matrix constraints, which are NP-hard. We propose several reformulations of QAPs as unconstrained problems suitable for efficient execution on quantum hardware. The proposed algorithm has the potential to scale to higher dimensions on future quantum computing architectures.
  arXiv  Detail & Related papers  (2021-07-08T17:59:55Z)
• QFold: Quantum Walks and Deep Learning to Solve Protein Folding [0.0]
  We develop quantum computational tools to predict how proteins fold in 3D. We explain how to combine recent deep learning advances with the well known technique of quantum walks applied to a Metropolis.
  arXiv  Detail & Related papers  (2021-01-25T18:00:03Z)
• An Application of Quantum Annealing Computing to Seismic Inversion [55.41644538483948]
  We apply a quantum algorithm to a D-Wave quantum annealer to solve a small scale seismic inversions problem. The accuracy achieved by the quantum computer is at least as good as that of the classical computer.
  arXiv  Detail & Related papers  (2020-05-06T14:18:44Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.