1 February 2019 in Applied Ergonomics
23 August 2021 in IEEE Transactions on Quantum Engineering
Existing drug discovery pipelines take 5–10 years and cost billions of dollars. Computational approaches aim to sample from regions of the whole molecular and solid-state compounds called chemical space, which could be on the order of $10^{60}$ . Deep generative models can model the underlying probability distribution of both the physical structures and property of drugs and relate them nonlinearly. By exploiting patterns in massive datasets, these models can distill salient features that characterize the molecules. Generative adversarial networks (GANs) discover drug candidates by generating molecular structures that obey chemical and physical properties and show affinity toward binding with the receptor for a target disease. However, classical GANs cannot explore certain regions of the chemical space and suffer from training instabilities. The practical utility of such models is limited due to the vast size of the search space, characterized by millions of parameters. A full quantum GAN may require more than 90 qubits even to generate small molecules with up to nine heavy atoms. The proposed quantum GAN with a hybrid generator (QGAN-HG) model is composed of a hybrid quantum generator that supports various number of qubits and quantum circuit layers, and a classical discriminator. The QGAN-HG with less than 20% of the original parameters can learn molecular distributions as efficiently as its classical counterpart. Another extended version of the proposed QGAN-HG, which utilizes multiple quantum subcircuits, considerably accelerates our standard QGAN-HG training process and avoids the potential gradient vanishing issue of deep neural networks.
5 October 2022 in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Quantum approximate optimization algorithm (QAOA) is a promising hybrid quantum-classical algorithm for solving combinatorial optimization problems. However, it cannot overcome qubit limitation for large-scale problems. Furthermore, the simulation time of QAOA scales poorly with the problem size. We propose a divide-and-conquer QAOA (DC-QAOA) to address the above challenges for graph maximum cut (MaxCut) problem. The algorithm works by recursively partitioning a larger graph into smaller ones whose MaxCut solutions are obtained with small-size noisy intermediate-scale quantum computers. The overall solution is retrieved from the subsolutions by applying the combination policy of measurement distribution reconstruction (MDR). The solution quality depends on the graph partitioning algorithm and MDR policy. Multiple partitioning and reconstruction methods are proposed and compared. Results are evaluated by metrics, such as quantum program runtime, measurement expectation value (EV), and approximation ratio (AR). The results show that DC-QAOA achieves 97.14% AR (20.32% higher than classical counterpart), and 94.79% EV (15.80% higher than quantum annealing). DC-QAOA solves large-scale graph instances with a polynomial rate or returns unsuccessful partition if graph connectivity requirement is not fulfilled otherwise.
22 May 2023 in IEEE Access
Quantum Machine Learning (QML) is a new domain of Machine Learning (ML) and Quantum Computing (QC) that uses a trainable Variational Quantum Circuit (VQC) to solve various learning problems. Classical data is transformed to the quantum Hilbert space using an embedding scheme and the VQC performs quantum operations on this transformed quantum data using parametric quantum gates. In this work, we present a new embedding scheme using Quantum Random Access Memory (QRAM) that takes address as input, and gives data as the output similar to a classical Random Access Memory (RAM). We propose a basic circuit-based QRAM architecture and its application in, (a) storage for ML usage and, (b) storage of binary data. For ML, we store images of digits dataset into the QRAM and perform binary classification using a Quantum Neural Network (QNN). We observe that QNN driven by the proposed QRAM converges faster (at 6 th epoch) with 100% classification accuracy compared to QNN with normal embedding and classical Fully Connected Neural Network (FCNN) setups which converge with same accuracy at around 10 th and 15 th epochs, respectively. We obtain ≈ 63% classification accuracy on real hardware from IBM. For storage of binary data, we measure Hamming Distance (HD) and percentage correct predictions for quality evaluation of the proposed QRAM. We observe that the HD and percentage correct predictions worsens as the number of address lines increases. We propose two techniques to improve the QRAM accuracy namely, (i) clustering of raw data and allocating one QRAM per cluster and, (ii) bit splitting to divide wider data into smaller chunks and allocating one QRAM per split. Clustering provides best results by improving the HD for 9-address QRAM by ≈1.95X than pure QRAM and ≈1.74X improvement compared to bit-split (which provides ≈1.11X improvement than pure QRAM).
1 June 2023 in Frontiers in Molecular Medicine
Drug targets are the main focus of drug discovery due to their key role in disease pathogenesis. Computational approaches are widely applied to drug development because of the increasing availability of biological molecular datasets. Popular generative approaches can create new drug molecules by learning the given molecule distributions. However, these approaches are mostly not for target-specific drug discovery. We developed an energy-based probabilistic model for computational target-specific drug discovery. Results show that our proposed TagMol can generate molecules with similar binding affinity scores as real molecules. GAT-based models showed faster and better learning relative to Graph Convolutional Network baseline models.