Hybrid Quantum Algorithms for Computational Chemistry: Application to the Pyridine-Li ion Complex

• URL: http://arxiv.org/abs/2601.10002v1
• Date: Thu, 15 Jan 2026 02:23:09 GMT
• Title: Hybrid Quantum Algorithms for Computational Chemistry: Application to the Pyridine-Li ion Complex
• Authors: Fatemeh Ghasemi, Yousung Kang, Yukio Kawashima, Kyungsun Moon,
• Abstract summary: Three quantum algorithms are investigated for capturing electron correlation in large-scale molecular systems.<n>Results show how new generations of hybrid quantum-classical frameworks overcome the scalability and noise sensitivity that constrain conventional VQE approaches.<n>Both SQD and HI-VQE exhibit robustness against hardware noise, a critical improvement over earlier approaches.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Accurately capturing electron correlation in large-scale molecular systems remains one of the foremost challenges in quantum chemistry and a primary driver for the development of quantum algorithms. Classical configuration-interaction methods, while rigorous, suffer from exponential scaling, rendering them impractical for large or strongly correlated systems. Overcoming this limitation is central to realizing the promise of quantum computing in chemistry. Here, we investigate the pyridine-Li ion complex using three quantum algorithms: the variational quantum eigensolver (VQE), the subspace quantum diagonalization (SQD) method, and the recently introduced handover iterative VQE (HI-VQE). Our results demonstrate how new generations of hybrid quantum-classical frameworks overcome the scalability and noise sensitivity that constrain conventional VQE approaches. SQD and HI-VQE achieve ground-state energy calculations for problem sizes inaccessible to classical computation, marking a clear advance toward quantum advantage. In particular, HI-VQE enables calculations within active spaces as large as (24e,22o), requiring 44 qubits-well beyond the reach of classical CASCI and VQE. This capability provides a systematic pathway for incorporating increasing numbers of electrons into quantum treatment, thereby approaching exact molecular energies. Importantly, both SQD and HI-VQE exhibit robustness against hardware noise, a critical improvement over earlier approaches. By enabling quantum simulations of molecular systems previously deemed intractable, SQD and HI-VQE offer a realistic route toward practical quantum advantage in computational chemistry. The comparison between HI-VQE and SQD shows that optimizing circuit parameters is crucial for accurate simulation.

Related papers

• Adiabatic-Inspired Hybrid Quantum-Classical Methods for Molecular Ground State Preparation [0.03499870393443268]
  Quantum computing promises to efficiently and accurately solve important problems in quantum chemistry.<n>Two leading methods in solving the ground-state problem of quantum computing struggle with convergence.<n>We introduce a novel hybrid approach which generalizes the AQC-PQC method and combines abaticatic BFGS, reducing the quantum computational cost.
  arXiv  Detail & Related papers  (2025-12-16T14:35:58Z)
• Qumode-Based Variational Quantum Eigensolver for Molecular Excited States [43.148034499498586]
  We introduce the Qumode Subspace Variational Quantum Eigensolver (QSS-VQE), a hybrid quantum-classical algorithm for computing molecular excited states.<n>We demonstrate the performance of QSS-VQE through simulations of molecular excited states, including dihydrogen and a conical intersection in cytosine.
  arXiv  Detail & Related papers  (2025-09-05T00:53:51Z)
• VQC-MLPNet: An Unconventional Hybrid Quantum-Classical Architecture for Scalable and Robust Quantum Machine Learning [50.95799256262098]
  Variational quantum circuits (VQCs) hold promise for quantum machine learning but face challenges in expressivity, trainability, and noise resilience.<n>We propose VQC-MLPNet, a hybrid architecture where a VQC generates the first-layer weights of a classical multilayer perceptron during training, while inference is performed entirely classically.
  arXiv  Detail & Related papers  (2025-06-12T01:38:15Z)
• RhoDARTS: Differentiable Quantum Architecture Search with Density Matrix Simulations [44.13836547616739]
  Variational Quantum Algorithms (VQAs) are a promising approach to leverage Noisy Intermediate-Scale Quantum (NISQ) computers.<n> choosing optimal quantum circuits that efficiently solve a given VQA problem is a non-trivial task.<n>Quantum Architecture Search (QAS) algorithms enable automatic generation of quantum circuits tailored to the provided problem.
  arXiv  Detail & Related papers  (2025-06-04T08:30:35Z)
• Quantum QSAR for drug discovery [41.94295877935867]
  Quantitative Structure-Activity Relationship (QSAR) modeling is key in drug discovery.<n>This research proposes enhancing QSAR techniques through Quantum Support Vector Machines (QSVMs)<n>By using quantum data encoding and quantum kernel functions, we aim to develop more accurate and efficient predictive models.
  arXiv  Detail & Related papers  (2025-05-06T17:58:33Z)
• HIVQE: Handover Iterative Variational Quantum Eigensolver for Efficient Quantum Chemistry Calculations [0.18574358541506214]
  The Handover Iterative Variational Quantum Eigensolver (HiVQE) is designed to accurately estimate ground-state wavefunctions.<n>By generating compact yet chemically accurate wavefunctions, HiVQE advances quantum chemistry simulations and facilitates the discovery of novel materials.
  arXiv  Detail & Related papers  (2025-03-08T17:50:56Z)
• Efficient Quantum Chemistry Calculations on Noisy Quantum Hardware [0.0]
  We present a hardware-efficient optimization scheme for quantum chemistry calculations.<n>Our algorithm, optimized SQD (SQDOpt), combines the classical Davidson method technique with added multi-basis measurements.<n>A runtime scaling indicates that SQDOpt on quantum hardware is competitive with classical state-of-the-art methods.
  arXiv  Detail & Related papers  (2025-03-04T16:51:54Z)
• Non-unitary Coupled Cluster Enabled by Mid-circuit Measurements on Quantum Computers [37.69303106863453]
  We propose a state preparation method based on coupled cluster (CC) theory, which is a pillar of quantum chemistry on classical computers. Our approach leads to a reduction of the classical computation overhead, and the number of CNOT and T gates by 28% and 57% on average.
  arXiv  Detail & Related papers  (2024-06-17T14:10:10Z)
• Quantum Imitation Learning [74.15588381240795]
  We propose quantum imitation learning (QIL) with a hope to utilize quantum advantage to speed up IL. We develop two QIL algorithms, quantum behavioural cloning (Q-BC) and quantum generative adversarial imitation learning (Q-GAIL) Experiment results demonstrate that both Q-BC and Q-GAIL can achieve comparable performance compared to classical counterparts.
  arXiv  Detail & Related papers  (2023-04-04T12:47:35Z)
• Hybrid Quantum Classical Simulations [0.0]
  We report on two major hybrid applications of quantum computing, namely, the quantum approximate optimisation algorithm (QAOA) and the variational quantum eigensolver (VQE) Both are hybrid quantum classical algorithms as they require incremental communication between a classical central processing unit and a quantum processing unit to solve a problem.
  arXiv  Detail & Related papers  (2022-10-06T10:49:15Z)
• Exploring the scaling limitations of the variational quantum eigensolver with the bond dissociation of hydride diatomic molecules [0.0]
  Materials simulations involving strongly correlated electrons pose fundamental challenges to state-of-the-art electronic structure methods. No quantum computer has simulated a molecule of a size and complexity relevant to real-world applications, despite the fact that the variational quantum eigensolver algorithm can predict chemically accurate total energies. We show that the inclusion of d-orbitals and the use of the UCCSD ansatz, which are both necessary to capture the correct TiH physics, dramatically increase the cost of this problem.
  arXiv  Detail & Related papers  (2022-08-15T19:21:17Z)
• Quantum circuit architecture search for variational quantum algorithms [88.71725630554758]
  We propose a resource and runtime efficient scheme termed quantum architecture search (QAS) QAS automatically seeks a near-optimal ansatz to balance benefits and side-effects brought by adding more noisy quantum gates. We implement QAS on both the numerical simulator and real quantum hardware, via the IBM cloud, to accomplish data classification and quantum chemistry tasks.
  arXiv  Detail & Related papers  (2020-10-20T12:06:27Z)

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.