Quantum Approximate Optimization Algorithms for Molecular Docking

• URL: http://arxiv.org/abs/2503.04239v1
• Date: Thu, 06 Mar 2025 09:20:41 GMT
• Title: Quantum Approximate Optimization Algorithms for Molecular Docking
• Authors: Christos Papalitsas, Yanfei Guan, Shreyas Waghe, Athanasios Liakos, Ioannis Balatsos, Vassilios Pantazopoulos,
• Abstract summary: Quantum Approximate Optimization Algorithm (QAOA) and its variations are hybrid classical-quantum techniques.<n>This paper presents a Digitized Counterdiabatic QAOA (DC-QAOA) approach to molecular docking.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Molecular docking is a critical process for drug discovery and challenging due to the complexity and size of biomolecular systems, where the optimal binding configuration of a drug to a target protein is determined. Hybrid classical-quantum computing techniques offer a novel approach to address these challenges. The Quantum Approximate Optimization Algorithm (QAOA) and its variations are hybrid classical-quantum techniques, and a promising tool for combinatorial optimization challenges. This paper presents a Digitized Counterdiabatic QAOA (DC-QAOA) approach to molecular docking. Simulated quantum runs were conducted on a GPU cluster. We examined 14 and 17 nodes instances - to the best of our knowledge the biggest published instance is 12-node at Ding et al. and we present the results. Based on computational results, we conclude that binding interactions represent the anticipated exact solution. Additionally, as the size of the examined instance increases, the computational times exhibit a significant escalation.

Related papers

• Quantum Approximate Optimisation Applied to Graph Similarity [0.0]
  We introduce a novel quantum optimisation simulation package facilitating investigation of all constituent components of the QAOA.<n>We investigate eight classical optimisation methods each at six levels of decomposition.<n>An encoding for permutation based problems such as graph similarity through edge overlap to the QAOA allows for significant quantum memory savings.
  arXiv  Detail & Related papers  (2024-12-23T06:04:08Z)
• Hybrid Quantum-HPC Solutions for Max-Cut: Bridging Classical and Quantum Algorithms [0.0]
  We develop a theoretical model to analyze the time complexity, scalability, and communication overhead in hybrid systems. We evaluate QAOA's performance on small-scale Max-Cut instances, benchmarking its runtime, solution accuracy, and resource utilization.
  arXiv  Detail & Related papers  (2024-10-21T04:10:54Z)
• Efficient charge-preserving excited state preparation with variational quantum algorithms [33.03471460050495]
  We introduce a charge-preserving VQD (CPVQD) algorithm, designed to incorporate symmetry and the corresponding conserved charge into the VQD framework. Results show applications in high-energy physics, nuclear physics, and quantum chemistry.
  arXiv  Detail & Related papers  (2024-10-18T10:30:14Z)
• Bias-field digitized counterdiabatic quantum optimization [39.58317527488534]
  We call this protocol bias-field digitizeddiabatic quantum optimization (BF-DCQO) Our purely quantum approach eliminates the dependency on classical variational quantum algorithms. It achieves scaling improvements in ground state success probabilities, increasing by up to two orders of magnitude.
  arXiv  Detail & Related papers  (2024-05-22T18:11:42Z)
• Automatic and effective discovery of quantum kernels [41.61572387137452]
  Quantum computing can empower machine learning models by enabling kernel machines to leverage quantum kernels for representing similarity measures between data.<n>We present an approach to this problem, which employs optimization techniques, similar to those used in neural architecture search and AutoML.<n>The results obtained by testing our approach on a high-energy physics problem demonstrate that, in the best-case scenario, we can either match or improve testing accuracy with respect to the manual design approach.
  arXiv  Detail & Related papers  (2022-09-22T16:42:14Z)
• Adiabatic Quantum Computing for Multi Object Tracking [170.8716555363907]
  Multi-Object Tracking (MOT) is most often approached in the tracking-by-detection paradigm, where object detections are associated through time. As these optimization problems are often NP-hard, they can only be solved exactly for small instances on current hardware. We show that our approach is competitive compared with state-of-the-art optimization-based approaches, even when using of-the-shelf integer programming solvers.
  arXiv  Detail & Related papers  (2022-02-17T18:59:20Z)
• A Hybrid Quantum-Classical Algorithm for Robust Fitting [47.42391857319388]
  We propose a hybrid quantum-classical algorithm for robust fitting. Our core contribution is a novel robust fitting formulation that solves a sequence of integer programs. We present results obtained using an actual quantum computer.
  arXiv  Detail & Related papers  (2022-01-25T05:59:24Z)
• Best-practice aspects of quantum-computer calculations: A case study of hydrogen molecule [0.0]
  We have performed an extensive series of simulations of quantum-computer runs aimed at inspecting best-practice aspects of these calculations. Applying variational quantum eigensolver (VQE) to a qubit Hamiltonian obtained by the Bravyi-Kitaev transformation we have analyzed the impact of various computational technicalities.
  arXiv  Detail & Related papers  (2021-12-02T13:21:10Z)
• Towards a Larger Molecular Simulation on the Quantum Computer: Up to 28 Qubits Systems Accelerated by Point Group Symmetry [8.078983761447118]
  A quantum-classical hybrid optimization scheme known as the variational quantum eigensolver(VQE) is preferred for noisy intermediate-scale quantum devices. In this work, we employ the point group symmetry to reduce the number of operators in constructing ansatz so as to achieve a more compact quantum circuit. A significant reduction of up to 82% of the operator numbers is reached on C2H4, which enables the largest molecule ever numerically simulated by VQE-UCC.
  arXiv  Detail & Related papers  (2021-09-05T16:04:14Z)
• Fixed Depth Hamiltonian Simulation via Cartan Decomposition [59.20417091220753]
  We present a constructive algorithm for generating quantum circuits with time-independent depth. We highlight our algorithm for special classes of models, including Anderson localization in one dimensional transverse field XY model. In addition to providing exact circuits for a broad set of spin and fermionic models, our algorithm provides broad analytic and numerical insight into optimal Hamiltonian simulations.
  arXiv  Detail & Related papers  (2021-04-01T19:06:00Z)
• MoG-VQE: Multiobjective genetic variational quantum eigensolver [0.0]
  Variational quantum eigensolver (VQE) emerged as a first practical algorithm for near-term quantum computers. Here, we propose the approach which can combine both low depth and improved precision. We observe nearly ten-fold reduction in the two-qubit gate counts as compared to the standard hardware-efficient ansatz.
  arXiv  Detail & Related papers  (2020-07-08T20:44:50Z)
• Hartree-Fock on a superconducting qubit quantum computer [30.152226344347064]
  Here, we perform a series of quantum simulations of chemistry the largest of which involved a dozen qubits, 78 two-qubit gates, and 114 one-qubit gates. We model the binding energy of $rm H_6$, $rm H_8$, $rm H_10$ and $rm H_12$ chains as well as the isomerization of diazene. We also demonstrate error-mitigation strategies based on $N$-representability which dramatically improve the effective fidelity of our experiments.
  arXiv  Detail & Related papers  (2020-04-08T18:00:06Z)

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.