Predicting toxicity by quantum machine learning

• URL: http://arxiv.org/abs/2008.07715v3
• Date: Wed, 16 Dec 2020 02:34:45 GMT
• Title: Predicting toxicity by quantum machine learning
• Authors: Teppei Suzuki, Michio Katouda
• Abstract summary: We develop QML models for predicting the toxicity of 221 phenols on the basis of quantitative structure activity relationship. Results suggest that our data encoding enhanced by quantum entanglement provided more expressive power than the previous ones.
• Score: 11.696069523681178
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In recent years, parameterized quantum circuits have been regarded as machine learning models within the framework of the hybrid quantum-classical approach. Quantum machine learning (QML) has been applied to binary classification problems and unsupervised learning. However, practical quantum application to nonlinear regression tasks has received considerably less attention. Here, we develop QML models designed for predicting the toxicity of 221 phenols on the basis of quantitative structure activity relationship. The results suggest that our data encoding enhanced by quantum entanglement provided more expressive power than the previous ones, implying that quantum correlation could be beneficial for the feature map representation of classical data. Our QML models performed significantly better than the multiple linear regression method. Furthermore, our simulations indicate that the QML models were comparable to those obtained using radial basis function networks, while improving the generalization performance. The present study implies that QML could be an alternative approach for nonlinear regression tasks such as cheminformatics.

Related papers

• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Higher order quantum reservoir computing for non-intrusive reduced-order models [0.0]
  Quantum reservoir computing technique (QRC) is a hybrid quantum-classical framework employing an ensemble of interconnected small quantum systems. We show that QRC is able to predict complex nonlinear dynamical systems in a stable and accurate manner.
  arXiv  Detail & Related papers  (2024-07-31T13:37:04Z)
• Weight Re-Mapping for Variational Quantum Algorithms [54.854986762287126]
  We introduce the concept of weight re-mapping for variational quantum circuits (VQCs) We employ seven distinct weight re-mapping functions to assess their impact on eight classification datasets. Our results indicate that weight re-mapping can enhance the convergence speed of the VQC.
  arXiv  Detail & Related papers  (2023-06-09T09:42:21Z)
• Classical-to-Quantum Transfer Learning Facilitates Machine Learning with Variational Quantum Circuit [62.55763504085508]
  We prove that a classical-to-quantum transfer learning architecture using a Variational Quantum Circuit (VQC) improves the representation and generalization (estimation error) capabilities of the VQC model. We show that the architecture of classical-to-quantum transfer learning leverages pre-trained classical generative AI models, making it easier to find the optimal parameters for the VQC in the training stage.
  arXiv  Detail & Related papers  (2023-05-18T03:08:18Z)
• Problem-Dependent Power of Quantum Neural Networks on Multi-Class Classification [83.20479832949069]
  Quantum neural networks (QNNs) have become an important tool for understanding the physical world, but their advantages and limitations are not fully understood. Here we investigate the problem-dependent power of QCs on multi-class classification tasks. Our work sheds light on the problem-dependent power of QNNs and offers a practical tool for evaluating their potential merit.
  arXiv  Detail & Related papers  (2022-12-29T10:46:40Z)
• Reflection Equivariant Quantum Neural Networks for Enhanced Image Classification [0.7232471205719458]
  We build new machine learning models which explicitly respect the symmetries inherent in their data, so-called geometric quantum machine learning (GQML) We find that these networks are capable of consistently and significantly outperforming generic ansatze on complicated real-world image datasets.
  arXiv  Detail & Related papers  (2022-12-01T04:10:26Z)
• Subtleties in the trainability of quantum machine learning models [0.0]
  We show that gradient scaling results for Variational Quantum Algorithms can be applied to study the gradient scaling of Quantum Machine Learning models. Our results indicate that features deemed detrimental for VQA trainability can also lead to issues such as barren plateaus in QML.
  arXiv  Detail & Related papers  (2021-10-27T20:28:53Z)
• Online Target Q-learning with Reverse Experience Replay: Efficiently finding the Optimal Policy for Linear MDPs [50.75812033462294]
  We bridge the gap between practical success of Q-learning and pessimistic theoretical results. We present novel methods Q-Rex and Q-RexDaRe. We show that Q-Rex efficiently finds the optimal policy for linear MDPs.
  arXiv  Detail & Related papers  (2021-10-16T01:47:41Z)
• Structural risk minimization for quantum linear classifiers [0.0]
  Quantum machine learning (QML) stands out as one of the typically highlighted candidates for quantum computing's near-term "killer application" We investigate capacity measures of two closely related QML models called explicit and implicit quantum linear classifiers. We identify that the rank and Frobenius norm of the observables used in the QML model closely control the model's capacity.
  arXiv  Detail & Related papers  (2021-05-12T10:39:55Z)
• Quantum Machine Learning with SQUID [64.53556573827525]
  We present the Scaled QUantum IDentifier (SQUID), an open-source framework for exploring hybrid Quantum-Classical algorithms for classification problems. We provide examples of using SQUID in a standard binary classification problem from the popular MNIST dataset.
  arXiv  Detail & Related papers  (2021-04-30T21:34:11Z)

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.