Multi-QIDA method for VQE state preparation in molecular systems

• URL: http://arxiv.org/abs/2508.11270v1
• Date: Fri, 15 Aug 2025 07:08:54 GMT
• Title: Multi-QIDA method for VQE state preparation in molecular systems
• Authors: Fabio Tarocco, Davide Materia, Leonardo Ratini, Leonardo Guidoni,
• Abstract summary: Variational Quantum Eigensolver (VQE) is a hybrid quantum-classical algorithm designed to estimate ground-state energies of molecular systems.<n>We build correlation-driven circuits using Quantum Mutual Information (QMI) to construct shallow, layered quantum circuits.<n>We benchmark Multi-QIDA on systems ranging from small molecules like H2O, BeH2, and NH3 in Iterative Natural Orbitals (INOs) basis set, to active-space models such as H2O-6-31G-CAS(4,4) and N2-cc-pVTZ-CAS(6,6)
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: The development of quantum algorithms and their application to quantum chemistry has introduced new opportunities for solving complex molecular problems that are computationally infeasible for classical methods. In quantum chemistry, the Variational Quantum Eigensolver (VQE) is a hybrid quantum-classical algorithm designed to estimate ground-state energies of molecular systems. Despite its promise, VQE faces challenges such as scalability issues, high circuit depths, and barren plateaus that make the optimization of the variational wavefunction. To mitigate these challenges, the Quantum Information Driven Ansatz (QIDA) leverages Quantum Mutual Information (QMI) to construct compact, correlation-driven circuits. In this work, we go back to the original field of application of QIDA, by applying the already defined Multi-Threshold Quantum Information Driven Ansatz (Multi-QIDA) methodology on Molecular Systems. to systematically construct shallow, layered quantum circuits starting from approximate QMI matrices obtained by Quantum Chemistry calculations. The Multi-QIDA approach combines efficient creation of the QMI map, reduction of the number of correlators required by exploiting Minimum/Maximum spanning tress, and an iterative layer-wise VQE optimization routine. These enhancements allow the method to recover missing correlations in molecular systems while maintaining computational efficiency. Additionally, the approach incorporates alternative gate constructions, such as SO(4) correlators, to enhance the circuit expressibility without significantly increasing the circuit complexity. We benchmark Multi-QIDA on systems ranging from small molecules like H2O, BeH2, and NH3 in Iterative Natural Orbitals (INOs) basis set, to active-space models such as H2O-6-31G-CAS(4,4) and N2-cc-pVTZ-CAS(6,6), comparing it to traditional hardware-efficient ansatze.

Related papers

• Hybrid Quantum Algorithms for Computational Chemistry: Application to the Pyridine-Li ion Complex [0.0]
  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.
  arXiv  Detail & Related papers  (2026-01-15T02:23:09Z)
• 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)
• 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)
• An Introduction to Variational Quantum Eigensolver Applied to Chemistry [0.0]
  Variational Quantum Algorithms (VQAs) stand out as a feasible approach to demonstrating advantages over classical methods in the near term.<n>We present the application of quantum mechanics to the study of molecules, provide an introduction to the fundamentals of quantum computing, and explore the integration of these fields by employing the VQE in molecular simulations.
  arXiv  Detail & Related papers  (2025-05-07T19:46:15Z)
• Auxiliary-field quantum Monte Carlo method with quantum selected configuration interaction [0.0]
  We propose using the wave function generated by the quantum selected configuration interaction (QSCI) method as the trial wave function in phaseless auxiliary-field quantum Monte Carlo (ph-AFQMC)<n>We call this integrated approach QC-QSCI-AFQMC, or QSCI-AFQMC for short. This method is validated across several molecular systems.
  arXiv  Detail & Related papers  (2025-02-28T14:12:37Z)
• Solving Drone Routing Problems with Quantum Computing: A Hybrid Approach Combining Quantum Annealing and Gate-Based Paradigms [34.4581898633922]
  The proposed method, coined Quantum for Drone Routing (Q4DR), integrates the two most prominent paradigms in the field.<n>The efficacy of Q4DR is demonstrated through three use cases of increasing complexity.
  arXiv  Detail & Related papers  (2025-01-30T15:38:40Z)
• Variational Quantum Subspace Construction via Symmetry-Preserving Cost Functions [39.58317527488534]
  We propose a variational strategy based on symmetry-preserving cost functions to iteratively construct a reduced subspace for extraction of low-lying energy states.<n>As a proof of concept, we test the proposed algorithms on H4 chain and ring, targeting both the ground-state energy and the charge gap.
  arXiv  Detail & Related papers  (2024-11-25T20:33:47Z)
• 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 Subroutine for Variance Estimation: Algorithmic Design and Applications [80.04533958880862]
  Quantum computing sets the foundation for new ways of designing algorithms. New challenges arise concerning which field quantum speedup can be achieved. Looking for the design of quantum subroutines that are more efficient than their classical counterpart poses solid pillars to new powerful quantum algorithms.
  arXiv  Detail & Related papers  (2024-02-26T09:32:07Z)
• Measurement-based infused circuits for variational quantum eigensolvers [1.732837834702512]
  Variational quantum eigensolvers (VQEs) are successful algorithms for studying physical systems on quantum computers. In this work, we incorporate such ideas into traditional VQE circuits. We showcase our approach on real superconducting quantum computers by performing VQE simulations of testbed systems.
  arXiv  Detail & Related papers  (2023-05-30T16:45:54Z)
• QNEAT: Natural Evolution of Variational Quantum Circuit Architecture [95.29334926638462]
  We focus on variational quantum circuits (VQC), which emerged as the most promising candidates for the quantum counterpart of neural networks. Although showing promising results, VQCs can be hard to train because of different issues, e.g., barren plateau, periodicity of the weights, or choice of architecture. We propose a gradient-free algorithm inspired by natural evolution to optimize both the weights and the architecture of the VQC.
  arXiv  Detail & Related papers  (2023-04-14T08:03:20Z)
• A self-consistent field approach for the variational quantum eigensolver: orbital optimization goes adaptive [52.77024349608834]
  We present a self consistent field approach (SCF) within the Adaptive Derivative-Assembled Problem-Assembled Ansatz Variational Eigensolver (ADAPTVQE) This framework is used for efficient quantum simulations of chemical systems on nearterm quantum computers.
  arXiv  Detail & Related papers  (2022-12-21T23:15:17Z)
• 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)
• Variational Quantum Eigensolver with Reduced Circuit Complexity [3.1158760235626946]
  We present a novel approach to reduce quantum circuit complexity in VQE for electronic structure calculations. Our algorithm, called ClusterVQE, splits the initial qubit space into subspaces (qubit clusters) which are further distributed on individual quantum circuits. The new algorithm simultaneously reduces the number of qubits and circuit depth, making it a potential leader for quantum chemistry simulations on NISQ devices.
  arXiv  Detail & Related papers  (2021-06-14T17:23:46Z)

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.