Excited-CAFQA: A classical simulation bootstrap for the variational estimation of molecular excited states

• URL: http://arxiv.org/abs/2509.20588v2
• Date: Tue, 04 Nov 2025 06:27:06 GMT
• Title: Excited-CAFQA: A classical simulation bootstrap for the variational estimation of molecular excited states
• Authors: Bikrant Bhattacharyya, Gokul Ravi,
• Abstract summary: Variational Quantum Algorithms (VQAs) are iterative algorithms suited to implementation on current-era quantum devices.<n>CAFQA protocol runs a discrete search through a classically simulatable subset of the entire state space.<n> Excited-CAFQA achieves 90 to 99+% accuracy across a variety of bond lengths and excited states for H2 and HeH+ molecular systems.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Variational Quantum Algorithms (VQAs) are iterative algorithms suited to implementation on current-era quantum devices. VQAs employ classical optimization to minimize cost functions evaluated on quantum circuits. However, the extent to which VQAs manage noise is often insufficient for quantum chemistry applications. One method of improving VQAs is through accurate ansatz initialization. The CAFQA (Clifford Ansatz For Quantum Accuracy) protocol runs a discrete search through a classically simulatable subset of the entire state space to find a desirable initialization. Prior work has evaluated CAFQA applied to the Variational Quantum Eigensolver (VQE), a VQA that computes grounds states of a Hamiltonian. Motivated by CAFQA's success, we propose Excited-CAFQA initialization for Variational Quantum Deflation (VQD), a quantum algorithm that extends VQE by allowing the computation of excited states. VQD recursively computes excited states, by constraining the kth state to be orthogonal to the previous k-1 computed energy states via a penalty term appended to the standard VQE cost function. Just as with VQE, the VQD cost function can be efficiently computed classically for the states considered in the discrete CAFQA search, allowing for the discrete CAFQA optimizer to find good initial parameters for each energy level computation. Preliminary evaluation shows that Excited-CAFQA achieves 90 to 99+% accuracy across a variety of bond lengths and excited states for H2 and HeH+ molecular systems.

Related papers

• 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)
• 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)
• 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)
• Warm-Starting the VQE with Approximate Complex Amplitude Encoding [0.26217304977339473]
  The Variational Quantum Eigensolver (VQE) is a quantum algorithm to determine the ground state of quantum-mechanical systems. We propose a warm-starting technique, that utilizes an approximation to generate beneficial initial parameter values for the VQE. Such warm-starts open the path to fruitful combinations of classical approximation algorithms and quantum algorithms.
  arXiv  Detail & Related papers  (2024-02-27T10:15:25Z)
• Study of Adaptative Derivative-Assemble Pseudo-Trotter Ansatzes in VQE through qiskit API [0.0]
  Variational Quantum Algorithms (VQAs) were designed to answer the problem of Quantum Phase Estimation Algorithm. ADAPT-VQE determines a quasi-optimal ansatz with a minimal number of parameters. We will compare all of these algorithms on different criterions such as the number of parameters, the accuracy or the number of CNOT gate used on H2 and LiH molecules.
  arXiv  Detail & Related papers  (2022-10-25T16:53:14Z)
• Error Mitigation-Aided Optimization of Parameterized Quantum Circuits: Convergence Analysis [42.275148861039895]
  Variational quantum algorithms (VQAs) offer the most promising path to obtaining quantum advantages via noisy processors. gate noise due to imperfections and decoherence affects the gradient estimates by introducing a bias. Quantum error mitigation (QEM) techniques can reduce the estimation bias without requiring any increase in the number of qubits. QEM can reduce the number of required iterations, but only as long as the quantum noise level is sufficiently small.
  arXiv  Detail & Related papers  (2022-09-23T10:48:04Z)
• CAFQA: A classical simulation bootstrap for variational quantum algorithms [8.659073885003684]
  The CAFQA ansatz is a hardware-efficient circuit built with only Clifford gates. CAFQA achieves mean accuracy improvements of 6.4x and 56.8x, over the state-of-the-art, on different metrics. With CAFQA's high-accuracy, the convergence of VQAs is shown to accelerate by 2.5x, even for small molecules.
  arXiv  Detail & Related papers  (2022-02-25T19:29:59Z)
• Improved variational quantum eigensolver via quasi-dynamical evolution [0.0]
  The variational quantum eigensolver (VQE) is a hybrid quantum-classical algorithm designed for current and near-term quantum devices. There are problems with VQE that forbid a favourable scaling towards quantum advantage. We propose and extensively test a quantum annealing inspired algorithm that supplements VQE. The improved VQE avoids barren plateaus, exits local minima, and works with low-depth circuits.
  arXiv  Detail & Related papers  (2022-02-21T11:21:44Z)
• A prescreening method for variational quantum state eigensolver [0.0]
  We propose a method to derive all of the states with high accuracy by using the Variational Quantum State Eigensolver (VQSE) and Subspace-Search VQE (SSVQE) methods. We show that by using the VQSE and the SSVQE prescreening methods, we can derive all of the hydrogen molecules states correctly.
  arXiv  Detail & Related papers  (2021-11-03T18:13:33Z)
• Quantum Approximate Optimization Algorithm Based Maximum Likelihood Detection [80.28858481461418]
  Recent advances in quantum technologies pave the way for noisy intermediate-scale quantum (NISQ) devices. Recent advances in quantum technologies pave the way for noisy intermediate-scale quantum (NISQ) devices.
  arXiv  Detail & Related papers  (2021-07-11T10:56:24Z)
• Efficient measure for the expressivity of variational quantum algorithms [72.59790225766777]
  We exploit an advanced tool in statistical learning theory, i.e., covering number, to study the expressivity of variational quantum algorithms. We first exhibit how the expressivity of VQAs with an arbitrary ansatze is upper bounded by the number of quantum gates and the measurement observable. We then explore the expressivity of VQAs on near-term quantum chips, where the system noise is considered.
  arXiv  Detail & Related papers  (2021-04-20T13:51:08Z)
• 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.