State-Averaged Quantum Algorithms for Multiconfigurational Surface Chemistry: A Benchmark on Rh@TiO2(110)

• URL: http://arxiv.org/abs/2604.17925v1
• Date: Mon, 20 Apr 2026 08:05:45 GMT
• Title: State-Averaged Quantum Algorithms for Multiconfigurational Surface Chemistry: A Benchmark on Rh@TiO2(110)
• Abstract summary: We establish a benchmark quantum algorithms in chemically motivated systems beyond minimal models.<n>We find that SAfUCCSD improves with increasing circuit depth but requires many parameters.<n>We find that SA-ADAPT achieves near-CF accuracy with significantly fewer operators.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Accurate modeling of surface catalytic processes often requires methods capable of describing strong correlation, charge transfer, and multiple closely lying electronic states. While density functional theory remains widely used, its limitations for localized electronic states motivate the use of wavefunction-based approaches and, more recently, quantum computing algorithms. However, the performance of quantum ansätze in chemically motivated, multistate settings remains largely unexplored. Here, we benchmark state-averaged factorized unitary coupled cluster with singles and doubles (SA-fUCCSD) and the adaptive, problem-tailored ansatz (SA-ADAPT) using an embedded cluster model of NO adsorption on Rh-doped TiO2(110). The system exhibits pronounced multiconfigurational character and multiple state crossings, providing a stringent test. State-averaged CASSCF serves as a reference, and the quantum ansätze are evaluated as solvers for the corresponding CASCI problem within a fixed orbital basis. We find that SA-fUCCSD improves with increasing circuit depth but requires many parameters and shows sensitivity to initialization. In contrast, SA-ADAPT achieves near-CASSCF accuracy with significantly fewer operators. A modified operator selection scheme, incorporating multiple operators per iteration, substantially accelerates convergence. Our results demonstrate the efficiency of adaptive ansätze for multistate problems and establish a controlled benchmark for quantum algorithms in chemically motivated systems beyond minimal models.

Related papers

• An Iterative Dual-Channel Neural Quantum State Algorithm for Selected Configuration Interaction [3.013377814843082]
  We introduce the Handover Iterative Neural Quantum State (HI-NQS) algorithm, which embeds a classically trained autoregressive Transformer neural quantum state within the iterative sample--diagonalize--update framework of Sample-Based Quantum Diagonalization.<n>HI-NQS achieves chemical accuracy on all systems tested, with determinant-count scaling substantially more favorable than conventional CIPSI-based SCI for all but the smallest active spaces.
  arXiv  Detail & Related papers  (2026-06-25T08:47:04Z)
• Chemically decisive benchmarks on the path to quantum utility [5.186218508509959]
  We introduce a curated hierarchy of benchmark systems designed to probe distinct regimes of electronic correlation relevant to molecular, bioinorganic, and heavy-element chemistry.<n>Our benchmark set spans multireference bond breaking (N$$), high-spin transition-metal chemistry (FeS), biologically relevant iron-sulfur clusters ([2Fe-2S]), and actinideactinide bonding (U$$$)<n>As a concrete realization, we benchmark a recently developed automated and adaptive quantum algorithm based on generator-inspired subspace expansion.
  arXiv  Detail & Related papers  (2026-01-15T19:24:51Z)
• Extending the Handover-Iterative VQE to Challenging Strongly Correlated Systems: $N_2$ and Fe-S Cluster [2.467148411642925]
  We introduce the Handover-Iterative Variational Quantum Eigensolver (HI-VQE) as a practical quantum computing algorithm with an iterative "handover" mechanism.<n>We benchmark two strongly correlated systems, the nitrogen molecule $N$ and iron-sulfur (Fe-S) cluster, which serve as stringent tests for both classical and quantum electronic-structure methods.
  arXiv  Detail & Related papers  (2026-01-11T14:51:51Z)
• 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)
• Quantum Approximate Optimization Algorithm for MIMO with Quantized b-bit Beamforming [47.98440449939344]
  Multiple-input multiple-output (MIMO) is critical for 6G communication, offering improved spectral efficiency and reliability.<n>This paper explores the use of the Quantum Approximate Optimization Algorithm (QAOA) and alternating optimization to address the problem of b-bit quantized phase shifters both at the transmitter and the receiver.<n>We demonstrate that the structure of this quantized beamforming problem aligns naturally with hybrid-classical methods like QAOA, as the phase shifts used in beamforming can be directly mapped to rotation gates in a quantum circuit.
  arXiv  Detail & Related papers  (2025-10-07T17:53:02Z)
• Solving the Hubbard model with Neural Quantum States [66.55653324211542]
  We study the state-of-the-art results for the doped two-dimensional (2D) Hubbard model.<n>We find different attention heads in the NQS ansatz can directly encode correlations at different scales.<n>Our work establishes NQS as a powerful tool for solving challenging many-fermions systems.
  arXiv  Detail & Related papers  (2025-07-03T14:08:25Z)
• 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)
• Projective Quantum Eigensolver with Generalized Operators [0.0]
  We develop a methodology for determining the generalized operators in terms of a closed form residual equations in the PQE framework. With the application on several molecular systems, we have demonstrated our ansatz achieves similar accuracy to the (disentangled) UCC with singles, doubles and triples.
  arXiv  Detail & Related papers  (2024-10-21T15:40:22Z)
• Projective Quantum Eigensolver via Adiabatically Decoupled Subsystem Evolution: a Resource Efficient Approach to Molecular Energetics in Noisy Quantum Computers [0.0]
  We develop a projective formalism that aims to compute ground-state energies of molecular systems accurately using Noisy Intermediate Scale Quantum (NISQ) hardware. We demonstrate the method's superior performance under noise while concurrently ensuring requisite accuracy in future fault-tolerant systems.
  arXiv  Detail & Related papers  (2024-03-13T13:27:40Z)
• 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)
• Simulating the Mott transition on a noisy digital quantum computer via Cartan-based fast-forwarding circuits [62.73367618671969]
  Dynamical mean-field theory (DMFT) maps the local Green's function of the Hubbard model to that of the Anderson impurity model. Quantum and hybrid quantum-classical algorithms have been proposed to efficiently solve impurity models. This work presents the first computation of the Mott phase transition using noisy digital quantum hardware.
  arXiv  Detail & Related papers  (2021-12-10T17:32:15Z)

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.