From VQE To SQD: Modern Quantum Algorithms For The Electronic Structure Problem

• URL: http://arxiv.org/abs/2509.21555v1
• Date: Thu, 25 Sep 2025 20:39:14 GMT
• Title: From VQE To SQD: Modern Quantum Algorithms For The Electronic Structure Problem
• Authors: Abdelmouheymen Rabah Khamadja, Mohamed Taha Rouabah,
• Abstract summary: This thesis investigates sampling-based quantum algorithms for electronic ground state energy estimation.<n>It focuses on Quantum-Selected Configuration Interaction (QSCI) and Sample-Based Quantum Diagonalization (SQD) as near-term alternatives to the Variational Quantum Eigensolver (VQE)<n>The analysis is validated through simulations, hardware-calibrated noisy studies, and execution on IBM's 127-qubit IBM Brisbane processor.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: This thesis investigates sampling-based quantum algorithms for electronic ground state energy estimation, focusing on Quantum-Selected Configuration Interaction (QSCI) and Sample-Based Quantum Diagonalization (SQD) as near-term alternatives to the Variational Quantum Eigensolver (VQE). Unlike VQE, which suffers from barren plateaus and high measurement costs, these methods avoid variational optimization by sampling Slater determinants from quantum hardware and performing diagonalization classically. The central contribution is the first analytical expression for the sampling bottleneck: the determinant-discovery step is mapped to the classical coupon-collector problem, yielding both an exact formula and a scalable lower-bound estimator for the number of measurements required to recover all determinants contributing to the ground state. Previous work only relied on numerical sampling and estimation. The analysis is validated through simulations, hardware-calibrated noisy studies, and execution on IBM's 127-qubit IBM Brisbane processor, demonstrating the dominant role of sampling efficiency in the near-term feasibility of QSCI and SQD. This work was carried out under the supervision of Dr. Mohamed Taha Rouabah.

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)
• Continual Quantum Architecture Search with Tensor-Train Encoding: Theory and Applications to Signal Processing [68.35481158940401]
  CL-QAS is a continual quantum architecture search framework.<n>It mitigates challenges of costly encoding amplitude and forgetting in variational quantum circuits.<n>It achieves controllable robustness expressivity, sample-efficient generalization, and smooth convergence without barren plateaus.
  arXiv  Detail & Related papers  (2026-01-10T02:36:03Z)
• Basis Adaptive Algorithm for Quantum Many-Body Systems on Quantum Computers [2.4713653282916126]
  A new basis adaptive algorithm is introduced to efficiently find the ground-state properties of quantum many-body systems.<n>We benchmark this approach on the spin-1/2 XXZ chain up to 24 qubits using the IBM Heron processor.
  arXiv  Detail & Related papers  (2025-12-14T16:34:19Z)
• Cyclic Variational Quantum Eigensolver: Escaping Barren Plateaus through Staircase Descent [4.517663944296433]
  We introduce the Cyclic Variational Quantum Eigensolver (CVQE), a hardware-efficient framework for accurate ground-state quantum simulation.<n>CVQE departs from conventional VQE by incorporating a measurement-driven feedback cycle.<n>We show that CVQE consistently maintains chemical precision across correlation regimes, outperforms fixed UCCSD by several orders of magnitude, and achieves favorable accuracy-cost trade-offs.
  arXiv  Detail & Related papers  (2025-09-16T13:54:03Z)
• Calibration of Quantum Devices via Robust Statistical Methods [45.464983015777314]
  We numerically analyze advanced statistical methods for Bayesian inference against the state-of-the-art in quantum parameter learning.<n>We show advantages of these approaches over existing ones, namely under multi-modality and high dimensionality.<n>Our findings have applications in challenging quantumcharacterization tasks namely learning the dynamics of open quantum systems.
  arXiv  Detail & Related papers  (2025-07-09T15:22:17Z)
• 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 Early Investigation of the HHL Quantum Linear Solver for Scientific Applications [7.495181307075487]
  We explore using the Harrow-Hassidim-Lloyd (HHL) algorithm to address scientific and engineering problems through quantum computing.<n> Focusing on domains such as power-grid management and climate projection, we demonstrate the correlations of the accuracy of quantum phase estimation.<n>We summarize the exponential resource cost from quantum phase estimation before and after quantum error correction and illustrate a potential way to reduce the demands on physical qubits.
  arXiv  Detail & Related papers  (2024-04-29T19:21:38Z)
• A quantum information theoretic analysis of reinforcement learning-assisted quantum architecture search [0.0]
  This study investigates RL-QAS for crafting ansatz tailored to variational quantum state diagonalisation problem. We leverage these insights to devise an entanglement-guided admissible ansatz in QAS to diagonalise random quantum states using optimal resources.
  arXiv  Detail & Related papers  (2024-04-09T09:54:59Z)
• 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)
• Synergy Between Quantum Circuits and Tensor Networks: Short-cutting the Race to Practical Quantum Advantage [43.3054117987806]
  We introduce a scalable procedure for harnessing classical computing resources to provide pre-optimized initializations for quantum circuits. We show this method significantly improves the trainability and performance of PQCs on a variety of problems. By demonstrating a means of boosting limited quantum resources using classical computers, our approach illustrates the promise of this synergy between quantum and quantum-inspired models in quantum computing.
  arXiv  Detail & Related papers  (2022-08-29T15:24:03Z)
• Reducing the cost of energy estimation in the variational quantum eigensolver algorithm with robust amplitude estimation [50.591267188664666]
  Quantum chemistry and materials is one of the most promising applications of quantum computing. Much work is still to be done in matching industry-relevant problems in these areas with quantum algorithms that can solve them.
  arXiv  Detail & Related papers  (2022-03-14T16:51:36Z)
• Benchmarking adaptive variational quantum eigensolvers [63.277656713454284]
  We benchmark the accuracy of VQE and ADAPT-VQE to calculate the electronic ground states and potential energy curves. We find both methods provide good estimates of the energy and ground state. gradient-based optimization is more economical and delivers superior performance than analogous simulations carried out with gradient-frees.
  arXiv  Detail & Related papers  (2020-11-02T19:52:04Z)
• 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.