Integrating Machine Learning and Quantum Circuits for Proton Affinity Predictions
- URL: http://arxiv.org/abs/2411.17856v1
- Date: Tue, 26 Nov 2024 20:13:56 GMT
- Title: Integrating Machine Learning and Quantum Circuits for Proton Affinity Predictions
- Authors: Hongni Jin, Kenneth M. Merz Jr,
- Abstract summary: In the gas phase, the site of protonation is determined using proton affinity (PA) measurements.<n>We developed a fast and accurate method for PA prediction by using multiple descriptors in combination with machine learning (ML) models.<n>Our model demonstrated strong predictive performance, with an R2 of 0.96 and a MAE of 2.47kcal/mol, comparable to experimental uncertainty.
- Score: 0.0
- License: http://creativecommons.org/licenses/by-nc-nd/4.0/
- Abstract: A key step in interpreting gas-phase ion mobility coupled with mass spectrometry (IM-MS) data for unknown structure prediction involves identifying the most favorable protonated structure. In the gas phase, the site of protonation is determined using proton affinity (PA) measurements. Currently, mass spectrometry and ab initio computation methods are widely used to evaluate PA; however, both methods are resource-intensive and time-consuming. Therefore, there is a critical need for efficient methods to estimate PA, enabling the rapid identification of the most favorable protonation site in complex organic molecules with multiple proton binding sites. In this work, we developed a fast and accurate method for PA prediction by using multiple descriptors in combination with machine learning (ML) models. Using a comprehensive set of 186 descriptors, our model demonstrated strong predictive performance, with an R2 of 0.96 and a MAE of 2.47kcal/mol, comparable to experimental uncertainty. Furthermore, we designed quantum circuits as feature encoders for a classical neural network. To evaluate the effectiveness of this hybrid quantum-classical model, we compared its performance with traditional ML models using a reduced feature set derived from the full set. The result showed that this hybrid model achieved consistent performance comparable to traditional ML models with the same reduced feature set on both a noiseless simulator and real quantum hardware, highlighting the potential of quantum machine learning for accurate and efficient PA predictions.
Related papers
- Simulating Neutron Scattering on an Analog Quantum Processor [0.0]
We present a method for simulating neutron scattering on QuEra's Aquila processor.
We provide numerical simulations and experimental results for the performance of the procedure on the hardware.
We also confirm bipartite entanglement in the system experimentally.
arXiv Detail & Related papers (2024-10-04T22:39:29Z) - Configuration Interaction Guided Sampling with Interpretable Restricted Boltzmann Machine [1.0470286407954037]
We propose a data-driven approach using a Restricted Boltzmann Machine (RBM) to solve the Schr"odinger equation in configuration space.<n>Our approach extends the use of a generative model such as the RBM by incorporating a taboo list strategy to enhance efficiency and convergence.
arXiv Detail & Related papers (2024-09-10T01:42:10Z) - Ground state-based quantum feature maps [17.857341127079305]
We introduce a quantum data embedding protocol based on the preparation of a ground state of a parameterized Hamiltonian.
We show that ground state embeddings can be described effectively by a spectrum with degree that grows rapidly with the number of qubits.
arXiv Detail & Related papers (2024-04-10T17:17:05Z) - A Multi-Grained Symmetric Differential Equation Model for Learning Protein-Ligand Binding Dynamics [73.35846234413611]
In drug discovery, molecular dynamics (MD) simulation provides a powerful tool for predicting binding affinities, estimating transport properties, and exploring pocket sites.
We propose NeuralMD, the first machine learning (ML) surrogate that can facilitate numerical MD and provide accurate simulations in protein-ligand binding dynamics.
We demonstrate the efficiency and effectiveness of NeuralMD, achieving over 1K$times$ speedup compared to standard numerical MD simulations.
arXiv Detail & Related papers (2024-01-26T09:35:17Z) - Machine Learning Aided Dimensionality Reduction towards a Resource
Efficient Projective Quantum Eigensolver [0.0]
Recently developed Projective Quantum Eigensolver (PQE) has been demonstrated as an elegant methodology to compute the ground state energy of molecular systems.
We have exploited the collective interplay of these two sets of parameters via machine learning techniques to bring out the synergistic inter-relationship.
arXiv Detail & Related papers (2023-03-20T16:49:56Z) - Importance sampling for stochastic quantum simulations [68.8204255655161]
We introduce the qDrift protocol, which builds random product formulas by sampling from the Hamiltonian according to the coefficients.
We show that the simulation cost can be reduced while achieving the same accuracy, by considering the individual simulation cost during the sampling stage.
Results are confirmed by numerical simulations performed on a lattice nuclear effective field theory.
arXiv Detail & Related papers (2022-12-12T15:06:32Z) - Photonic Quantum Computing For Polymer Classification [62.997667081978825]
Two polymer classes visual (VIS) and near-infrared (NIR) are defined based on the size of the polymer gaps.
We present a hybrid classical-quantum approach to the binary classification of polymer structures.
arXiv Detail & Related papers (2022-11-22T11:59:52Z) - Well-conditioned multi-product formulas for hardware-friendly
Hamiltonian simulation [1.433758865948252]
We show how to design MPFs that do not amplify the hardware and sampling errors, and demonstrate their performance.
We observe an error reduction of up to an order of magnitude when compared to a product formula approach by suppressing hardware noise with Pauli Twirling, pulse efficient transpilation, and a novel zero-noise extrapolation based on scaled cross-resonance pulses.
arXiv Detail & Related papers (2022-07-22T18:00:05Z) - Generalization Metrics for Practical Quantum Advantage in Generative
Models [68.8204255655161]
Generative modeling is a widely accepted natural use case for quantum computers.
We construct a simple and unambiguous approach to probe practical quantum advantage for generative modeling by measuring the algorithm's generalization performance.
Our simulation results show that our quantum-inspired models have up to a $68 times$ enhancement in generating unseen unique and valid samples.
arXiv Detail & Related papers (2022-01-21T16:35:35Z) - Quantum-Classical Hybrid Algorithm for the Simulation of All-Electron
Correlation [58.720142291102135]
We present a novel hybrid-classical algorithm that computes a molecule's all-electron energy and properties on the classical computer.
We demonstrate the ability of the quantum-classical hybrid algorithms to achieve chemically relevant results and accuracy on currently available quantum computers.
arXiv Detail & Related papers (2021-06-22T18:00:00Z) - Quantum Variational Learning of the Entanglement Hamiltonian [0.0]
Learning the structure of the entanglement Hamiltonian (EH) is central to characterizing quantum many-body states in analog quantum simulation.
We describe a protocol where spatial deformations of the many-body Hamiltonian, physically realized on the quantum device, serve as an efficient variational ansatz for a local EH.
We simulate the protocol for the ground state of Fermi-Hubbard models in quasi-1D geometries, finding excellent agreement of the EH with Bisognano-Wichmann predictions.
arXiv Detail & Related papers (2021-05-10T12:54:50Z) - Benchmarking adaptive variational quantum eigensolvers [63.277656713454284]
We benchmark the accuracy of VQE and ADAPT-VQE to calculate the electronic ground states and potential energy curves.
We find both methods provide good estimates of the energy and ground state.
gradient-based optimization is more economical and delivers superior performance than analogous simulations carried out with gradient-frees.
arXiv Detail & Related papers (2020-11-02T19:52:04Z) - Preparation of excited states for nuclear dynamics on a quantum computer [117.44028458220427]
We study two different methods to prepare excited states on a quantum computer.
We benchmark these techniques on emulated and real quantum devices.
These findings show that quantum techniques designed to achieve good scaling on fault tolerant devices might also provide practical benefits on devices with limited connectivity and gate fidelity.
arXiv Detail & Related papers (2020-09-28T17:21:25Z)
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.